leetcode-problems/14_Longest_Common_Prefix.py at main · preetisharma0123/leetcode-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
"""
14. Longest Common Prefix
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: strs = ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings

 """

 class Solution(object):
    def longestCommonPrefix(self,strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        result = ""
        if len(strs)<=1:
            return strs[0]
        if 1<len(strs)<=200:
            small_len = len(strs[0])

            small_len = len(strs[0])

            for idx in range(1,len(strs)):
                if len(strs[idx])< small_len:
                    small_len = len(strs[idx])
            chr = 0
            while (chr<small_len):
                counter = 0
                for i in range(0,len(strs)-1):
                    if strs[i][chr]== strs[i+1][chr]:
                        counter +=1

                if counter == len(strs)-1:
                    result += strs[i][chr]
                else:
                    break
                chr +=1

            return result