码迷,mamicode.com
首页 >  
搜索关键字:smallest sub-array    ( 590个结果
Project Euler: Solution for Problem 5
Smallest multiple Problem 5 Problem 5 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What ...
分类:其他好文   时间:2016-07-10 00:54:01    阅读次数:159
Min Stack
Implement a stack with min() function, which will return the smallest number in the stack. It should support push, pop and min operation all in O(1) c ...
分类:其他好文   时间:2016-07-09 08:10:09    阅读次数:113
Find K Pairs with Smallest Sum
Dijkstra Algorithm ...
分类:其他好文   时间:2016-07-08 06:47:13    阅读次数:390
302. Smallest Rectangle Enclosing Black Pixels
...
分类:其他好文   时间:2016-07-04 06:35:58    阅读次数:150
Kth Smallest Sum In Two Sorted Arrays
Given two integer arrays sorted in ascending order and an integer k. Define sum = a + b, where a is an element from the first array and b is an elemen ...
分类:其他好文   时间:2016-06-21 20:47:29    阅读次数:277
Kth Smallest Number in Sorted Matrix
Find the kth smallest number in at row and column sorted matrix. Given k = 4 and a matrix: [ [1 ,5 ,7], [3 ,7 ,8], [4 ,8 ,9], ] return 5 这一题是Kth Large ...
分类:其他好文   时间:2016-06-21 17:07:38    阅读次数:327
[lintcode the-smallest-difference]最小差(python)
题目链接:http://www.lintcode.com/zh-cn/problem/the-smallest-difference/ 给定两个整数数组(第一个是数组 A,第二个是数组 B),在数组 A 中取 A[i],数组 B 中取 B[j],A[i] 和 B[j]两者的差越小越好(|A[i] - ...
分类:编程语言   时间:2016-06-18 23:59:43    阅读次数:762
Educational Codeforces Round 13 A
Description Johny likes numbers n and k very much. Now Johny wants to find the smallest integer x greater than n, so it is divisible by the number k. ...
分类:其他好文   时间:2016-06-15 12:41:07    阅读次数:156
230.Kth Smallest Element in a BST
...
分类:其他好文   时间:2016-06-15 10:51:16    阅读次数:140
leetcode 之 Kth Smallest Element in a BST
题目描述: Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ ...
分类:其他好文   时间:2016-06-02 12:59:37    阅读次数:98
590条   上一页 1 ... 31 32 33 34 35 ... 59 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!