g0001_0100.s0014_longest_common_prefix.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0001_0100.s0014_longest_common_prefix;
// #Easy #Top_Interview_Questions #String #Level_2_Day_2_String #Udemy_Strings
// #2022_06_14_Time_1_ms_(84.75%)_Space_42.2_MB_(41.54%)
public class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs.length < 1) {
return "";
}
if (strs.length == 1) {
return strs[0];
}
String temp = strs[0];
int i = 1;
String cur;
while (temp.length() > 0 && i < strs.length) {
if (temp.length() > strs[i].length()) {
temp = temp.substring(0, strs[i].length());
}
cur = strs[i].substring(0, temp.length());
if (!cur.equals(temp)) {
temp = temp.substring(0, temp.length() - 1);
} else {
i++;
}
}
return temp;
}
}