上一页 1 ··· 39 40 41 42 43 44 45 46 47 ··· 68 下一页
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-25 17:27 seyjs 阅读(849) 评论(0) 推荐(0) 编辑
摘要: 题目如下: Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer 阅读全文
posted @ 2019-02-24 22:50 seyjs 阅读(258) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-24 22:38 seyjs 阅读(396) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-24 22:32 seyjs 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-24 14:16 seyjs 阅读(419) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-23 22:43 seyjs 阅读(217) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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. 阅读全文
posted @ 2019-02-21 15:18 seyjs 阅读(468) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-21 10:11 seyjs 阅读(730) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-21 10:06 seyjs 阅读(690) 评论(0) 推荐(0) 编辑
摘要: 题目如下: 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 阅读全文
posted @ 2019-02-19 10:26 seyjs 阅读(98) 评论(0) 推荐(0) 编辑
上一页 1 ··· 39 40 41 42 43 44 45 46 47 ··· 68 下一页