567. Permutation in String
来源:互联网 发布:中央财经大学数据库 编辑:程序博客网 时间:2024/05/19 01:11
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].
阅读全文
0 0
- 567. Permutation in String
- 567. Permutation in String
- 567. Permutation in String
- 567. Permutation in String
- [leetcode]567. Permutation in String
- 567. Permutation in String Medium
- [leetcode] 567. Permutation in String
- 【LeetCode】567. Permutation in String
- [LeetCode] 567. Permutation in String
- Leetcode 567. Permutation in String
- 567. Permutation in String 字符串置换
- leetcode 567. Permutation in String 滑动窗口
- [Leetcode] 567. Permutation in String 解题报告
- Permutation in String
- Permutation in String
- LeetCode567. Permutation in String
- 567Permutation in String
- LeetCode #567 Permutation in String
- 软考复习知识点自我总结
- 524. Longest Word in Dictionary through Deleting
- ABAP中对变式的处理
- C++常对象,常变量,长成员函数详解(转)
- 75. Sort Colors
- 567. Permutation in String
- HTML 5新增标签及CSS 3新增属性
- Java里重载的要求
- Regularization for DNN
- 80. Remove Duplicates from Sorted Array II
- 祭天时不同程序员的不同杀法
- 636. Exclusive Time of Functions
- 368. Largest Divisible Subset
- 208. Implement Trie (Prefix Tree)