上一页 1 ··· 51 52 53 54 55 56 57 58 59 ··· 64 下一页
摘要: Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. 阅读全文
posted @ 2020-03-20 04:33 CNoodle 阅读(194) 评论(0) 推荐(0)
摘要: Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. Exampl 阅读全文
posted @ 2020-03-20 03:04 CNoodle 阅读(170) 评论(0) 推荐(0)
摘要: Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The produc 阅读全文
posted @ 2020-03-20 01:26 CNoodle 阅读(333) 评论(0) 推荐(0)
摘要: Convert a non-negative integer num to its English words representation. Example 1: Input: num = 123 Output: "One Hundred Twenty Three" Example 2: Inpu 阅读全文
posted @ 2020-03-19 09:06 CNoodle 阅读(165) 评论(0) 推荐(0)
摘要: Given a string, determine if a permutation of the string could form a palindrome. Example 1: Input: "code" Output: false Example 2: Input: "aab" Outpu 阅读全文
posted @ 2020-03-19 06:08 CNoodle 阅读(143) 评论(0) 推荐(0)
摘要: Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. L 阅读全文
posted @ 2020-03-19 05:34 CNoodle 阅读(202) 评论(0) 推荐(0)
摘要: A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear i 阅读全文
posted @ 2020-03-18 14:34 CNoodle 阅读(449) 评论(0) 推荐(0)
摘要: Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2020-03-18 10:29 CNoodle 阅读(461) 评论(0) 推荐(0)
摘要: Given the root of a binary tree, return the length of the longest path, where each node in the path has the same value. This path may or may not pass 阅读全文
posted @ 2020-03-18 06:19 CNoodle 阅读(220) 评论(0) 推荐(0)
摘要: Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path betwee 阅读全文
posted @ 2020-03-18 01:58 CNoodle 阅读(343) 评论(0) 推荐(0)
摘要: Given the root of a binary tree, flatten the tree into a "linked list": The "linked list" should use the same TreeNode class where the right child poi 阅读全文
posted @ 2020-03-17 02:51 CNoodle 阅读(558) 评论(0) 推荐(0)
摘要: Given a positive integer n, find the smallest integer which has exactly the same digits existing in the integer n and is greater in value than n. If n 阅读全文
posted @ 2020-03-16 08:54 CNoodle 阅读(200) 评论(0) 推荐(0)
摘要: Given a circular integer array nums (i.e., the next element of nums[nums.length - 1] is nums[0]), return the next greater number for every element in  阅读全文
posted @ 2020-03-16 02:22 CNoodle 阅读(198) 评论(0) 推荐(0)
摘要: The next greater element of some element x in an array is the first greater element that is to the right of x in the same array. You are given two dis 阅读全文
posted @ 2020-03-15 14:02 CNoodle 阅读(198) 评论(0) 推荐(0)
摘要: Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have t 阅读全文
posted @ 2020-03-15 07:40 CNoodle 阅读(258) 评论(0) 推荐(0)
摘要: You are given the head of a linked list with n nodes. For each node in the list, find the value of the next greater node. That is, for each node, find 阅读全文
posted @ 2020-03-14 09:13 CNoodle 阅读(250) 评论(0) 推荐(0)
摘要: The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font 阅读全文
posted @ 2020-03-14 03:32 CNoodle 阅读(457) 评论(0) 推荐(0)
摘要: In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the i-th domino. (A domino is a tile with two numbers from 1 to 6 - one on 阅读全文
posted @ 2020-03-14 02:44 CNoodle 阅读(151) 评论(0) 推荐(0)
摘要: Given an array of strings words and an integer k, return the k most frequent strings. Return the answer sorted by the frequency from highest to lowest 阅读全文
posted @ 2020-03-13 14:50 CNoodle 阅读(271) 评论(0) 推荐(0)
摘要: We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between two points on a plane is the Euclid 阅读全文
posted @ 2020-03-13 11:51 CNoodle 阅读(294) 评论(0) 推荐(0)
上一页 1 ··· 51 52 53 54 55 56 57 58 59 ··· 64 下一页