02 2019 档案
摘要：题目如下： Given an array A of non-negative integers, the array is squareful if for every pair of adjacent elements, their sum is a perfect square. Return
阅读全文
摘要：题目如下： We are stacking blocks to form a pyramid. Each block has a color which is a one letter string, like `'Z'`. For every block of color `C` we place
阅读全文
摘要：题目如下： Given a binary tree, return the vertical order traversal of its nodes values. For each node at position (X, Y), its left and right children resp
阅读全文
摘要：题目如下： On an 8 x 8 chessboard, there is one white rook. There also may be empty squares, white bishops, and black pawns. These are given as characters
阅读全文
摘要：题目如下： Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer
阅读全文
摘要：题目如下： We are given the root node of a maximum tree: a tree where every node has a value greater than any other value in its subtree. Just as in the pr
阅读全文
摘要：题目如下： Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: Construct the maximum tree by the given a
阅读全文
摘要：题目如下： In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is secretly the town judge. If the town judge exis
阅读全文
摘要：题目如下： 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
阅读全文
摘要：题目如下： Given a string S, count the number of distinct, non-empty subsequences of S . Since the result may be large, return the answer modulo 10^9 + 7.
阅读全文
摘要：题目如下： In a given grid, each cell can have one of three values: the value 0 representing an empty cell; the value 1 representing a fresh orange; the va
阅读全文
摘要：题目如下： In a binary tree, the root node is at depth 0, and children of each depth k node are at depth k+1. Two nodes of a binary tree are cousins if the
阅读全文
摘要：题目如下： You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not
阅读全文
摘要：题目如下： The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two precedi
阅读全文
摘要：题目如下： Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are Ncoins total. In one move, we may choose t
阅读全文
摘要：题目如下： On a broken calculator that has a number showing on its display, we can perform two operations: Double: Multiply the number on the display by 2,
阅读全文
摘要：题目如下： For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array for
阅读全文
摘要：题目如下： Given an array equations of strings that represent relationships between variables, each string equations[i] has length 4 and takes one of two d
阅读全文
摘要：题目如下： Given an array of integers A, find the number of triples of indices (i, j, k) such that: 0 <= i < A.length 0 <= j < A.length 0 <= k < A.length A
阅读全文
摘要：题目如下： In a country popular for train travel, you have planned some train travelling one year in advance. The days of the year that you will travel is
阅读全文
摘要：题目如下： Given the root of a binary tree, each node has a value from 0 to 25representing the letters 'a' to 'z': a value of 0 represents 'a', a value of
阅读全文
摘要：题目如下： Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. Return the intersection of these two inter
阅读全文
摘要：题目如下： We have an array A of integers, and an array queries of queries. For the i-th query val = queries[i][0], index = queries[i][1], we add val to A[
阅读全文
摘要：题目如下： On a 2-dimensional grid, there are 4 types of squares: 1 represents the starting square. There is exactly one starting square. 2 represents the
阅读全文
浙公网安备 33010602011771号