Advertisement
Guest User

Untitled

a guest
Oct 18th, 2019
115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. class Solution:
  2. def longestCommonPrefix(self, strs: List[str]) -> str:
  3. if len(strs) < 1:
  4. return ""
  5. target_string = min(strs, key=len)
  6. if target_string == "":
  7. return ""
  8. prefix_length = -1
  9. for target_string_index in range(0, len(target_string)):
  10. target_char = target_string[target_string_index]
  11. for i in range(0, len(strs)):
  12. if(strs[i] == ""):
  13. return ""
  14. else:
  15. if strs[i][target_string_index] != target_char:
  16. if prefix_length < 0:
  17. return ""
  18. else:
  19. return target_string[:prefix_length + 1]
  20. prefix_length += 1
  21. return target_string
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement