Leetcode
文章平均质量分 58
qq379548839
这个作者很懒,什么都没留下…
展开
-
Leetcode 241. Different Ways to Add Parentheses[medium]
把唯一的一个easy刷了,开始medium。题意: Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +,原创 2016-09-19 22:15:00 · 323 阅读 · 0 评论 -
Leetcode 153. Find Minimum in Rotated Sorted Array & Leetcode 154. Find Minimum in Rotated Sorted Ar
153题目: Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in the arr原创 2016-10-26 20:32:48 · 271 阅读 · 0 评论 -
Leetcode 126. Word Ladder II[hard]
题目: Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:Only one letter can be changed at a time E原创 2016-10-27 13:23:43 · 308 阅读 · 0 评论 -
Leetcode 394. Decode String[medium]
这两天玩high了一点都不想学习。。。 但,,,作业还是要写的。 题目: Given an encoded string, return it’s decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeate原创 2016-10-04 09:19:31 · 263 阅读 · 0 评论 -
Leetcode 337. House Robber III[medium]
题目: The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a原创 2016-10-04 09:28:46 · 297 阅读 · 0 评论 -
Leetcode 332. Reconstruct Itinerary[medium]
题目: Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus原创 2016-10-07 21:15:01 · 336 阅读 · 0 评论 -
Leetcode 329. Longest Increasing Path in a Matrix[hard]
题目: Given an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside原创 2016-10-07 22:42:06 · 238 阅读 · 0 评论 -
Leetcode 124. Binary Tree Maximum Path Sum[hard]
题目: Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The原创 2016-10-07 23:32:47 · 233 阅读 · 0 评论 -
Leetcode 455. Assign Cookies[easy]
题目: Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a原创 2016-11-16 15:00:56 · 655 阅读 · 0 评论 -
Leetcode 452. Minimum Number of Arrows to Burst Balloons[medium]
题目: here are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it’s horizontal, y-coor原创 2016-11-16 15:47:56 · 386 阅读 · 0 评论 -
Leetcode 435. Non-overlapping Intervals[medium]
题目: Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note: You may assume the interval’s end point is always原创 2016-11-16 16:47:33 · 303 阅读 · 0 评论 -
Leetcode 330. Patching Array[hard]
题目: Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array.原创 2016-11-16 17:42:45 · 263 阅读 · 0 评论 -
Leetcode 321. Create Maximum Number[hard]
题目: Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. The relative order of the digits from the same a原创 2016-11-16 23:31:12 · 282 阅读 · 0 评论 -
Leetcode 416. Partition Equal Subset Sum[medium]
题目: Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note: Each of the array ele原创 2016-12-13 21:42:34 · 324 阅读 · 0 评论 -
Leetcode 357. Count Numbers with Unique Digits[medium]
题目: Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.Example: Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, ex原创 2016-11-27 19:40:20 · 454 阅读 · 0 评论 -
Leetcode 96. Unique Binary Search Trees[medium]
题目: Given 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.1 3 3 2 1 \原创 2016-11-27 19:57:06 · 237 阅读 · 0 评论 -
363. Max Sum of Rectangle No Larger Than K[hard]
题目: Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k.Example: Given matrix = [ [1, 0, 1], [0, -2, 3] ]原创 2016-11-27 21:05:43 · 435 阅读 · 0 评论 -
Leetcode 289. Game of Life[medium]
题目: According to the Wikipedia’s article: “The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.”Given a board with m by原创 2016-10-26 19:50:27 · 245 阅读 · 0 评论 -
Leetcode 365. Water and Jug Problem[medium]
题目: You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine whether it is possible to measure exactly z litres using these t原创 2016-10-26 19:01:05 · 289 阅读 · 0 评论 -
Leetcode 367. Valid Perfect Square[medium]
题目: Given a positive integer num, write a function which returns True if num is a perfect square else False.Note: Do not use any built-in library function such as sqrt.Example 1:Input: 16 Returns: Tr原创 2016-10-14 22:33:41 · 282 阅读 · 0 评论 -
Leetcode 169. Majority Element[easy]
GRE回归,响应老师号召,做分治题目。题目: Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and th原创 2016-09-19 21:11:07 · 272 阅读 · 0 评论 -
Leetcode 240. Search a 2D Matrix II[medium]
题目: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right. Integers in ea原创 2016-09-20 00:20:47 · 276 阅读 · 0 评论 -
Leetcode 215. Kth Largest Element in an Array[medium]
题目: Find 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, Given [3,2,1,5,6,4] and k = 2, return 5.N原创 2016-09-20 09:15:12 · 283 阅读 · 0 评论 -
Leetcode 327. Count of Range Sum[hard]
进入hard模式。题目: Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive. Range sum S(i, j) is defined as the sum of the elements in nums between indices i and j原创 2016-09-20 22:12:27 · 433 阅读 · 0 评论 -
Leetcode 315. Count of Smaller Numbers After Self[hard]
题目: You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].Example:G原创 2016-09-20 23:50:13 · 312 阅读 · 0 评论 -
Leetcode 312. Burst Balloons[hard]
题目: Given 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 burst balloon i you will get num原创 2016-09-23 23:28:03 · 274 阅读 · 0 评论 -
Leetcode 282. Expression Add Operators[hard]
题目: Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or * between the digits so they evaluate to the target value.Exa原创 2016-09-24 10:50:53 · 302 阅读 · 0 评论 -
Leetcode 218. The Skyline Problem[hard]
题目: A 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 locations and height of all the building原创 2016-09-26 16:34:42 · 312 阅读 · 0 评论 -
Leetcode 187. Repeated DNA Sequences[medium]
题目: All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: “ACGAATTCCG”. When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Wri原创 2016-10-12 20:42:56 · 254 阅读 · 0 评论 -
Leetcode 399. Evaluate Division[medium]
题目: Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If the answ原创 2016-10-12 22:38:13 · 279 阅读 · 0 评论 -
Leetcode 415. Add Strings[easy]
题目: Given two non-negative numbers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is < 5100. Both num1 and num2 contains only digits 0-9.原创 2016-10-14 10:13:46 · 227 阅读 · 0 评论 -
Leetcode 413. Arithmetic Slices[medium]
题目: A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.For example, these are arithmetic sequenc原创 2016-10-14 15:36:46 · 517 阅读 · 0 评论 -
Leetcode 400. Nth Digit[easy]
题目: Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, …Note: n is positive and will fit within the range of a 32-bit signed integer (n < 231).Example 1:Input: 3O原创 2016-10-14 16:09:38 · 202 阅读 · 0 评论 -
Leetcode 372. Super Pow[medium]
题目: Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.Example1:a = 2 b = [3]Result: 8 Example2:a = 2 b =原创 2016-10-14 17:13:23 · 296 阅读 · 0 评论 -
Leetcode 397. Integer Replacement[medium]
题目: Given a positive integer n and you can do operations as follow:If n is even, replace n with n/2. If n is odd, you can replace n with either n + 1 or n - 1. What is the minimum number of replacem原创 2016-10-14 16:49:00 · 244 阅读 · 0 评论 -
Leetcode 368. Largest Divisible Subset[medium]
题目: Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If there are multiple solutions, r原创 2016-10-14 22:22:29 · 251 阅读 · 0 评论 -
Leetcode 264. Ugly Number II[medium]
题目: Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10原创 2016-11-27 21:54:21 · 321 阅读 · 0 评论