code code code

leetcode#70 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?

leetcode 136 single number Given an array of integers, every element appears twice except for one. Find that single one. Your algorithm should have a linear runtime complexity. can't use extra space.

leetcode 19 删除单链表倒数第n个结点 Given a linked list, remove the nth node from the end of list and return its head.

github链接leetcode本题链接题目描述 Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sel