哥布林工程师

2016年4月5日

摘要： Reverse a linked list from position m to n. Notice Given m, n satisfy the following condition: 1 ≤ m ≤ n ≤ length of list. Given m, n satisfy the foll 阅读全文

posted @ 2016-04-05 05:51 哥布林工程师阅读(128) 评论(0) 推荐(0)

lintcode-medium-Restore IP Addresses

摘要： Given a string containing only digits, restore it by returning all possible valid IP address combinations. Example Given "25525511135", return [ "255. 阅读全文

posted @ 2016-04-05 04:25 哥布林工程师阅读(196) 评论(0) 推荐(0)

lintcode-medium-Reorder List

摘要： Given a singly linked list L: L0 → L1 → … → Ln-1 → Ln reorder it to: L0 → Ln → L1 → Ln-1 → L2 → Ln-2 → … Example Given 1->2->3->4->null, reorder it to 阅读全文

posted @ 2016-04-05 02:56 哥布林工程师阅读(127) 评论(0) 推荐(0)

2016年4月4日

litncode-medium-Remove Duplicates from Sorted List II

摘要： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Example Given 1->2->3- 阅读全文

posted @ 2016-04-04 17:29 哥布林工程师阅读(143) 评论(0) 推荐(0)

lintcode-medium-Rehashing

摘要： The size of the hash table is not determinate at the very beginning. If the total size of keys is too large (e.g. size >= capacity / 10), we should do 阅读全文

posted @ 2016-04-04 16:15 哥布林工程师阅读(115) 评论(0) 推荐(0)

lintcode-medium-Print Numbers by Recursion

摘要： Print numbers from 1 to the largest number with N digits by recursion. Notice It's pretty easy to do recursion like: recursion(i) { if i > largest num 阅读全文

posted @ 2016-04-04 15:54 哥布林工程师阅读(188) 评论(0) 推荐(0)

lintcode-medium-Previous Permutation

摘要： Given a list of integers, which denote a permutation. Find the previous permutation in ascending order. Notice The list may contains duplicate integer 阅读全文

posted @ 2016-04-04 15:37 哥布林工程师阅读(162) 评论(0) 推荐(0)

lintcode-medium-Pow(x, n)

摘要： Implement pow(x, n). Notice You don't need to care about the precision of your answer, it's acceptable if the expected answer and your answer 's diffe 阅读全文

posted @ 2016-04-04 14:47 哥布林工程师阅读(149) 评论(0) 推荐(0)

lintcode-medium-Permutations II

摘要： Given a list of numbers with duplicate number in it. Find all unique permutations. Example For numbers [1,2,2] the unique permutations are: [ [1,2,2], 阅读全文

posted @ 2016-04-04 14:42 哥布林工程师阅读(128) 评论(0) 推荐(0)

lintcode-medium-Permutations

摘要： Given a list of numbers, return all possible permutations. Example For nums = [1,2,3], the permutations are: [ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3, 阅读全文

posted @ 2016-04-04 13:50 哥布林工程师阅读(135) 评论(0) 推荐(0)

哥布林工程师

公告