实验1

删除数组重复元素

class Solution {
public:
    /**
     * @param prices: Given an integer array
     * @return: Maximum profit
     */
    int maxProfit(vector<int> &prices) {
        // write your code here
        int start = 0;  
        if(prices.size()<2)  
            return start;  
            
            
        int lowest; 
        lowest = prices[0];  
        for(int i=1;i<prices.size();i++) 
        
        {  
            int fall;
            fall= prices[i];  
            start = max(start,fall-lowest);  
            lowest  = min(lowest,fall);  
        }  
        
        return start;
    }
};

 

买卖股票的最佳时机

class Solution {
public:
    /**
     * @param n: An integer
     * @return: An integer
     */
    int climbStairs(int n) {
        // write your code here
        int result = 1;
        int first = 1;
        int next = 1;
        while (--n > 0)
        {
            result = first + next;
            first = next;
            next = result;
        }

       return result;
    }
};

爬楼梯

 1 /*#include "stdafx.h"
#include<iostream>
using namespace std;*/

class Solution {
public:
    /**
     * @param A: a list of integers
     * @return : return an integer
     */
    int removeDuplicates(vector<int> &nums) {
        // write your code here
if(nums.size() == 0) return 0;
        int i;
        int j = 1;
        for(i = 1; i < nums.size(); ++i)
        {
            if(nums[i] != nums[j-1])
            {
                nums[j] = nums[i];
                j++;
            }
        }
        return j;
}
};