OJ-ARRAY
Anyanyamy
这个作者很懒,什么都没留下…
展开
-
Leet Code 4 Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 搜了一下leetcode的难度转载 2015-09-08 00:30:06 · 304 阅读 · 0 评论 -
Leet Code 21 Merge Two Sorted Lists
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists /** * Definition for singly-linked list. * publi原创 2015-09-12 11:05:48 · 298 阅读 · 0 评论 -
Leet Code 19 Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the原创 2015-09-12 03:02:24 · 273 阅读 · 0 评论