xxxxxxxxxx
import os
Strs = ['flower', 'flu', 'flank']
common_prefix = os.path.commonprefix(Strs)
print("Common Prefix:", common_prefix)
xxxxxxxxxx
class Solution:
def longestCommonPrefix(self, strs):
result = []
for i in zip(*strs):
if len(set(i)) != 1:
break
result.append(i[0])
return "".join(result)
"""The zip() method returns a zip object, which is an iterator of tuples where
the first item in each passed iterator is paired together, and then the second item in
each passed iterator are paired together etc.
If the passed iterators have different lengths, the iterator with the least items
decides the length of the new iterator.
set() method is used to convert any of the iterable to sequence of iterable elements
with distinct elements, commonly called Set.
"""
Task = Solution()
print("3a. ",Task.longestCommonPrefix(["flower","flow","flight"]))
print("3b. ",Task.longestCommonPrefix(["dog","racecar","car"]))
xxxxxxxxxx
class Solution:
def longestCommonPrefix(self, strs):
result = ""
for i in range(len(strs[0])): # Pick any word in the list and loop through its length. Thats the number of times youre to loop thu the list
# because your answer cant be longer in length than any word in the list
for word in strs: # loop through the words in the the list so you can use the word[i] to acces the letters of each word
if i == len(word) or word[i] != strs[0][i]: # stop code by returning result if loop count(i) is same as length of your chosen word
return result # or if theres no more similar between other words and your chosen word
result = result + strs[0][i] # otherwise keep adding the similar letters that occur in same position in all the words to the result
Task = Solution()
print(Task.longestCommonPrefix(["flower","flow","flight"]))
print(Task.longestCommonPrefix(["dog","racecar","car"]))
xxxxxxxxxx
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
}
};
xxxxxxxxxx
/**
* @param {string[]} strs
* @return {string}
*/
var longestCommonPrefix = function(strs) {
};
xxxxxxxxxx
# @param {String[]} strs
# @return {String}
def longest_common_prefix(strs)
end
xxxxxxxxxx
class Solution {
func longestCommonPrefix(_ strs: [String]) -> String {
}
}