2015年2月14日
Leetcode 19 Remove Nth Node From End of List (快慢指针)
摘要： Given a linked list, remove thenthnode from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After re... 阅读全文
posted @ 2015-02-14 03:14 Sherry是小太阳 阅读(118) 评论(0) 推荐(0)
Leetcode 160 Intersection of Two Linked Lists(快慢指针)
摘要： Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a... 阅读全文
posted @ 2015-02-14 02:51 Sherry是小太阳 阅读(197) 评论(0) 推荐(0)
Leetcode 120 Triangle (Dynamic Programming Method)
摘要： 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 fol... 阅读全文
posted @ 2015-02-14 01:29 Sherry是小太阳 阅读(144) 评论(0) 推荐(0)