首页 > 代码库 > [LeetCode] Permutation in String
[LeetCode] Permutation in String
Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string‘s permutations is the substring of the second string.
Example 1:
Input:s1 = "ab" s2 = "eidbaooo"Output:TrueExplanation: s2 contains one permutation of s1 ("ba").
Example 2:
Input:s1= "ab" s2 = "eidboaoo"Output: False
Note:
- The input strings only contain lower case letters.
- The length of both given strings is in range [1, 10,000].
s
[LeetCode] Permutation in String
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。