LeetCode #14 Longest Common Prefix
Longest Common Prefix
Link : Longest Common Prefix
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 ""
Ex 1:
Ex 2:
Constraints
Java code
class LC5 {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 1){
return strs[0];
}
String answer = compareString(strs[0], strs[1]);
if (strs.length == 2){
return answer;
}
for(int i = 2; i<strs.length; i++){
answer = compareString(answer, strs[i]);
}
return answer;
}
static String compareString(String str1, String str2){
String[] tmpList = lengthCompare(str1, str2);
String maxStr = tmpList[0];
String minStr = tmpList[1];
StringBuilder answer = new StringBuilder();
for(int i = 0; i < minStr.length(); i++){
if (maxStr.charAt(i) != minStr.charAt(i)){
break;
}
answer.append(minStr.charAt(i));
}
return String.valueOf(answer);
}
static String[] lengthCompare(String str1, String str2){
String[] strList = new String[2]; // strList = [maxStr, minStr]
int str1Length = str1.length();
int str2Length = str2.length();
String maxStr = "";
String minStr = "";
if (str1Length > str2Length){
strList[0] = str1;
strList[1] = str2;
return strList;
}
strList[0] = str2;
strList[1] = str1;
return strList;
}
}
に答える
static String[] lengthCompare(String str1, String str2)
static String CompareString(String str1, String str2)
answer
)を返します.public String longestCommonPrefix(String[] strs)
CompareString
メソッドで求めたプレフィックスが返されます.CompareString
メソッドの引数として、接頭辞を更新して返します.教訓
Reference
この問題について(LeetCode #14 Longest Common Prefix), 我々は、より多くの情報をここで見つけました https://velog.io/@nathan29849/LeetCode-14-Longest-Common-Prefixテキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol