g0301_0400.s0392_is_subsequence.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0301_0400.s0392_is_subsequence;
// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19
// #Level_1_Day_2_String #Udemy_Two_Pointers #2022_07_13_Time_1_ms_(93.01%)_Space_42.2_MB_(32.57%)
public class Solution {
public boolean isSubsequence(String s, String t) {
int i = 0;
int j = 0;
int n = t.length();
int m = s.length();
if (m == 0) {
return true;
}
while (j < n) {
if (s.charAt(i) == t.charAt(j)) {
i++;
if (i == m) {
return true;
}
}
j++;
}
return false;
}
}