2016年3月8日
148. Sort List
摘要： Sort a linked list in O(n log n) time using constant space complexity. 链表的归并排序。 /** * Definition for singly-linked list. * struct ListNode { * int val 阅读全文
posted @ 2016-03-08 23:51 向日葵的祈愿 阅读(198) 评论(0) 推荐(0) 编辑
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: a1 → a2 阅读全文
posted @ 2016-03-08 00:28 向日葵的祈愿 阅读(219) 评论(0) 推荐(0) 编辑