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: ["flower","flow","flight"] Output: "fl"
Example 2:
Input: ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings.
Note:
All given inputs are in lowercase letters a-z
.
class Solution(object):def longestCommonPrefix_1(self, strs):""":type strs: List[str]:rtype: str"""if not strs:return ''for i in range(len(strs[0])):for string in strs[1:]:if i >= len(string) or string[i] != strs[0][i]:return string[:i]return strs[0]def longestCommonPrefix_2(self, strs):result = ''i = 0while True:try:sets = set(string[i] for string in strs)if len(sets) == 1:result += sets.pop()i += 1else:breakexcept Exception as e:breakreturn result
本文发布于:2024-01-27 23:00:40,感谢您对本站的认可!
本文链接:https://www.4u4v.net/it/17063676393165.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
留言与评论(共有 0 条评论) |