题目描述：
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs). Given ...
类别归档：LeetCode
LeetCode OJ is a platform for preparing technical coding interviews.
[LeetCode]Minimum Height Trees
[LeetCode]Best Time to Buy and Sell Stock with Cooldown
作者是
发布于
在
LeetCode.
题目描述：
Say you have an array for which the i-th 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, buy ...
[LeetCode]Range Sum Query - Mutable
作者是
发布于
在
LeetCode.
题目描述：
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
The update(i, val) function modifies nums by updating the element at index i to val.
Example:
Given nums ...
[LeetCode]Additive Number
作者是
发布于
在
LeetCode.
题目描述：
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]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 ...