Chole1122的专栏

Binary search is a famous question in algorithm. For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target nu

Given a rotated sorted array, recover it to sorted array in-place. 样例 [4, 5, 1, 2, 3] -> [1, 2, 3, 4, 5] 挑战 Expand  In-place, O(1) extra space and O(n) time.

public class Solution { /** * @param nums: The integer array * @return: The length of LIS (longest increasing subsequence) */ /** * state: lis[i] 表示前i个数字中，以第i 个数结尾的LI