LeetCode Problem
14. Longest Common Prefix
Link to LeetCode
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string "".
Example 1:
Input: strs = ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
class Solution {
public String longestCommonPrefix(String[] strs) {
if (null == strs || strs.length == 0) {
return "";
}
char ch;
StringBuilder result = new StringBuilder();
int i=0;
while (i < strs[0].length()) {
ch = strs[0].charAt(i);
for (int j=1; j= strs[j].length() || ch != strs[j].charAt(i)) {
return result.toString();
}
}
result.append(ch);
i++;
}
return result.toString();
}
}