Movatterモバイル変換

[0]ホーム
URL:

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

 Sign up
Appearance settings

Commit1c1b244

Browse files
committed
Add dynamic programming version.
1 parent79cf9eb commit1c1b244

File tree

2 files changed

+73
-0
lines changed

2 files changed

+73
-0
lines changed
Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
importdpBestTimeToBuySellStocksfrom'../dpBestTimeToBuySellStocks';
2+
3+
describe('dpBestTimeToBuySellStocks',()=>{
4+
it('should find the best time to buy and sell stocks',()=>{
5+
letvisit;
6+
7+
expect(dpBestTimeToBuySellStocks([1,5])).toEqual(4);
8+
9+
visit=jest.fn();
10+
expect(dpBestTimeToBuySellStocks([1],visit)).toEqual(0);
11+
expect(visit).toHaveBeenCalledTimes(1);
12+
13+
visit=jest.fn();
14+
expect(dpBestTimeToBuySellStocks([1,5],visit)).toEqual(4);
15+
expect(visit).toHaveBeenCalledTimes(2);
16+
17+
visit=jest.fn();
18+
expect(dpBestTimeToBuySellStocks([5,1],visit)).toEqual(0);
19+
expect(visit).toHaveBeenCalledTimes(2);
20+
21+
visit=jest.fn();
22+
expect(dpBestTimeToBuySellStocks([1,5,10],visit)).toEqual(9);
23+
expect(visit).toHaveBeenCalledTimes(3);
24+
25+
visit=jest.fn();
26+
expect(dpBestTimeToBuySellStocks([10,1,5,20,15,21],visit)).toEqual(25);
27+
expect(visit).toHaveBeenCalledTimes(6);
28+
29+
visit=jest.fn();
30+
expect(dpBestTimeToBuySellStocks([7,1,5,3,6,4],visit)).toEqual(7);
31+
expect(visit).toHaveBeenCalledTimes(6);
32+
33+
visit=jest.fn();
34+
expect(dpBestTimeToBuySellStocks([1,2,3,4,5],visit)).toEqual(4);
35+
expect(visit).toHaveBeenCalledTimes(5);
36+
37+
visit=jest.fn();
38+
expect(dpBestTimeToBuySellStocks([7,6,4,3,1],visit)).toEqual(0);
39+
expect(visit).toHaveBeenCalledTimes(5);
40+
41+
visit=jest.fn();
42+
expect(dpBestTimeToBuySellStocks(
43+
[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20],
44+
visit,
45+
)).toEqual(19);
46+
expect(visit).toHaveBeenCalledTimes(20);
47+
});
48+
});
Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
/**
2+
* Finds the maximum profit from selling and buying the stocks.
3+
* DYNAMIC PROGRAMMING APPROACH.
4+
*
5+
*@param {number[]} prices - Array of stock prices, i.e. [7, 6, 4, 3, 1]
6+
*@param {function(): void} visit - Visiting callback to calculate the number of iterations.
7+
*@return {number} - The maximum profit
8+
*/
9+
constdpBestTimeToBuySellStocks=(prices,visit=()=>{})=>{
10+
visit();
11+
letlastBuy=-prices[0];
12+
letlastSold=0;
13+
14+
for(letday=1;day<prices.length;day+=1){
15+
visit();
16+
constcurBuy=Math.max(lastBuy,lastSold-prices[day]);
17+
constcurSold=Math.max(lastSold,lastBuy+prices[day]);
18+
lastBuy=curBuy;
19+
lastSold=curSold;
20+
}
21+
22+
returnlastSold;
23+
};
24+
25+
exportdefaultdpBestTimeToBuySellStocks;

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp