-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day7_AppendCharacterstoStringtoMakeSubsequence.txt
68 lines (48 loc) · 1.64 KB
/
Day7_AppendCharacterstoStringtoMakeSubsequence.txt
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
// You are given two strings s and t consisting of only lowercase English letters.
// Return the minimum number of characters that need to be appended to the end of s so that t becomes a subsequence of s.
// A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
// Example 1:
// Input: s = "coaching", t = "coding"
// Output: 4
// Explanation: Append the characters "ding" to the end of s so that s = "coachingding".
// Now, t is a subsequence of s ("coachingding").
// It can be shown that appending any 3 characters to the end of s will never make t a subsequence.
// Example 2:
// Input: s = "abcde", t = "a"
// Output: 0
// Explanation: t is already a subsequence of s ("abcde").
// Example 3:
// Input: s = "z", t = "abcde"
// Output: 5
// Explanation: Append the characters "abcde" to the end of s so that s = "zabcde".
// Now, t is a subsequence of s ("zabcde").
// It can be shown that appending any 4 characters to the end of s will never make t a subsequence.
// Constraints:
// 1 <= s.length, t.length <= 105
// s and t consist only of lowercase English letters.
// Topics
// Two Pointers
// String
// Greedy
// Solution:
class Solution {
public:
int sub(string s,string t){
int n=s.size();
int m=t.size();
int i=0,j=0;
while(i<n && j<m){
if(t[j]==s[i]){
j++;
}
i++;
}
return j;
}
int appendCharacters(string s, string t) {
int n=s.size();
int m=t.size();
int x=sub(s,t);
return m- x;
}
};