Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution:
- def longestCommonPrefix(self, strs: List[str]) -> str:
- if len(strs) < 1:
- return ""
- target_string = min(strs, key=len)
- if target_string == "":
- return ""
- prefix_length = -1
- for target_string_index in range(0, len(target_string)):
- target_char = target_string[target_string_index]
- for i in range(0, len(strs)):
- if(strs[i] == ""):
- return ""
- else:
- if strs[i][target_string_index] != target_char:
- if prefix_length < 0:
- return ""
- else:
- return target_string[:prefix_length + 1]
- prefix_length += 1
- return target_string
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement