-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathisSubSequence.java
More file actions
72 lines (57 loc) · 1.65 KB
/
Copy pathisSubSequence.java
File metadata and controls
72 lines (57 loc) · 1.65 KB
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
package Algorithms.TwoPointer;
/*
392. Is Subsequence
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
Constraints:
0 <= s.length <= 100
0 <= t.length <= 104
s and t consist only of lowercase English letters.
*/
public class isSubSequence {
public static void main(String[] args) {
String s = "abc", t = "ahbgdc";
Solution sol=new Solution();
System.out.println(sol.isSubsequence(s,t));
}
}
class Solution {
public boolean isSubsequence(String s, String t) {
int i=0,j=0;
while(i<s.length() && j<t.length())
{
if(s.charAt(i)==s.charAt(j)){
i++; //increment i only if there is a match
}
j++;
}
return i==s.length();//return check if is equals length of s. only then it means it has traversed through all characters of i
}
//alternate approach:
public boolean isSubsequence1(String s, String t) {
if(s.length()==0){
return true;
}
int i=0;
int j=0;
while(i<s.length() && j<t.length()){
if(s.charAt(i)==t.charAt(j)){
i++;
j++;
}else{
j++;
}
}
if(i==s.length()){
return true;
}else{
return false;
}
}
}