[036] LeetCode 76演算法【Minimum Window Substring】最小窗口子字串

76. Minimum Window Substring(Hard)

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

[021] LeetCode 演算法 38【Count and Say】 計數器

38. Count and Say (Easy)

The count-and-say sequence is the sequence of integers with the first five terms as following:

1.     1
2.     11
3.     21
4.     1211
5.     111221

[016] LeetCode 49 演算法【Group Anagrams】 群組易位構詞

49. Group Anagrams(Medium)

Given an array of strings, group anagrams together.

Example:

Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
Output:
[
  ["ate","eat","tea"]…

[065] LeetCode 128 演算法【Longest Consecutive Sequence】最長連續序列

128. Longest Consecutive Sequence (Hard)

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

[063] LeetCode 42 演算法【Trapping Rain Water】收集雨水

42. Trapping Rain Water (Hard)

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

[045] LeetCode 134演算法【Gas Station】加油站

134. Gas Station (Medium)

There are N gas stations along a circular route, where the amount of gas at station i is gas[i].

You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from…

[043] LeetCode 41演算法【First Missing Positive】首位失蹤的正整數

41. First Missing Positive (Hard)

Given an unsorted integer array, find the smallest missing positive integer.

Example 1:

Input: [1,2,0]
Output: 3