上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 37 下一页
摘要: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element. 阅读全文
posted @ 2017-11-13 06:15 Review->Improve 阅读(142) 评论(0) 推荐(0) 编辑
摘要: Find the last position of a target number in a sorted array. Return -1 if target does not exist. Find the last position of a target number in a sorted 阅读全文
posted @ 2017-11-13 03:19 Review->Improve 阅读(242) 评论(0) 推荐(0) 编辑
摘要: Given some points and a point origin in two dimensional space, find k points out of the some points which are nearest to origin.Return these points so 阅读全文
posted @ 2017-11-13 03:15 Review->Improve 阅读(337) 评论(0) 推荐(0) 编辑
摘要: Given a target number, a non-negative integer k and an integer array A sorted in ascending order, find the k closest numbers to target in A, sorted in 阅读全文
posted @ 2017-11-13 02:54 Review->Improve 阅读(395) 评论(0) 推荐(0) 编辑
摘要: Given a target number and an integer array A sorted in ascending order, find the index i in A such that A[i] is closest to the given target. Return -1 阅读全文
posted @ 2017-11-13 02:29 Review->Improve 阅读(593) 评论(0) 推荐(0) 编辑
摘要: Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. Given a positive integer n 阅读全文
posted @ 2017-11-12 14:27 Review->Improve 阅读(190) 评论(0) 推荐(0) 编辑
摘要: Given a knight in a chessboard n * m (a binary matrix with 0 as empty and 1 as barrier). the knight initial position is (0, 0) and he wants to reach p 阅读全文
posted @ 2017-11-12 13:56 Review->Improve 阅读(882) 评论(0) 推荐(0) 编辑
摘要: Given a knight in a chessboard (a binary matrix with 0 as empty and 1 as barrier) with a sourceposition, find the shortest path to a destination posit 阅读全文
posted @ 2017-11-12 13:32 Review->Improve 阅读(431) 评论(0) 推荐(0) 编辑
摘要: Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or  阅读全文
posted @ 2017-11-12 13:21 Review->Improve 阅读(194) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. Given a binary tree, find the maximum path sum. Th 阅读全文
posted @ 2017-11-12 11:06 Review->Improve 阅读(418) 评论(0) 推荐(0) 编辑
上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 37 下一页