题目描述：
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
LeetCode OJ is a platform for preparing technical coding interviews.
[LeetCode]Range Sum Query - Immutable
[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 ...
[LeetCode]Bulls and Cows
作者是
发布于
在
LeetCode.
题目描述：
You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret number and ask your friend to guess it, each time your friend guesses a number, you give a hint, the hint tells ...
[LeetCode]Binary Tree Maximum Path Sum
作者是
发布于
在
LeetCode.
题目描述：
Given a binary tree, find the maximum path sum.
For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The path does not ...