摘要：
Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K. If there is no non-empty subarray with sum at least K, ret 阅读全文
posted @ 2018-11-10 16:58
Veritas_des_Liberty
阅读(305)
评论(0)
推荐(0)
摘要：
Let's call an array A a mountain if the following properties hold: A.length >= 3 There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[ 阅读全文
posted @ 2018-11-09 21:14
Veritas_des_Liberty
阅读(234)
评论(0)
推荐(0)
摘要：
Let f(x) be the number of zeroes at the end of x!. (Recall that x! = 1 * 2 * 3 * ... * x, and by convention, 0! = 1.) For example, f(3) = 0 because 3! 阅读全文
posted @ 2018-11-09 20:52
Veritas_des_Liberty
阅读(307)
评论(0)
推荐(0)
摘要：
A sorted list A contains 1, plus some number of primes. Then, for every p < q in the list, we consider the fraction p/q. What is the K-th smallest fra 阅读全文
posted @ 2018-11-09 18:48
Veritas_des_Liberty
阅读(196)
评论(0)
推荐(0)
摘要：
On an N x N grid, each square grid[i][j] represents the elevation at that point (i,j). Now rain starts to fall. At time t, the depth of the water ever 阅读全文
posted @ 2018-11-09 16:59
Veritas_des_Liberty
阅读(191)
评论(0)
推荐(0)
摘要：
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays. Example 1: Note: Approach #1: Dynamic programm 阅读全文
posted @ 2018-11-08 21:08
Veritas_des_Liberty
阅读(191)
评论(0)
推荐(0)
摘要：
Given an integer array, return the k-th smallest distance among all the pairs. The distance of a pair (A, B) is defined as the absolute difference bet 阅读全文
posted @ 2018-11-08 20:48
Veritas_des_Liberty
阅读(207)
评论(0)
推荐(0)
摘要：
Nearly every one have used the Multiplication Table. But could you find out the k-th smallest number quickly from the multiplication table? Given the 阅读全文
posted @ 2018-11-08 17:34
Veritas_des_Liberty
阅读(297)
评论(0)
推荐(0)
摘要：
Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If the 阅读全文
posted @ 2018-11-08 16:34
Veritas_des_Liberty
阅读(257)
评论(0)
推荐(0)
摘要：
For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1. Now given a string representing n, you should return the smallest go 阅读全文
posted @ 2018-11-07 21:33
Veritas_des_Liberty
阅读(333)
评论(0)
推荐(0)
浙公网安备 33010602011771号