LeetCode2
文章平均质量分 76
1.02^365的成长裂变
每天比别人努力一点,坚持下去就是裂变的威力~
展开
-
[LeetCode] 001: 3Sum
[Problem]Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c原创 2017-09-10 20:47:28 · 3564 阅读 · 0 评论 -
[LeetCode] 002: 3Sum Closest
[Problem]Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would h原创 2017-09-10 20:47:31 · 3601 阅读 · 0 评论 -
[LeetCode] 003: 4Sum
[Problem]Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Element原创 2017-09-10 20:47:34 · 3572 阅读 · 0 评论 -
[LeetCode] 004: Add Binary
[Problem]Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".[Solution]class Solution {public: string addBinary(string a, string b) {原创 2017-09-10 20:47:37 · 3597 阅读 · 0 评论 -
[LeetCode] 005: Add Two Numbers
[Problem]You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i原创 2017-09-10 20:47:40 · 3571 阅读 · 0 评论 -
[LeetCode] 006: Anagrams
[Problem]Given an array of strings, return all groups of strings that are anagrams.Note: All inputs will be in lower-case.[Solution]class Solution {public: // get hash value of a string int h原创 2017-09-10 20:47:42 · 3568 阅读 · 0 评论 -
[LeetCode] 007: Balanced Binary Tree
[Problem]Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node ne原创 2017-09-10 20:47:45 · 3587 阅读 · 0 评论 -
[LeetCode] 008: Best Time to Buy and Sell Stock
[Problem]Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the原创 2017-09-10 20:47:48 · 3567 阅读 · 0 评论 -
[LeetCode] 009: Best Time to Buy and Sell Stock II
[Problem]Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie原创 2017-09-10 20:47:51 · 3585 阅读 · 0 评论 -
[LeetCode] 010: Best Time to Buy and Sell Stock III
[Problem]Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most two transactions.Note:You原创 2017-09-10 20:47:54 · 3578 阅读 · 0 评论 -
[LeetCode] 011: Binary Tree Inorder Traversal
[Problem]Given a binary tree, return the inorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,3,2].Note: Recursive solution原创 2017-09-10 20:47:57 · 3551 阅读 · 0 评论 -
[LeetCode] 012: Binary Tree Level Order Traversal
[Problem]Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20原创 2017-09-10 20:48:00 · 3559 阅读 · 0 评论 -
[LeetCode] 013: Binary Tree Level Order Traversal II
[Problem]Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For example:Given binary tree {3,9,20,#,#,原创 2017-09-10 20:48:03 · 3573 阅读 · 0 评论 -
[LeetCode] 014: Binary Tree Maximum Path Sum
[Problem]Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.原创 2017-09-10 20:48:06 · 3659 阅读 · 0 评论 -
[LeetCode] 015: Binary Tree Zigzag Level Order Traversal
[Problem]Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).For example:Given原创 2017-09-10 20:48:08 · 3575 阅读 · 0 评论 -
[LeetCode] 016: Climbing Stairs
[Problem]You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?[Solution]class Solution原创 2017-09-10 20:48:11 · 3589 阅读 · 0 评论 -
[LeetCode] 017: Combination Sum
[Problem]Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The same repeated number may be chosen from C unlimi原创 2017-09-10 20:48:14 · 3567 阅读 · 0 评论 -
[LeetCode] 018: Combination Sum II
[Problem]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 used once in the原创 2017-09-10 20:48:16 · 3545 阅读 · 0 评论 -
[LeetCode] 019: Combinations
[Problem]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], [1,3],原创 2017-09-10 20:48:19 · 3571 阅读 · 0 评论 -
[LeetCode] 020: Construct Binary Tree from Inorder and Postorder Traversal
[Problem]Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.[Solution]/** * Definition for binary tree * struct原创 2017-09-10 20:48:22 · 3572 阅读 · 0 评论 -
[LeetCode] 021: Construct Binary Tree from Preorder and Inorder Traversal
[Problem]Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.[Solution]/** * Definition for binary tree * struct原创 2017-09-10 20:48:25 · 3613 阅读 · 0 评论 -
[LeetCode] 022: Container With Most Water
[Problem]Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0).原创 2017-09-10 20:48:27 · 3598 阅读 · 0 评论 -
[LeetCode] 023: Convert Sorted Array to Binary Search Tree
[Problem]Given an array where elements are sorted in ascending order, convert it to a height balanced BST.[Solution]/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *原创 2017-09-10 20:48:30 · 3563 阅读 · 0 评论 -
[LeetCode] 024: Convert Sorted List to Binary Search Tree
[Problem]Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.[Solution]/** * Definition for singly-linked list. * struct ListNode { * int v原创 2017-09-10 20:48:33 · 3588 阅读 · 0 评论 -
[LeetCode] 025: Count and Say
[Problem]The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11.11 is read off as "two 1s" or 21.21 is read off a原创 2017-09-10 20:48:35 · 3602 阅读 · 0 评论 -
[LeetCode] 026: Decode Ways
[Problem]A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the原创 2017-09-10 20:48:38 · 3572 阅读 · 0 评论 -
[LeetCode] 027: Distinct Subsequences
[Problem]Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some原创 2017-09-10 20:48:41 · 3596 阅读 · 0 评论 -
[LeetCode] 028: Divide Two Integers
[Problem]Divide two integers without using multiplication, division and mod operator.[Analysis]注意:while(a > (b 这个很重要,使用a > (b = (b 使用cnt [Solution]class Solution{public: int divide(int dividend, int原创 2017-09-10 20:48:44 · 3619 阅读 · 0 评论 -
[LeetCode] 029: Edit Distance
[Problem]Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted原创 2017-09-10 20:48:47 · 3608 阅读 · 0 评论 -
[LeetCode] 030: First Missing Positive
[Problem]Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses原创 2017-09-10 20:48:50 · 3576 阅读 · 0 评论 -
[LeetCode] 031: Flatten Binary Tree to Linked List
[Problem]Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened tree should look like: 1原创 2017-09-10 20:48:52 · 3548 阅读 · 0 评论 -
[LeetCode] 032: Generate Parentheses
[Problem]Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(()原创 2017-09-10 20:48:58 · 3579 阅读 · 0 评论 -
[LeetCode] 033: Gray Code
[Problem]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 the seque原创 2017-09-10 20:49:01 · 3604 阅读 · 0 评论 -
[LeetCode] 034: Implement strStr()
[Problem]Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. [Analysis]KMP算法,注意:如果needle长度为0,则返回haystack.[Solution]class原创 2017-09-10 20:49:04 · 3567 阅读 · 0 评论 -
[LeetCode] 035: Insert Interval
[Problem]Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start time原创 2017-09-10 20:49:07 · 3579 阅读 · 0 评论 -
[LeetCode] 036: Integer to Roman
[Problem]Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.[Solution]class Solution {public: string intToRoman(int num) { // Start原创 2017-09-10 20:49:09 · 3565 阅读 · 0 评论 -
[LeetCode] 037: Interleaving String
[Problem]Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 = "aabcc",s2 = "dbbca",When s3 = "aadbbcbcac", return true.When s3 = "aadbbbaccc"原创 2017-09-10 20:49:12 · 3620 阅读 · 0 评论 -
[LeetCode] 038: Jump Game
[Problem]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 position. De原创 2017-09-10 20:49:15 · 3575 阅读 · 0 评论 -
[LeetCode] 039: Jump Game II
[Problem]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 position. Yo原创 2017-09-10 20:49:18 · 3571 阅读 · 0 评论 -
[LeetCode] 040: Largest Rectangle in Histogram
[Problem]Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.Above is a histogram where原创 2017-09-10 20:49:21 · 3584 阅读 · 0 评论