摘要：
Sort a linked list in O(n log n) time using constant space complexity. 这道题要求用nlogn的时间复杂度去做，代码如下： 本题是典型的merge sort，只不过输入的数据是链表而不是数组了，那么我们需要每次找到中间的位置，要用 阅读全文
摘要：
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 本题目我第一个想到了用小顶堆来做，不是很难，直接上代码： /** * Definition for s 阅读全文
摘要：
分治算法 一、基本概念 在计算机科学中，分治法是一种很重要的算法。字面上的解释是“分而治之”，就是把一个复杂的问题分成两个或更多的相同或相似的子问题，再把子问题分成更小的子问题……直到最后子问题可以简单的直接求解，原问题的解即子问题的解的合并。这个技巧是很多高效算法的基础，如排序算法(快速排序，归并 阅读全文
摘要：
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. 此题考查链表的操 阅读全文
摘要：
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文
摘要：
Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to us 阅读全文
摘要：
Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return public class Solution { public List<List<Integer 阅读全文
摘要：
Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed? Would this affect the run-time complexity? How and why? Suppose an arra 阅读全文
摘要：
Suppose an array sorted in ascending order 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). You a 阅读全文
摘要：
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 阅读全文
摘要：
Suppose an array sorted in ascending order 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 阅读全文
摘要：
Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and 阅读全文