14. Longest Common Prefix
2016-03-23 12:54
267 查看
Java
public class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length==0) return "";
int count=0; boolean search=true;
while(search){
if(strs[0].length()<=count) break;
for(int i=1; i<strs.length; i++){
if(strs[i].length()<=count||strs[i].charAt(count)!=strs[i-1].charAt(count)) {search=false; count--; break;}
}
count++;
}
return strs[0].substring(0,count);
}
}
Python
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if len(strs)==0:
return ""
minLen=sys.maxint
maxPre=""
for i in range(len(strs)):
minLen=min(minLen,len(strs[i]))
for i in range(minLen):
for j in range(len(strs)-1):
if strs[j][i]!=strs[j+1][i]:
return maxPre
maxPre+=strs[0][i]
return maxPre
public class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length==0) return "";
int count=0; boolean search=true;
while(search){
if(strs[0].length()<=count) break;
for(int i=1; i<strs.length; i++){
if(strs[i].length()<=count||strs[i].charAt(count)!=strs[i-1].charAt(count)) {search=false; count--; break;}
}
count++;
}
return strs[0].substring(0,count);
}
}
Python
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if len(strs)==0:
return ""
minLen=sys.maxint
maxPre=""
for i in range(len(strs)):
minLen=min(minLen,len(strs[i]))
for i in range(minLen):
for j in range(len(strs)-1):
if strs[j][i]!=strs[j+1][i]:
return maxPre
maxPre+=strs[0][i]
return maxPre
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解