摘要: Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Have you met this question in a real interview? Ana 阅读全文
posted @ 2014-11-22 04:54 LiBlog 阅读(130) 评论(0) 推荐(0) 编辑
摘要: Follow up for "Find Minimum in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Suppose a s... 阅读全文
posted @ 2014-11-22 04:10 LiBlog 阅读(135) 评论(0) 推荐(0) 编辑
摘要: Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.Yo... 阅读全文
posted @ 2014-11-22 04:07 LiBlog 阅读(124) 评论(0) 推荐(0) 编辑
摘要: Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then le... 阅读全文
posted @ 2014-11-22 04:05 LiBlog 阅读(137) 评论(0) 推荐(0) 编辑