码迷,mamicode.com
首页 >  
搜索关键字:medium    ( 2358个结果
已有文章
现在已经完成的文章 Internship https://medium.com/@wzxllx/internship-a23ae83ea3f5#.l6oefaquy 手势识别小思考 https://medium.com/@wzxllx/%E6%89%8B%E5%8A%BF%E8%AF%86%E5%8 ...
分类:其他好文   时间:2016-04-02 09:35:43    阅读次数:154
lintcode-medium-Number of Airplanes in the Sky
Given an interval list which are flying and landing time of the flight. How many airplanes are on the sky at most? Notice If landing and flying happen ...
分类:其他好文   时间:2016-04-02 08:25:54    阅读次数:193
lintcode-medium-Next Permutation II
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib ...
分类:其他好文   时间:2016-04-02 07:07:00    阅读次数:117
lintcode-medium-Next Permutation
恢复内容开始 Given a list of integers, which denote a permutation. Find the next permutation in ascending order. Notice The list may contains duplicate inte ...
分类:其他好文   时间:2016-04-02 07:04:38    阅读次数:164
lintcode-medium-Minimum Window Substring
Given a string source and a string target, find the minimum window in source which will contain all the characters in target. Notice If there is no su ...
分类:Windows程序   时间:2016-04-01 14:24:27    阅读次数:196
lintcode-medium-Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return ...
分类:其他好文   时间:2016-03-31 18:33:57    阅读次数:143
lintcode-medium-Minimum Adjustment Cost
Given an integer array, adjust each integers so that the difference of every adjacent integers are not greater than a given number target. If the arra ...
分类:其他好文   时间:2016-03-31 14:18:06    阅读次数:141
lintcode-medium-Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example Given lists: [ 2->4->null, null, -1->null ] ...
分类:其他好文   时间:2016-03-31 09:31:51    阅读次数:169
lintcode-medium-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-03-31 09:29:58    阅读次数:175
lintcode-medium-Maximum Subarray II
Given an array of integers, find two non-overlapping subarrays which have the largest sum.The number in each subarray should be contiguous.Return the ...
分类:其他好文   时间:2016-03-30 14:34:53    阅读次数:173
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!