392.md

Is Subsequence

题目

Given a string s and a string t, check if s is subsequence of t.

You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string (<=100).

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).

Example 1: s = "abc", t = "ahbgdc"

Return true.

Example 2: s = "axc", t = "ahbgdc"

Return false.

思路

 很正常的一道贪心题。。。

代码

isSubsequence(s string, t string) bool {
    if len(s) == 0 {
        return true
    }
    i , j := 0, 0
    for j = 0; j < len(t); j++ {
        if t[j] == s[i] {
            i++
        }
        if i == len(s) {
            return true
        }
    }
    return false
}