Sort List
Sort a
linked list in O(n log n)
time using constant space complexity.
解题思路：
题意为以常量存储空间和O(nlogn)时间复杂度来排序链表。
可以用合并排序法，并用双指针法来找到中间节点。
产生一个头结点方便编码。
/**
* Definition for singly-link...
分类：
其他好文 时间：
2015-08-17 17:30:45
阅读次数：
161
题目Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target is not found in the...
分类：
其他好文 时间：
2015-08-17 17:25:36
阅读次数：
111
Given an array of integers, every element appearstwiceexcept for one. Find that single one.Note:Your algorithm should have a linear runtime complexity...
分类：
其他好文 时间：
2015-08-17 11:57:05
阅读次数：
138
There are two sorted arraysnums1andnums2of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should...
分类：
其他好文 时间：
2015-08-15 21:20:47
阅读次数：
105
Introduction to Mesos + Docker Apache Mesos is a cluster manager that simplifies the complexity of running tasks on a shared pool of servers. Docker is a lightweight container for deploying package...
分类：
其他好文 时间：
2015-08-13 18:18:59
阅读次数：
634
The problem is well known, so there is no need to repeat it!we can apply the iteration function f(n+1) = f(n)+f(n-1), however the time complexity is O...
分类：
其他好文 时间：
2015-08-12 21:38:44
阅读次数：
122
Mergeksorted linked lists and return it as one sorted list. Analyze and describe its complexity.思路I: 选择排序每次都比较各个list的头指针所指的val，取最小的那个。时间复杂度O(n2)Result...
分类：
其他好文 时间：
2015-08-11 20:47:38
阅读次数：
121
Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Suppose a sort...
分类：
其他好文 时间：
2015-08-11 18:05:13
阅读次数：
96
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
For example,
S = "ADOBECODEBANC"
T = "ABC"
Minimum window is "BAN...
我们在平时的学习中或多或少的接触到一些领域驱动设计(Domain-Driven Design，DDD)这些概念，这些概念也非常抽象，最重要的在国内也没有这方面的优秀书籍或者指导手册。也没有一些典型的Sample提供我们学习DDD。
在DDD领域中，就属Eric Evans大师的“Domain-Driven Design: Tackling Complexity
in the Heart ...
分类：
其他好文 时间：
2015-08-09 10:53:44
阅读次数：
128
