/
githubmirror
/
interviews
Обзор
Документация
Войти
/
githubmirror
/
interviews
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
leetcode/greedy/BestTimeToBuyAndSellStockII.java
21 строка
788 B
Kevin Naughton Jr
adding new problems
29 мар 2018, 18:23
29 мар 2018, 18:23
504af1b
Код
Авторство
О чём код?
//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). class BestTimeToBuyAndSellStockII { public int maxProfit(int[] prices) { if(prices == null || prices.length == 0) { return 0; } int profit = 0; for(int i = 0; i < prices.length - 1; i++) { if(prices[i] < prices[i + 1]) { profit += prices[i + 1] - prices[i]; } } return profit; } }