上一页 1 ··· 59 60 61 62 63 64 65 66 67 ··· 98 下一页
摘要: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted i 阅读全文
posted @ 2018-11-03 15:36 Veritas_des_Liberty 阅读(174) 评论(0) 推荐(0) 编辑
摘要: Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Input: [10,9,2,5,3,7,101,18] Output: 4 Explanation: T 阅读全文
posted @ 2018-11-02 22:37 Veritas_des_Liberty 阅读(180) 评论(0) 推荐(0) 编辑
摘要: code C // Forward declaration of isBadVersion API. bool isBadVersion(int version); class Solution { public: int firstBadVersion(int n) { int l = 1; in 阅读全文
posted @ 2018-11-01 18:47 Veritas_des_Liberty 阅读(147) 评论(0) 推荐(0) 编辑
摘要: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文
posted @ 2018-11-01 18:04 Veritas_des_Liberty 阅读(154) 评论(0) 推荐(0) 编辑
摘要: Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't 阅读全文
posted @ 2018-11-01 17:29 Veritas_des_Liberty 阅读(167) 评论(0) 推荐(0) 编辑
摘要: Suppose an array sorted in ascending order 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]). F 阅读全文
posted @ 2018-11-01 16:46 Veritas_des_Liberty 阅读(142) 评论(0) 推荐(0) 编辑
摘要: Suppose an array sorted in ascending order 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]). F 阅读全文
posted @ 2018-11-01 16:15 Veritas_des_Liberty 阅读(150) 评论(0) 推荐(0) 编辑
摘要: Given a blacklist B containing unique integers from [0, N), write a function to return a uniform random integer from [0, N) which is NOT in B. Optimiz 阅读全文
posted @ 2018-10-31 18:32 Veritas_des_Liberty 阅读(307) 评论(0) 推荐(0) 编辑
摘要: Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output 阅读全文
posted @ 2018-10-31 16:55 Veritas_des_Liberty 阅读(247) 评论(0) 推荐(0) 编辑
摘要: Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. 阅读全文
posted @ 2018-10-30 22:39 Veritas_des_Liberty 阅读(215) 评论(0) 推荐(0) 编辑
上一页 1 ··· 59 60 61 62 63 64 65 66 67 ··· 98 下一页