Merge pull request vJechsmayr#586 from nainys/master

Add: Solution to 1402. Reducing Dishes

Author: vJechsmayr

LeetCode/1402_Reducing_Dishes.py

@@ -0,0 +1,11 @@
+class Solution:
+ def maxSatisfaction(self, satisfaction: List[int]) -> int:
+ 
+ satisfaction.sort(reverse=True)
+ ans = cur_sum = 0
+ for ele in satisfaction:
+ cur_sum += ele
+ if cur_sum >= 0:
+ ans += cur_sum
+ 
+ return ans;