• 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
• leetcode 141+142 Linked List Cycle 循环链表 快慢指针
  141. Linked List Cycle 描述 Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be r...
  2020-01-23 02:09:32 | Algorithm
• leetcode 139 word break 回溯 backtrack
  题目 Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the diction...
  2020-01-23 02:09:32 | Algorithm
• leetcode 135 Candy 递归+MEM
  题目 There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings. You are giving candies to these children subjected to the following requireme...
  2020-01-23 02:09:32 | Algorithm
• leetcode 131 Palindrome Partitioning 动态规划/回溯 DP/backtrack
  题目 131 描述 Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. Example 1: Input: s = "aab" Output: [["a...
  2020-01-23 02:09:32 | Algorithm