上一页 1 ··· 8 9 10 11 12 13 14 15 下一页
摘要: Note:You may assume that duplicates do not exist in the tree.   Subscribe to see which companies asked this question   阅读全文
posted @ 2016-03-14 05:41 新一代的天皇巨星 阅读(158) 评论(0) 推荐(0)
摘要: Note:You may assume that duplicates do not exist in the tree.   Subscribe to see which companies asked this question       阅读全文
posted @ 2016-03-14 05:02 新一代的天皇巨星 阅读(213) 评论(0) 推荐(0)
摘要: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文
posted @ 2016-03-12 14:29 新一代的天皇巨星 阅读(173) 评论(0) 推荐(0)
摘要: Problem: You have a n x n grid: 2 4 3 1 3 2 1 4 4 2 3 1 1 2 3 4 You have to start at the bottom row (highlighted red) and make your way to the top row 阅读全文
posted @ 2016-03-12 09:12 新一代的天皇巨星 阅读(306) 评论(0) 推荐(0)
摘要: Placeholder 阅读全文
posted @ 2016-03-12 00:33 新一代的天皇巨星 阅读(150) 评论(0) 推荐(0)
摘要: 15. 3Sum Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives th 阅读全文
posted @ 2016-03-11 00:06 新一代的天皇巨星 阅读(182) 评论(0) 推荐(0)
摘要: Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文
posted @ 2016-03-10 13:56 新一代的天皇巨星 阅读(196) 评论(0) 推荐(0)
摘要: 332. Reconstruct Itinerary Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerar 阅读全文
posted @ 2016-03-07 05:42 新一代的天皇巨星 阅读(353) 评论(0) 推荐(0)
摘要: 380. Insert Delete GetRandom O(1) Design a data structure that supports all following operations in average O(1) time. insert(val): Inserts an item va 阅读全文
posted @ 2016-03-07 05:11 新一代的天皇巨星 阅读(430) 评论(0) 推荐(0)
摘要: 207. Course Schedule There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to tak 阅读全文
posted @ 2016-03-06 09:40 新一代的天皇巨星 阅读(212) 评论(0) 推荐(0)
上一页 1 ··· 8 9 10 11 12 13 14 15 下一页