2016年3月31日
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 阅读全文
posted @ 2016-03-31 17:18 哥布林工程师 阅读(133) 评论(0) 推荐(0)
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 阅读全文
posted @ 2016-03-31 13:38 哥布林工程师 阅读(172) 评论(0) 推荐(0)
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 阅读全文
posted @ 2016-03-31 08:51 哥布林工程师 阅读(125) 评论(0) 推荐(0)
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 ] 阅读全文
posted @ 2016-03-31 08:43 哥布林工程师 阅读(161) 评论(0) 推荐(0)