diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/best_team_no_conflict.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/best_team_no_conflict.cpp')
-rw-r--r-- | other/best_team_no_conflict.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/best_team_no_conflict.cpp b/other/best_team_no_conflict.cpp deleted file mode 100644 index 0773202..0000000 --- a/other/best_team_no_conflict.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int bestTeamScore(vector<int> &scores, vector<int> &ages) { - int n = scores.size(), ans = 0; - vector<int> dp(n, 0); - vector<pair<int, int>> arr(n, {0, 0}); - for (int i = 0; i < n; ++i) { - arr[i].first = ages[i]; - arr[i].second = scores[i]; - } - for (int i = 0; i < n; ++i) { - dp[i] = arr[i].second; - for (int j = i - 1; j >= 0; --j) - if (arr[i].second >= arr[j].second) - dp[i] = max(dp[i], dp[j] + arr[i].second); - ans = max(ans, dp[i]); - } - return ans; - } -}; - -int main() { - Solution obj; - vector<int> scores = {1, 3, 5, 10, 15}, ages = {1, 2, 3, 4, 5}; - cout << obj.bestTeamScore(scores, ages); -} |