Skip to content

Create longestprefix.java #11

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

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
45 changes: 45 additions & 0 deletions longestprefix.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
package string;
public class longestprefix{
static String commonPrefixUtil(String str1, String str2) {
String result = "";
int n1 = str1.length(), n2 = str2.length();

// Compare str1 and str2
for (int i = 0, j = 0; i <= n1 - 1 && j <= n2 - 1; i++, j++) {
if (str1.charAt(i) != str2.charAt(j)) {
break;
}
result += str1.charAt(i);
}

return (result);
}

// A Function that returns the longest common prefix
// from the array of strings
static String commonPrefix(String arr[], int n) {
String prefix = arr[0];

for (int i = 1; i <= n - 1; i++) {
prefix = commonPrefixUtil(prefix, arr[i]);
}

return (prefix);
}

// Driver program to test above function
public static void main(String[] args) {
String arr[] = {"geeksforgeeks", "geeks",
"geek", "geezer"};
int n = arr.length;

String ans = commonPrefix(arr, n);

if (ans.length() > 0) {
System.out.printf("The longest common prefix is - %s",
ans);
} else {
System.out.printf("There is no common prefix");
}
}
}