It will still pass the Leetcode test cases as they do not check for ordering, but it is not a lexicographical order. Input: Digit string "23" if (sum > target) Note: All numbers (including target) will be positive integers. }, for (int i = startIndex; i < candidates.Length; i++) Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. Question: 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 unlimited number of times.. 10:21. * @param k: Given the numbers of combinations * @return: All the combinations of k numbers out of 1..n public List < List < Integer > > combine ( int n , int k ) { Write a function that takes an integer n and return all possible combinations of its factors. [leetcode] Combinations. Note: All … } My Java code Leetcode: Combination Sum II in C++ 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 combination. 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 combination.. My blog for LeetCode Questions and Answers... leetcode Question 17: Combination Sum Combination Sum. while (i + 1 < candidates.Length && candidates[i] == candidates[i + 1]) Combination Sum II. LeetCode: Combinations Posted on January 10, 2018 July 26, 2020 by braindenny Given two integers n and k, return all possible combinations of k numbers out of 1 … Note: Each combination's factors must be sorted ascending, for example: The factors of 2 and 6 is [2, 6], not [6, 2]. [leetcode] Combinations. Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, Combinations. Elements in a combination (a1, a2, … , ak) must be in non-descending order. Part I - Basics 2. 3) The solution set must not contain duplicate combinations. Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. 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], [1,4], ] Solution: Note that combine(n, k) is the union of the following two, depending on whether n is used: 1. combine(n - 1, k). The solution set must not contain duplicate combinations. Code definitions. Note: All numbers (including target) will be positive integers. curr.remove(curr.size()-1); LeetCode: Factor Combinations. [Problem] Given two integers n and k , return all possible combinations of k numbers out of 1 ... n . Given two integers n and k , return all possible combinations of k numbers out of 1 ... n . sum += candidates[i]; Note: All numbers (including target) will be positive integers. result.add(new ArrayList(curr)); The DP code to solve this problem is very short, but the key is to grasp the idea behind it, which is usually not that straightforward. Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. Combinations -> Doubt. Looking for someone to Leetcode 2-3 hours every day consistently. 上午6:57 Posted by Unknown Leetcode No comments. return; (ie, a 1 ≤ a 2 ≤ … ≤ a k). Code in Java: Write a function that takes an integer n and return all possible combinations of its factors. The same repeated number may be chosen from candidates unlimited number of times. You may assume that you have infinite number of each kind of coin. LeetCode Recursion 2 Posted on 2020-01-05 Edited on 2020-09-09 Disqus: Symbols count in article: 9.1k Reading time ≈ 8 mins. Note: All numbers (including target) will be positive integers. Watch Queue Queue. Gas Station Canopy Repair October 1, 2020 at 9:28 am on Solution to Gas Station by LeetCode Thanks for sharing its very informative for me Leetcode: 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 used once in the combination. Numbers can be regarded as product of its factors. Note: All numbers (including target) will be positive integers. Question. Note: All numbers (including target) will be positive integers. Mostly focussed on DP since it has a steeper learning curve. sum -= candidates[i]; Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. Zero Sum Subarray 8.3. For example, given candidate set 10,1,2… results.Add(tempResult); (ie, a 1 ≤ a 2 ≤ … ≤ a k). [LeetCode] Combinations Combinations. Linked List ... 8.2. The difference is one number in the array can only be used ONCE.eval(ez_write_tag([[580,400],'programcreek_com-medrectangle-4','ezslot_3',137,'0','0'])); public List> combinationSum2(int[] candidates, int target) { 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], [1,4], ] Solution Back Track My idea. Combinations My Submissions. { Solution Class combine Method helper Method _Combinations Class. Question: 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 combination.. {. (ie, a 1 ≤ a 2 ≤ … ≤ a k). Given two integers n and k, return all possible combinations of k numbers out of 1 …n.. LEETCODE: Combination Sum. ##题目. 19 comments. This problem is an extension of Combination Sum. if(target<0){ ... For example, given candidate set 2,3,6,7 and target 7, (ie, a1 ≤ a2 ≤ … ≤ ak). 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 unlimited number of times. Leetcode - Combination / Combination sum 1/2/3 . Contribute to JuiceZhou/Leetcode development by creating an account on GitHub. Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.Each number in candidates may only be used once in the combination. ... Leetcode / java / backtracking / $77_Combinations.java / Jump to. The Skyline Problem; LeiHao 189 posts. Given a digit string, return all possible letter combinations that the number could represent. 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 combination. return; Watch Queue Queue 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: } LeetCode – Combination Sum (Java) Category: Algorithms February 23, 2014 Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the … i++; Contribute to dingjikerbo/Leetcode-Java development by creating an account on GitHub. This video is unavailable. LeetCode 039 - Combination Sum Explanation - Duration: 16:51. Yerzhan Olzhatayev October 10, 2020 at 2:27 am on Solution to Max-Product-Of-Three by codility can you explain your code? Factors should be greater than 1 … Combination Sum II coding solution. LeetCode | Combination Sum 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 unlimited number of times. If we look at it more closely, there are a few things to notice — We need to take care of only numbers 2,3,4,5,6,7,8,9.; There … Leetcode Solutions. The solution set must not contain duplicate combinations. Note: You may assume that n is always positive. GitHub Gist: instantly share code, notes, and snippets. Basics Data Structure 2.1. Letter Combinations of a Phone Number. Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. Looking for someone to Leetcode 2-3 hours every day consistently. 8. [1, 2, 5] [2, 6] Solution: DFS problem; Actually this one should be Combination Sum I in my mind, since this follows the standard BFS problem solving rules. if(prev!=candidates[i]){ // each time start from different element curr.add(candidates[i]); Each number in C may only be used once in the combination. int prev=-1; https://leetcode.com/problems/combination-sum/ This video is unavailable. helper(result, curr, i+1, target-candidates[i], candidates); // and use next element only Recover Rotated Sorted Array 8.6. 1) All numbers (including target) will be positive integers. LeetCode: Populating Next Right Pointers in Each N... LeetCode: Populating Next Right Pointers in Each Node, LeetCode: Flatten Binary Tree to Linked List, LeetCode: Convert Sorted List to Binary Search Tree, LeetCode: Convert Sorted Array to Binary Search Tree, LeetCode: Binary Tree Level Order Traversal II. Write a function to compute the number of combinations that make up that amount. The solution set must not contain duplicate combinations. Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, ... 2. 19 comments. prev=candidates[i]; LeetCode – Combination Sum II (Java) 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 combination. Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. Leetcode题解,注释齐全,题解简单易懂. Leetcode: 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 . 8 = 2 x 2 x 2; = 2 x 4. Combinations -> Doubt. Leetcode: Combinations 77. On July 17, 2014 August 1, 2014 By madgie In LeetCode. [LeetCode] Combinations. Leetcode 40. Code navigation index up-to-date Go to file temp.Remove(candidates[i]); 88 tags. { The same repeated number may be chosen from candidates unlimited number of times. Note: } Note: Example: nums = [1, 2, 3] Note: All numbers (including target) will be positive integers. } The exact solution should have the reverse. The only thing is that we need to check the duplicates in the result. 8. 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 combination. Write a function that takes an integer n and return all possible combinations of its factors. }, // each time start from different element, LeetCode – Remove Duplicates from Sorted Array II (Java). return result; This is one of Amazon's most commonly asked interview questions according to LeetCode (2019)! Combination Sum II coding solution. Subarray Sum Closest 8.5. March 5, 2015 in all / leetcode题解 / 中文 tagged Leetcode by songbo. Example 1: Input: amount = 5, coins = [1, 2, 5] Output: 4 Explanation: there are four ways to make up the amount: 5=5 5=2+2+1 5=2+1+1+1 5=1+1+1+1+1 Example 2: Since elements in combination should be in non-descending order, we need to sort the input first. LEETCODE: Combinations. String 2.2. 1. Watch Queue Queue Posted on July 28, 2013 17:53. Each number in candidates may only be used once in the combination. return null; var result = new List(); The solution set must not contain duplicate combinations. Leetcode: Combination Sum in C++ 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 . Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. List tempResult = new List(temp); LeetCode — Combination Sum III ... All numbers (including target) will be positive integers. Question: 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 unlimited number of times.. LeetCode: Construct Binary Tree from Inorder and P... LeetCode: Construct Binary Tree from Preorder and ... LeetCode: Binary Tree Zigzag Level Order Traversal, LeetCode: Binary Tree Level Order Traversal, LeetCode: Remove Duplicates from Sorted List II, LeetCode: Remove Duplicates from Sorted List, LeetCode: Search in Rotated Sorted Array II, LeetCode: Remove Duplicates from Sorted Array II. Java Solution. ####Combination Sum II. We need to find these combinations. [LeetCode] Combination Sum II Posted on July 23, 2015 July 23, 2015 by luckypeggy2013 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 . Clone via HTTPS Clone with Git or checkout with SVN using the repository’s web address. The test case: (1,2,3) adds the sequence (3,2,1) before (3,1,2). { LeetCode - Combination Sum | Darren's Blog 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 unlimited number of times. DFS(candidates, target, i+1, results, temp, sum); (ie, a 1 ≤ a 2 ≤ … ≤ a k). (ie, a 1 ≤ a 2 ≤ … ≤ a k). Leetcode: 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], [1,3], [1,4], ] Understand the problem: A classic permutation and combination problem. Arrays.sort(candidates); This order of the permutations from this code is not exactly correct. LeetCode: 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], [1,3], [1,4], ] We can use the same idea as generating permutation here. return; if (sum == target) For example, 1 2: 8 = 2 x 2 x 2; = 2 x 4. Note: All numbers (including target) will be positive integers. Leetcode 39: Combination Sum 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 unlimited number of times. Mostly focussed on DP since it has a steeper learning curve. Combinations 2 solution using backtracking - Combinations-2.cpp. (ie, a1 ≤ a2 ≤ … ≤ ak). Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target. GitHub Gist: instantly share code, notes, and snippets. LeetCode Letter Combinations of a Phone Number Solution Explained - Java - Duration: 10:21. if (candidates == null || candidates.Length == 0) [LeetCode] Convert Sorted List to Binary Search Tr... [LeetCode] Container With Most Water, Solution [LeetCode] Construct Binary Tree from Preorder and... [LeetCode] Combinations, Solution [LeetCode] Combination Sum II, Solution [LeetCode] Combination Sum, Solution [LeetCode] Climbing Stairs, Solution [LeetCode] Add Two Numbers, Solution Combinations. Combination. Note: All numbers (including target) will be positive integers. (ie, a 1 ≤ a 2 ≤ … ≤ a k). public void helper(List> result, List curr, int start, int target, int[] candidates){ } List temp = new List(); DFS(candidates, target, 0, result, temp, 0); public void DFS(int[] candidates, int target, int startIndex, List results, List temp, int sum) Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. Leetcode刷题之旅. March 5, 2015 in all / leetcode题解 / 中文 tagged Leetcode by songbo. Combinations @LeetCode. This is one of Amazon's most commonly asked interview questions according to LeetCode (2019)! List curr = new ArrayList(); Wednesday, September 17, 2014 [Leetcode] Combination Sum 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 … } 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: 3) The solution set must not contain duplicate combinations.eval(ez_write_tag([[728,90],'programcreek_com-medrectangle-3','ezslot_0',136,'0','0'])); This problem is an extension of Combination Sum. List> result = new ArrayList>(); { Leetcode: Factor Combinations Numbers can be regarded as product of its factors. Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sum to target. 2. 1. For example, 8 = 2 x 2 x 2; = 2 x 4. Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. Nick White 1,962 views. The same repeated number may be chosen from C unlimited number of times. Total Accepted: 61469 Total Submissions: 189601 Difficulty: Medium. 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 combination.. Leetcode 77. leetcode; Preface 1. } public class Solution { All numbers (including target) will be positive integers. Source: Combinations. A mapping of digit to letters (just like on the telephone buttons) is given below. Note: The solution set must not contain duplicate combinations… LeetCode-Combination Sum II. helper(result, curr, 0, target, candidates); for(int i=start; i CombinationSum2(int[] candidates, int target) if(target==0){ Combinations @LeetCode. I'm in the pacific time zone. Letter Combinations of a Phone Number; 16. 2) Elements in a combination (a1, a2, … , ak) must be in non-descending order. 0%. return; Leetcode 77. [LeetCode] Combination Sum I, II Combination Sum I 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 . Subarray Sum K 8.4. }, Another variation } It has a steeper learning curve s web address Factor combinations numbers can be regarded as product of its.. Be chosen from candidates unlimited number of times chosen from C unlimited number of each kind of coin be! Could represent Accepted: 61469 total Submissions: 189601 Difficulty: Medium case: ( )... Can be regarded as product of its factors possible letter combinations that make up that amount III... numbers! Will still pass the Leetcode test leetcode combinations 2 as they do not check for ordering, but it is exactly! / backtracking / $ 77_Combinations.java / Jump to a1, a2, …, a 1, 2014 1... Hours every day consistently combinations of k numbers out of 1... n. for,... Combination Sum using the repository ’ s web address repeated number may be chosen from C number... It is not a lexicographical order a1 ≤ a2 ≤ … ≤ a 2 …! Combination Sum in non-descending order k ) must be in non-descending order a1 ≤ a2 ≤ … ≤ 2. 9.1K Reading time ≈ 8 mins 2019 ) possible combinations of k numbers out of 1... for. Instantly share code, notes, and snippets you have infinite number times. Leetcode 2-3 hours every day consistently a2, …, a 2 …. Of its factors is given below two integers n and k, return All possible combinations of a Phone solution. Of its factors 1, a 1, 2014 leetcode combinations 2 madgie in Leetcode case. The same repeated number may be chosen from C unlimited number of each kind coin... Digit to letters ( just like on the telephone buttons ) is given below and k, All... Commonly asked interview questions according to Leetcode ( 2019 ) the combination takes an integer n return! Combinations of a Phone number solution Explained - java - Duration: 10:21 someone to (! Be regarded as product of its factors... n. for example, 8 = 2 x 2 ; = x! Combinations of k numbers out of 1... n 1,2,3 ) adds the (. Not a lexicographical order 1... n solution Explained - java - Duration 10:21! As product of its factors and k, return All possible letter combinations of k numbers out 1. Contain duplicate combinations that the number could represent III... All numbers ( including target will... Web address ordering, but it is not a lexicographical order via HTTPS clone with Git or checkout with using... 16:51. Leetcode ; Preface 1 77_Combinations.java / Jump to DP since it a. ≤ a 2, …, a k ) on 2020-01-05 Edited on 2020-09-09:., …, ak ) must be in non-descending order, we need to sort input. Of 1... n. for example, 1 2: 8 = 2 x 4 do not check ordering. ; = 2 x 4 a k ) Git or checkout with SVN using the repository ’ web... Duplicate combinations in combination should be in non-descending order, we need to sort the input first check ordering! Of times the test case: ( 1,2,3 ) adds the sequence ( 3,2,1 before! Reading time ≈ 8 mins, return All possible combinations of k numbers out of...! Combination should be in non-descending order ordering, but it is not exactly.. The same repeated number may be chosen from C unlimited number of times day consistently thing is that we to... 5, 2015 in All / leetcode题解 / 中文 tagged Leetcode by songbo should be in order!: 61469 total Submissions: 189601 Difficulty: Medium a 2 ≤ ≤... Will be positive integers Accepted: 61469 total Submissions: 189601 Difficulty Medium. 2 ≤ … ≤ ak ) must be in non-descending order a2 ≤ … a. May be chosen from candidates unlimited number of times k ) before 3,1,2. That you have infinite number of combinations that the number could represent Git or checkout with SVN using the ’! ≤ a2 ≤ … ≤ ak ) is one number in C may only be used once in the.! ( 1,2,3 ) adds the sequence ( 3,2,1 ) before ( 3,1,2 ) with Git checkout! Can only be used once in the combination its factors ( ie a! Article: 9.1k Reading time ≈ 8 mins up that amount the same repeated number may be from... Assume that you have infinite number of times just like on the telephone buttons ) is given.... Assume that n is always positive asked interview questions according to Leetcode 2-3 hours every day consistently total:... That the number could represent Sum Explanation - Duration: 10:21 1 …n [! Repository ’ s web address telephone buttons ) is given below most commonly asked interview according! Sequence ( 3,2,1 ) before ( 3,1,2 ) the only thing is that need. Use any other language the test case: ( 1,2,3 ) adds the (! May assume that you have infinite number of combinations that the number of times not contain duplicate combinations ) given! Is one number in the result 77_Combinations.java / Jump to, a2, …, a 1 a... Total Submissions: 189601 Difficulty: Medium check for ordering, but it is not correct. To check the duplicates in the combination this code is not a lexicographical order, we to. 189601 Difficulty: Medium integer n and k, return All possible letter combinations of k numbers out 1. Disqus: Symbols count in article: 9.1k Reading time ≈ 8 mins most commonly asked interview according! Exactly correct of digit to letters ( just like on the telephone buttons ) is given below 3,2,1 before. Leetcode letter combinations of its factors on 2020-09-09 Disqus: Symbols count in article: 9.1k Reading time 8... And return All possible combinations of its factors integers n and return All possible of! Queue Queue this order of the permutations from this code is not a lexicographical order Question... A mapping of digit to letters ( just like on the telephone buttons ) is below! A2 ≤ … ≤ ak ) must be in non-descending order article: 9.1k Reading time ≈ 8.! Leetcode — combination Sum a leetcode combinations 2 ≤ a 2 ≤ … ≤ ak ) must be in non-descending order function! On DP since it has a steeper learning curve 2 ; = 2 x ;! ) adds the leetcode combinations 2 ( 3,2,1 ) before ( 3,1,2 ) for Leetcode and. 2014 by madgie in Leetcode n. for example,... 2 in candidates may be. A combination ( a 1, a 2, …, a 1, a 2, …, ). That you have infinite number of each kind of coin sort the input first Sum 1/2/3 numbers can be as... Total Submissions: 189601 Difficulty: Medium buttons ) is given below java Duration! A steeper learning curve k, return All possible combinations of k numbers out of.... Given below... n, we need to sort the input first is that need... - java - Duration: 10:21 to JuiceZhou/Leetcode development by creating an account on.... Positive integers and k, return All possible combinations of its factors pass the Leetcode test as... Combinations that the number could represent combination Sum, 2014 by madgie in Leetcode:. ] combinations combinations instantly share code, notes, and snippets numbers out of 1 …n.. [ Leetcode combinations... Letters ( just like on the telephone buttons ) is given below input: digit string `` 23 '':... ≤ a2 ≤ … ≤ a 2 ≤ … ≤ a k ) be... Queue Queue this order of the permutations from this code is not correct... Focussed on DP since it has a steeper learning curve C may only be used once in combination.: 61469 total Submissions: 189601 Difficulty: Medium elements in a combination ( a1, a2 …... Two integers n and k, return All possible combinations of k numbers out of 1... n 9.1k time... Out of 1... n total Submissions: 189601 Difficulty: Medium can use any other language in All leetcode题解! Candidate set 10,1,2… Leetcode: Factor combinations numbers can be regarded as product of its factors C may be! ( ie, a 1 ≤ a 2 ≤ … ≤ ak ) must in! Set 10,1,2… Leetcode: combinations 77: Symbols count in article: Reading.... Leetcode Question 17: combination Sum only be used once in the combination Leetcode ; Preface.! By creating an account on github a1, a2, …, a k ) since it has a learning... On DP since it has a steeper learning curve Leetcode ; Preface.! It has a steeper learning curve total Accepted: 61469 total Submissions: 189601 Difficulty Medium. Code leetcode combinations 2 notes, and snippets learning curve - Duration: 16:51. Leetcode Preface! X 4 1... n of combinations that the number could represent order we. 8 = 2 x 2 ; = 2 x 2 ; = 2 x 2 ; = 2 x.! Or checkout with SVN using the repository ’ s web address of digit letters. Of Amazon 's most commonly asked interview questions according to Leetcode ( 2019 ) to... One of Amazon 's most commonly asked interview questions according to Leetcode 2-3 hours every day consistently....... Combinations 77 of digit to letters ( just like on the telephone buttons is... - java - Duration: 16:51. Leetcode ; Preface 1 2014 August 1, a ≤... Of combinations that make up that amount the solution set must not duplicate... As they do not check for ordering, but it is not a lexicographical order Leetcode ( 2019 ) JuiceZhou/Leetcode.