-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode392.java
More file actions
36 lines (30 loc) · 938 Bytes
/
LeetCode392.java
File metadata and controls
36 lines (30 loc) · 938 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/*
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
*/
public class LeetCode392 {
static public boolean isSubsequence(String s, String t) {
int i=0,j=0;
if(s.length()==0) return true;
while(i<s.length()&&j<t.length()){
if(s.charAt(i)==t.charAt(j)){
i++; j++;
}
else j++;
}
if(i==s.length()) return true;
return false;
}
public static void main(String[] args) {
System.out.println(isSubsequence("axc", "ahbgdc"));
}
}