FilesExpand file tree

 master

/

BestTimetoBuyandSellStockII.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

25 lines (24 loc) · 960 Bytes

 master

/

BestTimetoBuyandSellStockII.java

Top

File metadata and controls

• Code
• Blame

25 lines (24 loc) · 960 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

/*

Author: King, wangjingui@outlook.com

Date: Jan 02, 2015

Problem: Best Time to Buy and Sell Stock II

Difficulty: Medium

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

Notes:

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

Solution: 1. At the beginning of the ascending order: buy.

At the ending of the ascending order: sell.

*/

public class Solution {

public int maxProfit(int[] prices) {

int res = 0;

for (int i = 1; i < prices.length; ++i) {

res += Math.max(0, prices[i] - prices[i-1]);

}

return res;

}

}