1. 程式人生 > >Leetcode 122: Best Time to Buy and Sell Stock II

Leetcode 122: Best Time to Buy and Sell Stock II

com same clas multipl fit sel fin ans let

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

 1 public class Solution {
 2     public int MaxProfit(int[] prices) {
 3         int result = 0;
 4         
 5         for (int i = 1; i < prices.Length; i++)
 6         {
 7             if (prices[i] > prices[i - 1]) result += prices[i] - prices[i - 1];
 8         }
 9         
10         return
result; 11 } 12 }

Leetcode 122: Best Time to Buy and Sell Stock II