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.
Each number in candidates may only be used once in the combination.
Note: The solution set must not contain duplicate combinations.
[LeetCode] 0040. Combination Sum II 阅读更多 ”
Leetcode, 技术文章
Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order.
The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the chosen numbers is different.
The test cases are generated such that the number of unique combinations that sum up to target is less than 150 combinations for the given input.
[LeetCode] 0039. Combination Sum 阅读更多 ”
Leetcode, 技术文章
Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
For example, “ace” is a subsequence of “abcde”.
A common subsequence of two strings is a subsequence that is common to both strings.
[LeetCode] 1143. Longest Common Subsequence 阅读更多 ”
Leetcode, 技术文章
Given an integer array nums, return the length of the longest strictly increasing subsequence
[LeetCode] 0300. Longest Increasing Subsequence 阅读更多 ”
Leetcode, 技术文章
You are climbing a staircase. It takes n steps to reach the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
[LeetCode] 0070. climbing stairs 阅读更多 ”
Leetcode, 技术文章
Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.
[LeetCode] 0268. Missing Number 阅读更多 ”
Leetcode, 技术文章
Reverse bits of a given 32 bits unsigned integer.
[LeetCode] 0190. Reverse Bits 阅读更多 ”
Leetcode, 技术文章
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
[LeetCode] 0338. Counting Bits 阅读更多 ”
Leetcode, 技术文章
Given two integers a and b, return the sum of the two integers without using the operators + and -.
[LeetCode] 0371. sum of two integers 阅读更多 ”
Leetcode, 技术文章
Given an integer array nums, find a subarray that has the largest product, and return the product.
The test cases are generated so that the answer will fit in a 32-bitinteger.
[LeetCode] 0152. Maximum Product Subarray 阅读更多 ”
Leetcode, 技术文章
简体中文 
繁體中文 
English 
한국어 
日本語 
Español