Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
31 lines (28 loc) · 901 Bytes

File metadata and controls

31 lines (28 loc) · 901 Bytes
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
27
28
29
30
31
class Problem121 {
public static void main(String[] args) {
Problem121 p = new Problem121();
int[] nums = {1,4,2};
System.out.println(p.maxProfit(nums));
}
public int maxProfit1(int[] prices) {
int max = Integer.MIN_VALUE;
for (int i = prices.length-1; i > 0; i--) {
for (int j = i-1; j >= 0; j--) {
int profit = prices[i]-prices[j];
max = profit > max ? profit: max;
}
}
return max;
}
public int maxProfit(int[] prices) {
int minprice = Integer.MAX_VALUE;
int maxprofit = 0;
for (int i = 0; i < prices.length; i++) {
if (prices[i] < minprice)
minprice = prices[i];
else if (prices[i] - minprice > maxprofit)
maxprofit = prices[i] - minprice;
}
return maxprofit;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.