Razer.Lu

2014年2月18日

摘要： There areNgas stations along a circular route, where the amount of gas at stationiisgas[i].You have a car with an unlimited gas tank and it costscost[... 阅读全文

posted @ 2014-02-18 08:16 Razer.Lu 阅读(301) 评论(0) 推荐(0) 编辑

Linked List Cycle

摘要： Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?两个指针，一个一次走两步，一个一次走一步，相遇说明有环/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * ... 阅读全文

posted @ 2014-02-18 03:11 Razer.Lu 阅读(191) 评论(0) 推荐(0) 编辑

Clone Graph

摘要： Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use#as a separator for each node, and,as a separator for node label and each neighbor of the node.As an example, consider the serialized g 阅读全文

posted @ 2014-02-18 02:43 Razer.Lu 阅读(278) 评论(0) 推荐(0) 编辑

2014年2月17日

Binary Tree Postorder Traversal

摘要： Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].Note:Recursive solution is trivial, could you do it iteratively?Ref:http://www.cnblogs.com/feiling/p/3426486.html[解题思路]后序遍历的非递归相对来说比较难，根节点需要在其左右孩子都访问结束后... 阅读全文

posted @ 2014-02-17 17:14 Razer.Lu 阅读(190) 评论(0) 推荐(0) 编辑

Binary Tree Preorder Traversal

摘要： Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Note:Recursive solution is trivial, could you do it iteratively?Using Stack/** * Definition for binary tree * public class TreeNode { * int val; * ... 阅读全文

posted @ 2014-02-17 17:08 Razer.Lu 阅读(199) 评论(0) 推荐(0) 编辑

Best Time to Buy and Sell Stock III

摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文

posted @ 2014-02-17 16:57 Razer.Lu 阅读(212) 评论(0) 推荐(0) 编辑

Best Time to Buy and Sell Stock II

摘要： Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文

posted @ 2014-02-17 15:22 Razer.Lu 阅读(179) 评论(0) 推荐(0) 编辑

Best Time to Buy and Sell Stock

摘要： Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie... 阅读全文

posted @ 2014-02-17 15:09 Razer.Lu 阅读(153) 评论(0) 推荐(0) 编辑

Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6,5,7], [4,1,8,3]]The minimum path sum from top to bottom is11(i.e.,2+3+5+1= 11).Note:Bonus point if you are a... 阅读全文

posted @ 2014-02-17 14:46 Razer.Lu 阅读(259) 评论(0) 推荐(0) 编辑

Container With Most Water

摘要： Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ... 阅读全文

posted @ 2014-02-17 13:59 Razer.Lu 阅读(259) 评论(0) 推荐(0) 编辑

公告