leetcode
文章平均质量分 57
迷上微笑
这个作者很懒,什么都没留下…
展开
-
First Bad Version
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the原创 2017-07-09 20:49:33 · 486 阅读 · 0 评论 -
Triangle
DescriptionSubmissionsSolutions Total Accepted: 98723Total Submissions: 299037Difficulty: MediumContributor: LeetCode Given a triangle, find the minimum path sum from top原创 2017-04-12 20:52:24 · 428 阅读 · 0 评论 -
Simplify Path
Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c" click to show corner cases. Corner Cases: Did原创 2017-03-13 21:41:50 · 187 阅读 · 0 评论 -
Validate Binary Search Tree
Validate Binary Search Tree Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with原创 2017-03-03 19:55:10 · 312 阅读 · 0 评论 -
Reverse Linked List II
Reverse Linked List II Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. N原创 2017-02-02 14:45:59 · 161 阅读 · 0 评论 -
Subsets II
Subsets II Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums原创 2017-01-30 14:16:42 · 173 阅读 · 0 评论 -
Subsets
Subsets Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3], a solution is: [原创 2017-01-30 11:44:56 · 224 阅读 · 0 评论 -
Gray Code
Gray Code The gray code is a binary numeral system where two successive values differ in only one bit. Given a non-negative integer n representing the total number of bits in the code, print t原创 2017-01-29 21:16:32 · 193 阅读 · 0 评论 -
Partition List
Partition List Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of原创 2017-01-29 17:56:01 · 177 阅读 · 0 评论 -
Search in Rotated Sorted Array II
Search in Rotated Sorted Array II Suppose an array sorted in ascending order 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). Write a原创 2017-01-21 18:08:34 · 337 阅读 · 0 评论 -
Find Peak Element
A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and return its index. The array may contain multiple peaks, in原创 2017-05-11 15:41:15 · 321 阅读 · 0 评论 -
Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest原创 2017-05-08 20:59:28 · 339 阅读 · 0 评论 -
Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. For example: Given原创 2017-07-07 19:15:16 · 352 阅读 · 0 评论 -
Single Number II
Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your algorithm should have a linear runtime complexity. Coul原创 2017-07-07 18:53:59 · 414 阅读 · 0 评论 -
Single Number
Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra原创 2017-07-07 18:36:52 · 256 阅读 · 0 评论 -
Perfect Squares
Given 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 12 = 4 + 4 + 4; given n =原创 2017-07-13 20:53:54 · 508 阅读 · 0 评论 -
Word Search II
Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those hor原创 2017-06-22 21:50:37 · 333 阅读 · 0 评论 -
Reverse Words in a String
Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update (2015-02-12): For C programmers: Try to solve it in-place in O(1原创 2017-06-22 20:24:42 · 361 阅读 · 0 评论 -
Add and Search Word - Data structure design
Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only lett原创 2017-06-21 11:12:46 · 277 阅读 · 0 评论 -
Implement Trie (Prefix Tree)
转自:http://www.cnblogs.com/grandyang/p/4491665.html Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z.转载 2017-06-21 11:02:04 · 457 阅读 · 0 评论 -
Repeated DNA Sequences
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原创 2017-05-21 17:32:59 · 403 阅读 · 0 评论 -
Remove Duplicates from Sorted List II
Remove Duplicates from Sorted List II Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given 1->2->原创 2017-01-21 17:10:52 · 258 阅读 · 0 评论 -
Remove Duplicates from Sorted Array II
Remove Duplicates from Sorted Array II Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example, Given sorted array nums = [1,1,1,2,2,3], Your function原创 2017-01-21 15:27:36 · 161 阅读 · 0 评论 -
Maximum Subarray
Maximum Subarray Find 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 contiguou原创 2016-12-26 13:15:45 · 177 阅读 · 0 评论 -
Pow(x, n)
Pow(x, n) Implement pow(x, n). 解题技巧: 在求pow(x,n)时,可以求pow(x, n/2),这样算法的时间复杂度为o(logn)。此外,在求解的过程中,注意INT_MIN与INT_MAX的转化, INT_MAX +1 = abs(INT_MIN) 代码: double myPow(double x, int n) { double原创 2016-12-25 21:51:29 · 185 阅读 · 0 评论 -
Group Anagrams
Group Anagrams Given an array of strings, group anagrams together. For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return: [ ["ate", "eat","tea"], ["nat","tan"], ["bat原创 2016-12-25 21:09:54 · 164 阅读 · 0 评论 -
Rotate Image
Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 解题思路: 方法1:计算出原矩阵中的各个数值在新矩阵中的位置原创 2016-12-23 21:49:57 · 210 阅读 · 0 评论 -
Permutations II
Permutations II Given a collection of numbers that might contain duplicates, return all possible unique permutations. For example, [1,1,2] have the following unique permutations: [ [原创 2016-12-23 20:03:37 · 197 阅读 · 0 评论 -
Permutations
Permutations Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1],原创 2016-12-23 19:39:27 · 223 阅读 · 0 评论 -
Sqrt(x)
Sqrt(x) Implement int sqrt(int x). Compute and return the square root of x. 解题技巧: 方法1:采用二分搜索法 方法2:牛顿切线法 计算x2 = n的解,令f(x)=x2-n,也就是求f(x)=0的解 首先取x0,如果x0不是解,做经过点(x0,f(x0))的切线,与x轴的交点原创 2017-01-03 18:46:46 · 284 阅读 · 0 评论 -
Minimum Path Sum
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. Note: You can only move e原创 2017-01-03 16:26:58 · 182 阅读 · 0 评论 -
Multiply Strings
Multiply Strings Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative.Converting the原创 2016-12-21 18:25:02 · 202 阅读 · 0 评论 -
Spiral Matrix
Spiral Matrix Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: [ [ 1, 2, 3 ], [ 4, 5, 6 ],原创 2016-12-26 15:27:51 · 188 阅读 · 0 评论 -
Jump Game
Jump Game Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that posit原创 2016-12-27 15:24:01 · 164 阅读 · 0 评论 -
Word Search
Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically原创 2017-01-21 12:20:11 · 178 阅读 · 0 评论 -
Unique Binary Search Trees
Unique Binary Search Trees 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原创 2017-02-08 15:55:41 · 217 阅读 · 0 评论 -
Combinations
Combinations Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2],原创 2017-01-09 20:28:59 · 185 阅读 · 0 评论 -
Unique Paths II
Unique Paths II Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 r原创 2016-12-30 14:52:03 · 186 阅读 · 0 评论 -
Unique Paths
Unique Paths A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is tr原创 2016-12-30 14:27:16 · 192 阅读 · 0 评论 -
Combination Sum II
Combination Sum II Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. Each number in C may only be原创 2016-12-19 22:06:42 · 227 阅读 · 0 评论