Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upLongestRepeatingSequence #1724
Open
LongestRepeatingSequence #1724
Conversation
The longest sequence which has been repeated twice
strings/LongestRepeatingSequence
Outdated
| public class LongestRepeatingSequence { | ||
| //Checks for the largest common prefix | ||
| public static String lcp(String s, String t){ | ||
| int n = Math.min(s.length(),t.length()); | ||
| for(int i = 0; i < n; i++){ | ||
| if(s.charAt(i) != t.charAt(i)){ | ||
| return s.substring(0,i); | ||
| } | ||
| } | ||
| return s.substring(0,n); | ||
| } | ||
|
|
||
| public static void main(String[] args) { | ||
|
|
||
| Scanner sc = new Scanner(System.in); | ||
| String str = sc.next(); | ||
| String lrs=""; | ||
| int n = str.length(); | ||
| for(int i = 0; i < n; i++){ | ||
| for(int j = i+1; j < n; j++){ | ||
|
|
||
| String x = lcp(str.substring(i,n),str.substring(j,n)); | ||
| if(x.length() > lrs.length()) lrs=x; | ||
| } | ||
| } | ||
| System.out.println("Longest repeating sequence: "+lrs); | ||
| } | ||
| } |
Comment on lines
1
to
28
mertcandav
Oct 10, 2020
•
Hi. Whitespace patterns in the code are unbalanced. Please keep the number of spaces between operators and tokens.
Suggested change
| public class LongestRepeatingSequence { | |
| //Checks for the largest common prefix | |
| public static String lcp(String s, String t){ | |
| int n = Math.min(s.length(),t.length()); | |
| for(int i = 0; i < n; i++){ | |
| if(s.charAt(i) != t.charAt(i)){ | |
| return s.substring(0,i); | |
| } | |
| } | |
| return s.substring(0,n); | |
| } | |
| public static void main(String[] args) { | |
| Scanner sc = new Scanner(System.in); | |
| String str = sc.next(); | |
| String lrs=""; | |
| int n = str.length(); | |
| for(int i = 0; i < n; i++){ | |
| for(int j = i+1; j < n; j++){ | |
| String x = lcp(str.substring(i,n),str.substring(j,n)); | |
| if(x.length() > lrs.length()) lrs=x; | |
| } | |
| } | |
| System.out.println("Longest repeating sequence: "+lrs); | |
| } | |
| } | |
| public class LongestRepeatingSequence { | |
| //Checks for the largest common prefix | |
| public static String lcp(String s, String t) { | |
| int n = Math.min(s.length(), t.length()); | |
| for (int i = 0; i < n; i++) { | |
| if (s.charAt(i) != t.charAt(i)) { | |
| return s.substring(0, i); | |
| } | |
| } | |
| return s.substring(0,n); | |
| } | |
| public static void main(String[] args) { | |
| Scanner sc = new Scanner(System.in); | |
| String str = sc.next(); | |
| String lrs = ""; | |
| int n = str.length(); | |
| for (int i = 0; i < n; i++) { | |
| for (int j = i + 1; j < n; j++) { | |
| String x = lcp(str.substring(i, n), str.substring(j, n)); | |
| if (x.length() > lrs.length()) { | |
| lrs = x; | |
| } | |
| } | |
| } | |
| System.out.println("Longest repeating sequence: " + lrs); | |
| } | |
| } |
Himsahu
Oct 10, 2020
Author
Please accept all my pull request, so that I can participate in Hacktoberfest
|
Please add comments for the algorithm to be understood by all. |
|
LGTM 👍🏼 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
The longest sequence which has been repeated twice
Describe your change:
References
Checklist:
Fixes: #{$ISSUE_NO}.