LeetCode
monkey_rose
这个作者很懒,什么都没留下…
展开
-
LeetCode 312. Burst Balloons--动态规划
题目链接312. Burst BalloonsGiven n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you原创 2017-09-23 17:05:38 · 210 阅读 · 0 评论 -
LeetCode 199. Binary Tree Right Side View
题目链接199. Binary Tree Right Side ViewGiven a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For exam原创 2017-11-21 20:08:38 · 122 阅读 · 0 评论 -
LeetCode 60. Permutation Sequence
题目链接60. Permutation SequenceThe set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, f原创 2017-12-09 19:10:56 · 153 阅读 · 0 评论 -
LeetCode 87. Scramble String
题目链接87. Scramble StringGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "grea原创 2017-12-05 21:03:22 · 134 阅读 · 0 评论 -
LeetCode 112. Path Sum--递归
题目链接112. Path SumGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the原创 2017-12-24 16:20:32 · 124 阅读 · 0 评论 -
LeetCode 141. Linked List Cycle
题目链接141. Linked List CycleGiven a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?解:满足 without using extra space这个要求的话,可原创 2017-12-24 17:16:46 · 132 阅读 · 0 评论 -
LeetCode 236. Lowest Common Ancestor of a Binary Tree--递归
题目链接236. Lowest Common Ancestor of a Binary TreeGiven a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia:原创 2017-12-08 09:36:12 · 131 阅读 · 0 评论 -
LeetCode 207. Course Schedule--Graph
题目链接207. Course ScheduleThere are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first tak原创 2018-01-11 18:12:43 · 189 阅读 · 0 评论 -
KITE--NP-complete
8.19A kite is a graph on an even number of vertices, say 2n, in which n of the vertices form a clique and the remaining n vertices are connected in a "tail" that consists of a path joined to one of原创 2018-01-03 16:50:53 · 516 阅读 · 0 评论 -
LeetCode 44. Wildcard Matching--动态规划
题目链接44. Wildcard MatchingImplement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty原创 2018-01-13 21:36:45 · 589 阅读 · 0 评论 -
LeetCode 310. Minimum Height Trees--Graph
题目链接For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are calle...原创 2018-07-22 00:59:26 · 151 阅读 · 0 评论 -
LeetCode 200. Number of Islands&130. Surrounded Regions--DFS
两道题应该分别是我在蓝桥杯和南大夏令营遇到的原题,比较相似题目链接200. Number of IslandsGiven a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connect...原创 2018-08-14 18:39:55 · 177 阅读 · 0 评论 -
LeetCode 773. Sliding Puzzle--BFS
求最短的step这类问题可以用BFS解决,我的博客也有一道类似的题目跳蚱蜢 773. Sliding PuzzleOn a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.A move consists of choo...原创 2018-09-17 15:31:54 · 540 阅读 · 0 评论 -
LeetCode 42. Trapping Rain Water
题目链接42. Trapping Rain WaterGiven 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. For exampl原创 2017-11-20 21:01:13 · 104 阅读 · 0 评论 -
LeetCode 85. Maximal Rectangle&221. Maximal Square--动态规划
题目链接221. Maximal SquareGiven a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.For example, given the following matrix:1 0 1 0原创 2017-11-06 15:37:50 · 352 阅读 · 0 评论 -
LeetCode 279. Perfect Squares--动态规划
279. Perfect SquaresGiven a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 1原创 2017-11-05 16:43:36 · 274 阅读 · 0 评论 -
LeetCode 198. House Robber 213. House Robber II--动态规划
题目链接198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each原创 2017-09-18 21:39:43 · 395 阅读 · 0 评论 -
LeetCode 53. Maximum Subarray--Divide and Conquer(分治法)
题目链接53. Maximum SubarrayFind the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the原创 2017-09-17 18:40:38 · 984 阅读 · 0 评论 -
LeetCode 218. The Skyline Problem--Divide and Conquer(分治法)
题目链接218. The Skyline ProblemA city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locati原创 2017-09-13 21:45:32 · 2835 阅读 · 0 评论 -
LeetCode 215. Kth Largest Element in an Array--Divide and Conquer(分治法)
215. Kth Largest Element in an ArrayFind the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Giv原创 2017-09-12 19:39:28 · 268 阅读 · 0 评论 -
LeetCode 169.Majority Element--Divide and Conquer(分治法)
分治法的设计思想是:将一个难以直接解决的大问题,分割成一些规模较小的相同问题,以便各个击破,分而治之。题目:169.Majority Element(题目链接)Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.原创 2017-09-11 15:34:30 · 597 阅读 · 0 评论 -
LeetCode 464. Can I Win--动态规划
题目链接464. Can I WinIn the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach or exceed 100 wins. W原创 2017-09-28 13:06:22 · 819 阅读 · 0 评论 -
LeetCode 650. 2 Keys Keyboard--动态规划
题目链接650. 2 Keys KeyboardInitially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:Copy All: You can copy all the characters p原创 2017-09-20 20:30:36 · 403 阅读 · 0 评论 -
LeetCode 37. Sudoku Solver--回溯法
题目链接37. Sudoku SolverWrite a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character '.'.You may assume that there will be only one uni原创 2017-11-07 19:10:35 · 297 阅读 · 0 评论 -
LeetCode 131. Palindrome Partitioning--回溯法
题目链接131. Palindrome PartitioningGiven a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given原创 2017-11-08 13:29:55 · 284 阅读 · 0 评论 -
LeetCode 316. Remove Duplicate Letters--贪心算法
题目链接316. Remove Duplicate LettersGiven a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your result原创 2017-10-15 16:23:48 · 289 阅读 · 0 评论 -
LeetCode 135. Candy--贪心算法
题目链接135. CandyThere are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the following requirements:Each原创 2017-09-29 15:04:45 · 370 阅读 · 0 评论 -
LeetCode 95. Unique Binary Search Trees II&96. Unique Binary Search Trees--动态规划,二叉树
题目链接96. Unique Binary Search TreesGiven n, how many structurally unique BST's (binary search trees) that store values 1...n?For example,Given n = 3, there are a total of 5 unique BST's原创 2017-11-04 19:28:59 · 239 阅读 · 0 评论 -
LeetCode 120. Triangle
题目链接Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], ...原创 2018-12-12 13:59:56 · 173 阅读 · 0 评论