上一页 1 ··· 25 26 27 28 29 30 31 32 33 ··· 76 下一页
摘要: Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1 2 Output: false Example 2: Input: 1 2 2 1 Output: true Follow up: Cou 阅读全文
posted @ 2018-11-30 15:15 bernieloveslife 阅读(99) 评论(0) 推荐(0)
摘要: Given a non negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pascal's trian 阅读全文
posted @ 2018-11-30 15:15 bernieloveslife 阅读(175) 评论(0) 推荐(0)
摘要: Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its structure. Example 1: Input: [1,3,null,null,2 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(126) 评论(0) 推荐(0)
摘要: Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(80) 评论(0) 推荐(0)
摘要: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height balanced binary tree is d 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(118) 评论(0) 推荐(0)
摘要: Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(89) 评论(0) 推荐(0)
摘要: You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 ston 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(79) 评论(0) 推荐(0)
摘要: Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence. For example, in the given t 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(119) 评论(0) 推荐(0)
摘要: You are given a data structure of employee information, which includes the employee's unique id, his importance value and his direct subordinates' id. 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(148) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2018-11-30 15:14 bernieloveslife 阅读(128) 评论(0) 推荐(0)
上一页 1 ··· 25 26 27 28 29 30 31 32 33 ··· 76 下一页