FilesExpand file tree

 master

/

BestTimetoBuyandSellStock.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

26 lines (24 loc) · 881 Bytes

 master

/

BestTimetoBuyandSellStock.java

Top

File metadata and controls

• Code
• Blame

26 lines (24 loc) · 881 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

26

/*

Author: King, higuige@gmail.com

Date: Oct 07, 2014

Problem: Best Time to Buy and Sell Stock

Difficulty: Easy

Source: http://leetcode.com/onlinejudge#question_121

Notes:

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

If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),

design an algorithm to find the maximum profit.

Solution: For each element, calculate the max difference with the former elements.

*/

public class Solution {

public int maxProfit(int[] prices) {

int n = prices.length;

if (n <= 1) return 0;

int res = 0, minVal = prices[0];

for (int i = 1; i < n; ++i) {

res = Math.max(res, prices[i] - minVal);

minVal = Math.min(minVal, prices[i]);

}

return res;

}

}