We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent a3815ee commit 20025c4Copy full SHA for 20025c4
C++/minimum-time-to-make-array-sum-at-most-x.cpp
@@ -1,7 +1,7 @@
1
// Time: O(n^2)
2
// Space: O(n)
3
4
-// greedy, sort, dp
+// greedy, sort, dp, linear search
5
class Solution {
6
public:
7
int minimumTime(vector<int>& nums1, vector<int>& nums2, int x) {
0 commit comments