哥布林工程师

2016年4月2日

摘要： Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possib 阅读全文

posted @ 2016-04-02 06:30 哥布林工程师阅读(168) 评论(0) 推荐(0) 编辑

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 阅读全文

posted @ 2016-04-02 06:29 哥布林工程师阅读(115) 评论(0) 推荐(0) 编辑

2016年4月1日

lintcode-medium-N Queens II

摘要： Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. Example For n=4, there ar 阅读全文

posted @ 2016-04-01 16:32 哥布林工程师阅读(153) 评论(0) 推荐(0) 编辑

lintcode-medium-N Queens

摘要： The n-queens puzzle is the problem of placing n queens on an n×nchessboard such that no two queens attack each other. Given an integer n, return all d 阅读全文

posted @ 2016-04-01 16:30 哥布林工程师阅读(156) 评论(0) 推荐(0) 编辑

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 阅读全文

posted @ 2016-04-01 12:53 哥布林工程师阅读(158) 评论(0) 推荐(0) 编辑

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 哥布林工程师阅读(124) 评论(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 哥布林工程师阅读(160) 评论(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 哥布林工程师阅读(121) 评论(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 哥布林工程师阅读(154) 评论(0) 推荐(0) 编辑

2016年3月30日

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 阅读全文

posted @ 2016-03-30 13:04 哥布林工程师阅读(193) 评论(0) 推荐(0) 编辑

哥布林工程师

公告