• leetcode 87 Scramble String
  87. Scramble String We can scramble a string s to get a string t using the following algorithm: If the length of the string is 1, stop. If the length of the string is > 1, do the following: ...
  2020-01-23 02:09:32 | Algorithm
• leetcode 85 maximal rectangle
  85. Maximal Rectangle Given a rows x cols binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area. Ex Example 1: Input: matrix = [["1","0","1...
  2020-01-23 02:09:32 | Algorithm
• leetcode 84 Largest Rectangle in Histogram
  84. Largest Rectangle in Histogram Given an array of integers heights representing the histogram’s bar height where the width of each bar is 1, return the area of the largest rectangle in the hist...
  2020-01-23 02:09:32 | Algorithm
• leetcode 76 Minimum Window Substring
  76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is included i...
  2020-01-23 02:09:32 | Algorithm
• leetcode 72 Edit Distance 编辑距离 DP
  72. Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. You have the following three operations permitted on a word: ...
  2020-01-23 02:09:32 | Algorithm
• leetcode 31+46+60 下一个排列 Next Permutation/Permutations/Permutation Sequence backtrack
  31. Next Permutation 题目 整数数组的排列是将其成员排列成序列或线性顺序。 例如arr = [1,2,3]，下面是arr的所有排列：[1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1]。 整数数组的下一个排列是其整数的下一个字典顺序更大的排列。 更正式地说，如果数组的所有排列都根据其字典顺序在一个容器中...
  2020-01-23 02:09:32 | Algorithm
• leetcode 42 Trapping Rain Water 双指针
  42. Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Ex Example 1: Input: he...
  2020-01-23 02:09:32 | Algorithm
• leetcode 20+32 Longest Valid Parentheses 动态规划/DP
  20. Valid Parentheses Given a string s containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. An input string is valid if: Open brackets must be ...
  2020-01-23 02:09:32 | Algorithm