哥布林工程师

2016年3月24日

摘要： Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maxim 阅读全文

posted @ 2016-03-24 11:43 哥布林工程师阅读(101) 评论(0) 推荐(0) 编辑

lintcode-medium-Interval Sum

摘要： Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers [start, end]. For each 阅读全文

posted @ 2016-03-24 07:36 哥布林工程师阅读(176) 评论(0) 推荐(0) 编辑

lintcode-medium-Interval Minimum Number

摘要： Given an integer array (index from 0 to n-1, where n is the size of this array), and an query list. Each query has two integers [start, end]. For each 阅读全文

posted @ 2016-03-24 07:23 哥布林工程师阅读(228) 评论(0) 推荐(0) 编辑

2016年3月23日

lintcode-medium-Intersetion of Two Linked Lists

摘要： Write a program to find the node at which the intersection of two singly linked lists begins. The following two linked lists: begin to intersect at no 阅读全文

posted @ 2016-03-23 09:01 哥布林工程师阅读(139) 评论(0) 推荐(0) 编辑

lintcode-medium-Interleaving String

摘要： Given three strings: s1, s2, s3, determine whether s3 is formed by the interleaving of s1 and s2. For s1 = "aabcc", s2 = "dbbca" 动态规划，用一个二维数据记录：s1前i个字阅读全文

posted @ 2016-03-23 08:52 哥布林工程师阅读(128) 评论(0) 推荐(0) 编辑

lintcode-medium-Interleaving Positive and Negative Numbers

摘要： Given an array with positive and negative integers. Re-range it to interleaving with positive and negative integers. Given [-1, -2, -3, 4, 5, 6], afte 阅读全文

posted @ 2016-03-23 02:35 哥布林工程师阅读(146) 评论(0) 推荐(0) 编辑

2016年3月22日

lintcode-medium-Integer to Roman

摘要： Given an integer, convert it to a roman numeral. The number is guaranteed to be within the range from 1 to 3999. 4 -> IV 12 -> XII 21 -> XXI 99 -> XCI 阅读全文

posted @ 2016-03-22 17:22 哥布林工程师阅读(119) 评论(0) 推荐(0) 编辑

lintcode-medium-Implement Trie

摘要： Implement a trie with insert, search, and startsWith methods. 阅读全文

posted @ 2016-03-22 16:55 哥布林工程师阅读(158) 评论(0) 推荐(0) 编辑

lintcode-medium-Implement Queue by Two Stacks

摘要： As the title described, you should only use two stacks to implement a queue's actions. The queue should support push(element), pop()and top() where po 阅读全文

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

lintcode-medium-House Robber

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文

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

哥布林工程师

公告