杨领well的专栏

LeetCode: Weekly Contest 100题目描述1. LeetCode: 896. Monotonic Array 题解2. LeetCode: 897. Increasing Order Search Tree 题解3. LeetCode: 898. Bitwise ORs of Subarrays 题解4. LeetCode: 899. Orderl...

LeetCode: 896. Monotonic Array题目描述An array is monotonic if it is either monotone increasing or monotone decreasing. An array A is monotone increasing if for all i <= j, A[i] <= A[j]. An ar...

LeetCode：897. Increasing Order Search Tree解题思路Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and o...

LeetCode: 898. Bitwise ORs of Subarrays题目描述We have an array A of non-negative integers.For every (contiguous) subarray B = [A[i], A[i+1], ..., A[j]] (with i <= j), we take the bitwise OR of a...

LeetCode: 899. Orderly Queue题目描述A string S of lowercase letters is given. Then, we may make any number of moves. In each move, we choose one of the first K letters (starting from the left), remo...