-
Notifications
You must be signed in to change notification settings - Fork 20.9k
Removing Arrays.fill() or for loops, added longest common substring #2027
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Closed
Closed
Changes from all commits
Commits
Show all changes
10 commits
Select commit
Hold shift + click to select a range
d0b43db
Using manual loop to fill DistanceMatrix with 0s
icoder211 38db103
Removed for loop because initialization by new keyword automatically …
icoder211 4b55b7a
Fixes #2009
icoder211 d9e3570
Added Longest common substring, solves #1781
icoder211 7d9493a
Delete LongestCommonSubstring.java
icoder211 4c151c6
Added Longest Common substring of two strings
icoder211 57c6c02
Merge pull request #1 from icoder211/icoder211-patch-1-1
icoder211 efb418a
Revert "Added Longest Common substring of two strings"
icoder211 fe48cfa
Merge pull request #2 from icoder211/revert-1-icoder211-patch-1-1
icoder211 0343228
added longest common substring
icoder211 File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,27 @@ | ||
| public class LongestCommonSubstring { | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Can you please add problem statement and other relevant info. |
||
|
|
||
| public static String string1, string2; | ||
| public static int[][] dp; | ||
| public static void main(String[] args) { | ||
| int res = 0; | ||
| string1 = "abbaf"; | ||
| string2 = "abcdef"; | ||
| int n = string1.length(); | ||
| int m = string2.length(); | ||
| dp = new int[n+1][m+1]; | ||
| for(int i = 0;i <= n;i++) { | ||
| dp[0][i] = 0; | ||
| dp[i][0] = 0; | ||
| } | ||
|
|
||
| for(int i = 1;i <= n;i++) { | ||
| for(int j = 1;j <= m;j++) { | ||
| if(string1.charAt(i-1) == string2.charAt(j-1)) { | ||
| dp[i][j] = 1 + dp[i-1][j-1]; | ||
| res = Math.max(res, dp[i][j]); | ||
| }else dp[i][j] = 0; | ||
| } | ||
| } | ||
| System.out.println(res); | ||
| } | ||
| } |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Good, thanks for considering this 👍