14. Longest Common Prefix
来源:互联网 发布:上瘾网络剧全集 编辑:程序博客网 时间:2024/06/06 13:02
题目:Write a function to find the longest common prefix string amongst an array of strings.
思路:找出最小长度的字符串,逐个子集判断,判断时可以使用set,最后判断set元素是否为1个即可。
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if len(strs)==0:return ''
ind=0;minLen=len(strs[0])
for i in range(len(strs)):
if len(strs[i])<minLen:
ind = i;minLen=len(strs[i])
r = ''
for i in range(minLen):
s = set()
for j in strs:
s.add(j[:i+1])
if len(s)>1:return r
r = s.pop()
del s
return r
0 0
- 14. Longest Common Prefix
- 14.Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 14. Longest Common Prefix
- 什么是哈弗曼树
- PAT甲级练习1025. PAT Ranking (25)
- java大数据框架
- android多图选择器demo
- linux下特殊权限位的使用
- 14. Longest Common Prefix
- 解决Mac用Navicat连接Oracle数据库报ORA-21561: OID generation failed
- atexit FILE 粘滞位和缓冲区
- 被Nginx代理后从REQUEST获取客户端IP地址
- JSONP与跨域的Ajax
- Jackson
- [高性能MySQL]--MySQL的架构与概念
- unorder_map的底层实现方法
- PB中一些技巧