## Life should be colorful.

Colorful Week Life should be as colorful as this calend […]

## Algorithm Problem: In-Place Merge Sort

The original merge sort version will take O(n) space, a […]

## LeetCode Problem: Populating Next Right Pointers in Each Node II

The code in the previous article LeetCode Problem: Popu […]

## LeetCode Problem: Populating Next Right Pointers in Each Node, Level traversal of binary tree

It’s easy to doing this by using a queue, doing a […]

## Algorithm Problem: Longest Non-Descending Sub Array or Logest Increasing Subarray, Dynamic programming

The ordinary dynamic programing gives our an algorithm […]

## Algoritm Problem: Add Two Unsigned Integers

To add two unsigned integers, A and B, we can exam a bi […]

## How to Deploy iOS Applications into Any Device out of Apple Store

Pre-Conditions: You have an apple developer account. Th […]

## Algorithm Problems: Two Sum

Manage two pointer to the array, one from the front, mo […]

## Algorithm Problem:Swap the left and right sub-tree in a binary tree without recursion

Just swap the tree nodes’ left and right child, i […]

## How to make a call using iOS SDK

It’s pretty simple, just one line of code: 用iOS S […]

## Algorithm Problem:Intersection of Sorted Array

Binary search every element of arr1 in arr0, if find, a […]

## LeetCode Problem:Flatten Binary Tree to Linked List

We can notice that in the flattened tree, each sub node […]

## Algorithm Sqrt for Double

The binary divide is straight forward solution, but som […]

## Algorithm Problem: Coins,Integer Bag Problem using Dynamic Programming

We can calculate the result by dynamic programming. Whe […]

## LeetCode Problem:Distinct Subsequences

(2013-1-5更新了动态规划版本，见下面) 这题有点复杂，一开始拿到都不知道怎么下手。 尝试的路径是： 1 […]