MCPcopy Create free account
hub / github.com/Blankj/awesome-java-leetcode / maxProfit

Method maxProfit

src/com/blankj/easy/_0121/Solution.java:13–21  ·  view source on GitHub ↗
(int[] prices)

Source from the content-addressed store, hash-verified

11 */
12public class Solution {
13 public int maxProfit(int[] prices) {
14 int max = 0, minPrice = Integer.MAX_VALUE;
15 for (int i = 0; i < prices.length; ++i) {
16 if (prices[i] < minPrice) minPrice = prices[i];
17 int delta = prices[i] - minPrice;
18 if (delta > max) max = delta;
19 }
20 return max;
21 }
22
23 public static void main(String[] args) {
24 Solution solution = new Solution();

Callers 1

mainMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected