-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLeetcode392.swift
37 lines (27 loc) · 1.09 KB
/
Leetcode392.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
/**
Given two strings s and t, return true if s is a subsequence of t, or false otherwise.
A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., "ace" is a subsequence of "abcde" while "aec" is not).
**/
class Solution {
func isSubsequence(_ s: String, _ t: String) -> Bool {
if s.isEmpty {
return true
}
var smallArray = Array(s)
var superArray = Array(t)
var matchedIndex = 0
var finalIndex = smallArray.count
var returnValue = false
var counter = 0
while !returnValue && counter < superArray.count {
if superArray[counter] == smallArray[matchedIndex] {
matchedIndex = matchedIndex + 1
if matchedIndex == finalIndex {
returnValue = true
}
}
counter = counter + 1
}
return returnValue
}
}