摘要：
题目：Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't... 阅读全文
摘要：
题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space... 阅读全文
摘要：
题目：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two e... 阅读全文
摘要：
题目：Divide two integers without using multiplication, division and mod operator.题解：这道题我自己没想出来。。。乘除取模都不让用。。那只有加减了。。。我参考的http://blog.csdn.net/perfect888... 阅读全文
摘要：
题目：Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.题解：这道题跟NQueens的解法完全一样（具... 阅读全文
摘要：
题目：The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return a... 阅读全文
摘要：
题目：Implement pow(x, n).题解：pow(x,n)就是求x的n次方。x的N次方可以看做：x^n = x^(n/2)*x^(n/2)*x^(n%2)。所以利用递归求解，当n==1的时候，x^n=x。当然n是可以小于0的，2^(-3) = 1/(2^3)。按照上面那个规律就可以解决了... 阅读全文
摘要：
题目：Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtim... 阅读全文