-
Notifications
You must be signed in to change notification settings - Fork 0
/
014LongestCommonPrefix.swift
42 lines (36 loc) · 1.36 KB
/
014LongestCommonPrefix.swift
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
/*
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.
*/
struct Solution {
static func longestCommonPrefix(_ strs: [String]) -> String {
var finalString = strs.first ?? ""
for passedString in strs {
guard finalString != passedString else { continue }
let passedStringCharArray = Array(passedString)
let finalStringCopy = finalString
for (index, char) in finalStringCopy.enumerated() {
guard (finalString.count - 1) >= index else { break }
let stringIndex = finalStringCopy.index(
finalStringCopy.startIndex,
offsetBy: index
)
guard index < passedStringCharArray.count else {
finalString = String.init(finalString.prefix(upTo: stringIndex))
continue
}
if passedStringCharArray[index] != char {
finalString = String.init(finalString.prefix(upTo: stringIndex))
}
}
}
return finalString
}
}