Leetcode: Best Time to Buy and Sell Stock II

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

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
       int size=prices.size();
       int profit=0;
       for(int i=1;i<size;i++){
           if(prices[i]>prices[i-1]&&(i==(size-1)||prices[i]>=prices[i+1])){
               for(int j=i-1;j>=0;j--){
                   if(prices[j]<prices[j+1]&&(j==0||prices[j]<=prices[j-1])){
                       profit+=prices[i]-prices[j];
                       break;
                   }
               }
           }
       }
       return profit;
    }
};