392.Is Subsequence

来自WHY42
Riguz留言 | 贡献2024年2月19日 (一) 15:56的版本 (创建页面,内容为“=Description= {{LeetCode |id=is-subsequence |no=392 |difficulty=Easy |category=String |collection=Top 150 |title=Is Subsequence |summary=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 "ab…”)
(差异) ←上一版本 | 最后版本 (差异) | 下一版本→ (差异)

Description

#392 Is Subsequence Easy
String Top 150
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

pointer

Runtime 1ms
Memory 41.17MB
class Solution {
    public boolean isSubsequence(String s, String t) {
        if(t.length() < s.length()) return false;
        if(s.length() == 0) return true;
        int p = 0;
        for(int i = 0; i < t.length(); i++) {
            if(t.charAt(i) == s.charAt(p)) {
                if(p == s.length() -1) return true;
                p++;
            }
        }
        return false;
    }
}