LeetCode OJ--Best Time to Buy and Sell Stock II

http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/

第二问，是说可以进行无数次买卖。

贪心法

#include <iostream>
#include <vector>
using namespace std;

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        if(prices.empty())
            return NULL;
        if(prices.size()==)
            return ;
        int ans = ;
        for(int i = ;i<prices.size();i++)
        {
            if(prices[i]>prices[i-])
                ans = ans - prices[i-] +prices[i];
        }
        return ans;
    }
};

int main()
{
    Solution myS;
    vector<int> price;
    price.push_back();
    price.push_back();
    price.push_back();
    price.push_back();
    price.push_back();
    price.push_back();
    price.push_back(-);
    myS.maxProfit(price);
    return ;
}