[LeetCode 14. Longest Common Prefix ] Easy (19주차 6/10, 20/150)
Algorithm/LeetCode 문제 풀이 2019. 5. 12. 10:43예외처리 할 것들이 많았습니다.
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
ans = ""
length = len(strs)
if(length == 0):
return ans
elif(length == 1):
for i in range(len(strs[0])):
ans += strs[0][i]
leng = 1000
for i in range(length):
if(len(strs[i]) < leng):
leng = len(strs[i])
for i in range(leng):
for j in range(1, length):
if(strs[0][i] == strs[j][i]):
if(j == length -1):
ans += strs[0][i]
else:
continue
else:
return ans
return ans
'Algorithm > LeetCode 문제 풀이' 카테고리의 다른 글
[LeetCode 155. Min Stack ] Stack Easy (19주차 8/10, 22/150) (0) | 2019.05.12 |
---|---|
[LeetCode 20. Valid Parentheses ] Easy (19주차 7/10, 21/150) (0) | 2019.05.12 |
[LeetCode 13. Roman to Integer] Easy (19주차 5/10, 19/150) (0) | 2019.05.12 |
[LeetCode 709. To Lower Case] Easy (19주차 4/10, 18/150) (0) | 2019.05.11 |
[LeetCode 1. Two Sum Easy] O(N^2) 로 풀었다.(19주차 3/10, 17/150) (0) | 2019.05.11 |