resorcap的专栏

http://aabbc1122.blog.163.com/blog/static/57043257201272294524425/

1. Climbing Stairs   You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 由

1.Single Number http://oj.leetcode.com/problems/single-number/ Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using