@@ -634,7 +634,7 @@ class Solution:
634
634
for i in range (n - 1 , - 1 , - 1 ):
635
635
dp_buy = max (dp1_sell - prices[i], dp1_buy)
636
636
dp_sell = max (dp2_buy + prices[i], dp1_sell)
637
- dp2_buy, dp1_sell = dp1_buy, dp1_sell
637
+ dp2_buy = dp1_buy
638
638
dp1_buy, dp1_sell = dp_buy, dp_sell
639
639
640
640
return dp1_buy
@@ -651,7 +651,6 @@ public class Solution {
651
651
int dp_buy = Math . max(dp1_sell - prices[i], dp1_buy);
652
652
int dp_sell = Math . max(dp2_buy + prices[i], dp1_sell);
653
653
dp2_buy = dp1_buy;
654
- dp1_sell = dp1_sell;
655
654
dp1_buy = dp_buy;
656
655
dp1_sell = dp_sell;
657
656
}
@@ -673,7 +672,6 @@ public:
673
672
int dp_buy = max(dp1_sell - prices[i], dp1_buy);
674
673
int dp_sell = max(dp2_buy + prices[i], dp1_sell);
675
674
dp2_buy = dp1_buy;
676
- dp1_sell = dp1_sell;
677
675
dp1_buy = dp_buy;
678
676
dp1_sell = dp_sell;
679
677
}
@@ -698,7 +696,6 @@ class Solution {
698
696
let dp_buy = Math .max (dp1_sell - prices[i], dp1_buy);
699
697
let dp_sell = Math .max (dp2_buy + prices[i], dp1_sell);
700
698
dp2_buy = dp1_buy;
701
- dp1_sell = dp1_sell;
702
699
dp1_buy = dp_buy;
703
700
dp1_sell = dp_sell;
704
701
}
@@ -719,7 +716,6 @@ public class Solution {
719
716
int dp_buy = Math .Max (dp1_sell - prices [i ], dp1_buy );
720
717
int dp_sell = Math .Max (dp2_buy + prices [i ], dp1_sell );
721
718
dp2_buy = dp1_buy ;
722
- dp1_sell = dp1_sell ;
723
719
dp1_buy = dp_buy ;
724
720
dp1_sell = dp_sell ;
725
721
}
0 commit comments