LeetCode - 392. Is Subsequence(Two Pointers, DP, String)*

문제

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

https://leetcode.com/problems/is-subsequence/description/?envType=study-plan&id=level-1

Example 1:

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

Example 2:

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

풀이

class Solution {
    public boolean isSubsequence(String s, String t) {
        int i=0;
        int j=0;

        while(i<s.length()&&j<t.length()){
            char a = s.charAt(i);
            char b = t.charAt(j);
            if(a==b) i++;
            
            j++;
        }

        return i==s.length();
    }
}