Skip to content

Commit

Permalink
add 1402
Browse files Browse the repository at this point in the history
  • Loading branch information
luliyucoordinate committed Apr 7, 2020
1 parent cb59dd6 commit 771f3a9
Show file tree
Hide file tree
Showing 7 changed files with 60 additions and 5 deletions.
3 changes: 2 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -698,4 +698,5 @@ LeetCode
|1397|[Find All Good Strings](https://leetcode.com/problems/find-all-good-strings/)|c|[c++](./src/1397-Find-All-Good-Strings/1397.cpp)|[python](./src/1397-Find-All-Good-Strings/1397.py)|[go](./src/1397-Find-All-Good-Strings/1397.go)|[js](./src/1397-Find-All-Good-Strings/1397.js)|[java](./src/1397-Find-All-Good-Strings/1397.java)|Hard|
|1399|[Count Largest Group](https://leetcode.com/problems/count-largest-group/)|c|[c++](./src/1399-Count-Largest-Group/1399.cpp)|[python](./src/1399-Count-Largest-Group/1399.py)|[go](./src/1399-Count-Largest-Group/1399.go)|[js](./src/1399-Count-Largest-Group/1399.js)|[java](./src/1399-Count-Largest-Group/1399.java)|Easy|
|1400|[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)|c|[c++](./src/1400-Construct-K-Palindrome-Strings/1400.cpp)|[python](./src/1400-Construct-K-Palindrome-Strings/1400.py)|[go](./src/1400-Construct-K-Palindrome-Strings/1400.go)|[js](./src/1400-Construct-K-Palindrome-Strings/1400.js)|[java](./src/1400-Construct-K-Palindrome-Strings/1400.java)|Medium|
|1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|c|[c++](./src/1401-Circle-and-Rectangle-Overlapping/1401.cpp)|[python](./src/1401-Circle-and-Rectangle-Overlapping/1401.py)|[go](./src/1401-Circle-and-Rectangle-Overlapping/1401.go)|[js](./src/1401-Circle-and-Rectangle-Overlapping/1401.js)|[java](./src/1401-Circle-and-Rectangle-Overlapping/1401.java)|Medium|
|1401|[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)|c|[c++](./src/1401-Circle-and-Rectangle-Overlapping/1401.cpp)|[python](./src/1401-Circle-and-Rectangle-Overlapping/1401.py)|[go](./src/1401-Circle-and-Rectangle-Overlapping/1401.go)|[js](./src/1401-Circle-and-Rectangle-Overlapping/1401.js)|[java](./src/1401-Circle-and-Rectangle-Overlapping/1401.java)|Medium|
|1402|[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)|c|[c++](./src/1402-Reducing-Dishes/1402.cpp)|[python](./src/1402-Reducing-Dishes/1402.py)|[go](./src/1402-Reducing-Dishes/1402.go)|[js](./src/1402-Reducing-Dishes/1402.js)|[java](./src/1402-Reducing-Dishes/1402.java)|Hard|
13 changes: 13 additions & 0 deletions src/1402-Reducing-Dishes/1402.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
class Solution {
public:
int maxSatisfaction(vector<int>& s) {
sort(s.begin(), s.end());
int res = 0, total = 0, n = s.size();

for (int i = n - 1; i >= 0 && s[i] > -total; --i) {
total += s[i];
res += total;
}
return res;
}
};
10 changes: 10 additions & 0 deletions src/1402-Reducing-Dishes/1402.go
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
func maxSatisfaction(s []int) int {
sort.Ints(s)
res, total, n := 0, 0, len(s)

for i := n - 1; i >= 0 && s[i] > -total; i-- {
total += s[i]
res += total
}
return res
}
12 changes: 12 additions & 0 deletions src/1402-Reducing-Dishes/1402.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
class Solution {
public int maxSatisfaction(int[] s) {
Arrays.sort(s);
int res = 0, total = 0, n = s.length;

for (int i = n - 1; i >= 0 && s[i] > -total; --i) {
total += s[i];
res += total;
}
return res;
}
}
10 changes: 10 additions & 0 deletions src/1402-Reducing-Dishes/1402.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
var maxSatisfaction = function(s) {
s.sort((a, b) => a - b);
let res = 0, total = 0, n = s.length;

for (let i = n - 1; i >= 0 && s[i] > -total; --i) {
total += s[i];
res += total;
}
return res;
};
9 changes: 9 additions & 0 deletions src/1402-Reducing-Dishes/1402.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
class Solution:
def maxSatisfaction(self, s: List[int]) -> int:
res = total = 0
s.sort()

while s and s[-1] + total > 0:
total += s.pop()
res += total
return res
8 changes: 4 additions & 4 deletions src/addProb.py
Original file line number Diff line number Diff line change
Expand Up @@ -2,10 +2,10 @@
import os, bisect

# 题目名称
name = "Circle and Rectangle Overlapping"
ID = 1401
url = "https://leetcode.com/problems/circle-and-rectangle-overlapping/"
difficult = "Medium"
name = "Reducing Dishes"
ID = 1402
url = "https://leetcode.com/problems/reducing-dishes/"
difficult = "Hard"
prog = ['c', 'cpp', 'py', 'go', 'js', 'java']


Expand Down

0 comments on commit 771f3a9

Please sign in to comment.