Is Subsequence

本次的主題是關於檢測 subsequence，初始給出字串S與T，目的是要檢測在T中S是否存在在其中。

Given a string s and a string t, check if s is subsequence of t.

You may assume that there is only lower case English letters in both s and t. t is potentially a very long (length ~= 500,000) string, and s is a short string (<=100).

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not).

Example 1:
s = "abc", t = "ahbgdc"

Return true.

Example 2:
s = "axc", t = "ahbgdc"

Return false

我們可以利用貪婪算法的概念給出題目的解法，透過線性複雜度。其概念很簡單原代碼也不長:

#include<iostream>
#include<string>
using namespace std;


bool isSubsequence(string s, string t)
{
int slen = s.length();
int tlen = t.length();
int index = 0;
for(int i = 0; i < tlen && index < slen; i++)
{
if(t[i] == s[index])
index++;
}
return slen == index;
}

在此代碼中分別創建關於S T的長度變量，在for循環中，如果t[i]與s[index]匹配的話就將index++並繼續循環，很顯然，如果全部匹配成功的話index長度必定會與s[index]長度一樣，必且返回true。

結果: