LeetCode Problem
392. Is Subsequence
Link to LeetCode
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
class Solution {
public boolean isSubsequence(String s, String t) {
if (s == null || t == null || s.length() > t.length()) return false;
if (s.length() == 0) return true;
int i=0, j=0;
while (j < t.length() ) {
if (s.charAt(i) == t.charAt(j)) {
i++;
}
if (i == s.length()) return true;
j++;
}
return i == s.length();
}
}