Description:

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).

My Solution:

class Solution {    public int maxProfit(int[] prices) {        int bestPrice = 0;        int len = prices.length;        for(int i = 0;i < len - 1;i++){            if(prices[i + 1] >= prices[i]){                bestPrice += prices[i + 1] - prices[i];            }        }        return bestPrice;    }}

总结:

注意股价走向,股价上升就买进，第二天卖出。

版权声明：本文为博主原创文章，未经博主允许不得转载。