摘要：
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 matter what you leave beyond the new length.分析：本题是要去除数组中指定的元素，并更新数组长度。这道题可以借用一个变量nLength(初始化为0)来更新数组的长度，循环查找指定元素，如果没有，则nLength加1，同时进行更新数组。代码片段如下。clas 阅读全文
摘要：
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray[4,−1,2,1]has the largest sum =6.click to show more practice.More practice:If you have figured out the O(n) solution, try 阅读全文
摘要：
You are climbing a stair case. It takesnsteps 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级台阶，那显然只有一种跳法，如果有2级台阶，那么有两种跳的方法了:一种分两次条，每次跳一个；另外就是一次跳2级。我们把n级台阶的跳法看成是n的函数记为f(n)。当n>2时，f(n)=f(n-1)+f(n-2); 阅读全文