438. Find All Anagrams in a String # 题目 # Given a string s and a non-empty string p, find all the start indices of p’s anagrams in s. Strings consists of lowercase English letters only and the length of both strings s and p will not be larger than 2
594. Reverse Words in a String III Easy 字符串的单词分别翻转再拼接到一起就好了 /fuxuemingzhu/article/details/70141268 595. Number of Lines To Write String Easy 使用字典保存每个字符的长度,然后统计每行的长度是否超过100就好了 /fuxuemingzhu/article/details/79810381 596. Reverse String Easy 字符串翻...
491 Increasing Subsequences Medium 39.30% 492 Construct the Rectangle Easy 49.70% 493 Reverse Pairs Hard 17.10% 494 Target Sum Medium 44.40% 495 Teemo Attacking Medium 51.90% 496 Next Greater Element I Easy 58.80% 498 Diagonal Traverse Medium 46.20% 499 The Maze III $ Hard 32.00% 500 Keyboard ...
659 Split Array into Consecutive Subsequences 39.40% Medium 658 Find K Closest Elements 36.30% Medium 657 Judge Route Circle 69.30% Easy 656 Coin Path $ 24.60% Hard 655 Print Binary Tree 50.80% Medium 654 Maximum Binary Tree 70.80% Medium 653 Two Sum IV - Input is a BST 50.60% Easy 652 ...
of digits match a pattern and string without using regular expressions warnsdorff's algorithm for knight's tour problem partition to k equal sum subsets print all possible path from source to destination n-queen problem print all subsequences of a string count unique path heap coding problems ...
LightOJ 1085 - All Possible Increasing Subsequences 树状数组+离散 http://www.lightoj.com/volume_showproblem.php?problem=1085 题意:求一个序列的递增子序列个数。 思路:找规律可以发现,某个数作为末尾数的种类数为所有比它小的数的情况+1。使用树状数组查找即可。 C++11 的auto在Lightoj上不能用/.\....
481.magical-string 482.license-key-formatting 483.smallest-good-base 484.find-permutation 485.max-consecutive-ones 486.predict-the-winner 487.max-consecutive-ones-ii 488.zuma-game 490.the-maze 491.increasing-subsequences 492.construct-the-rectangle 493.reverse-pairs 494.target-sum...
448. Find All Numbers Disappeared in an Array # 题目 # Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array. C
1234.Replace-the-Substring-for-Balanced-String (H-) 1498.Number-of-Subsequences-That-Satisfy-the-Given-Sum-Condition (H-) 1574.Shortest-Subarray-to-be-Removed-to-Make-Array-Sorted (H-) 1580.Put-Boxes-Into-the-Warehouse-II (H-) 1687.Delivering-Boxes-from-Storage-to-Ports (H) 1793.Maximum...
String Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring] <-> String Find Longest Recurring Subsequence in String <-> String Print all Subsequences of a string. <-> String Print all the permutations of the given string <-> ...