392. Is Subsequence

最新推荐文章于 2022-07-28 09:03:49 发布

OovEver

最新推荐文章于 2022-07-28 09:03:49 发布

阅读量185

点赞数 1

分类专栏： LeetCode 文章标签： leetcode-java

本文链接：https://blog.csdn.net/mupengfei6688/article/details/78959307

版权

LeetCode 专栏收录该内容

137 篇文章 0 订阅

订阅专栏

392. Is Subsequence

题目描述：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.
题目大意：给定两个字符串s与t，判断s是否为t的子串。
思路：思路很简单直接看代码

代码

package DP;

/**
* @author OovEver
* 2018/1/3 11:11
*/
public class LeetCode392 {
  public boolean isSubsequence(String s, String t) {
      if (s.length() == 0) {
          return true;
      }
      int indexS = 0, indexT = 0;
      while (indexT < t.length()) {
          if (s.charAt(indexS) == t.charAt(indexT)) {
              indexS++;
              if (indexS == s.length()) {
                  return true;
              }
          }

          indexT++;
      }
      return false;
  }
}