无分类 leetcode讲解–942. DI String Match Given a string S that only contains “I” (increase) or “D” (decrease), let N = S.length.
无分类 leetcode讲解–814. Binary Tree Pruning We are given the head node root of a binary tree, where additionally every node’s value is either a 0 or a 1.
无分类 leetcode讲解–890. Find and Replace Pattern You have a list of words and a pattern, and you want to know which words in words matches the pattern.
无分类 leetcode讲解–832. Flipping an Image Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.
无分类 leetcode讲解–944. Delete Columns to Make Sorted We are given an array A of N lowercase letter strings, all of the same length.
无分类 leetcode讲解–701. Insert into a Binary Search Tree Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that…
无分类 leetcode讲解–654. Maximum Binary Tree Given an integer array with no duplicates. A maximum tree building on this array is defined as follow:
无分类 leetcode讲解–905. Sort Array By Parity Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.
无分类 leetcode讲解–950. Reveal Cards In Increasing Order In a deck of cards, every card has a unique integer. You can order the deck in any order you want.
