摘要：
Description: Given an array of non-negative integers nums, you are initially positioned at the first index of the array. Each element in the array rep 阅读全文
摘要：
Description: Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is a sequence that can be de 阅读全文
摘要：
Description:You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails t 阅读全文
摘要：
Description: Given the root of a complete binary tree, return the number of the nodes in the tree. According to Wikipedia, every level, except possibl 阅读全文
摘要：
Description: Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated 阅读全文
摘要：
Description: Given an array of positive integers nums and a positive integer target, return the minimal length of a contiguous subarray [numsl, numsl+ 阅读全文
摘要：
Description: Given the root of a binary search tree, and an integer k, return the kth (1-indexed) smallest element in the tree. Link: 230. Kth Smalles 阅读全文
摘要：
Description: A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return it 阅读全文
摘要：
Description: Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] mi 阅读全文
摘要：
Description: Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] mi 阅读全文