Is Subsequence

最新推荐文章于 2024-02-12 08:00:00 发布

flyatcmu

最新推荐文章于 2024-02-12 08:00:00 发布

阅读量422

点赞数

分类专栏： Two pointers 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u013325815/article/details/123888113

版权

Two pointers 专栏收录该内容

77 篇文章

订阅专栏

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).

Example 1:

Input: s = "abc", t = "ahbgdc"
Output: true

Example 2:

Input: s = "axc", t = "ahbgdc"
Output: false

Constraints:

0 <= s.length <= 100
0 <= t.length <= 104
s and t consist only of lowercase English letters.

思路：双指针，用j来循环t，如果找到了s.charAt(i), 那么i++，如果i == s.length()，就证明我找完了。

class Solution {
    public boolean isSubsequence(String s, String t) {
        if(s.isEmpty()) {
            return true;
        }
        if(s.length() > t.length()) {
            return false;
        }
        int i = 0;
        for(int j = 0; j < t.length(); j++) {
            if(t.charAt(j) == s.charAt(i)) {
                i++;
            }
            if(i == s.length()) {
                return true;
            }
        }
        return i == s.length();
    }
}