题目描述：
Additive number is a positive integer whose digits can form additive sequence.
A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of ...
作者归档：在线疯狂
[LeetCode]Additive Number
[LeetCode]Range Sum Query 2D - Immutable
作者是
发布于
在
LeetCode.
题目描述：
Given a 2D matrix, find the sum of the elements inside the rectangle defined by (row1, col1), (row2, col2).
The above rectangle (with the red border) is defined by (row1, col1) = (2, 1) and (row2, col2) = (4 ...
[LeetCode]Range Sum Query - Immutable
作者是
发布于
在
LeetCode.
题目描述：
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
Example:
Given nums = [-2, 0, 3, -5, 2, -1] sumRange(0, 2) -> 1 sumRange(2, 5) -> -1 ...
[LeetCode]Remove Invalid Parentheses
作者是
发布于
在
LeetCode.
题目描述：
Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.
Note: The input string may contain letters other than the parentheses ( and ).
Examples:
"()())()" -> ["()()()", "(())()" ...
[LeetCode]Longest Increasing Subsequence
作者是
发布于
在
LeetCode.
题目描述：
Given an unsorted array of integers, find the length of longest increasing subsequence.
For example,
Given [10, 9, 2, 5, 3, 7, 101, 18],
The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4. Note ...