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/min_time_rope_colorful.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_time_rope_colorful.cpp')
-rw-r--r-- | other/min_time_rope_colorful.cpp | 25 |
1 files changed, 0 insertions, 25 deletions
diff --git a/other/min_time_rope_colorful.cpp b/other/min_time_rope_colorful.cpp deleted file mode 100644 index 9e34c1c..0000000 --- a/other/min_time_rope_colorful.cpp +++ /dev/null @@ -1,25 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minCost(string colors, vector<int> &neededTime) { - int ans = 0, maxCost = 0, sumCost = 0, n = colors.size(); - for (int i = 0; i < n; ++i) { - if (i > 0 && colors[i] != colors[i - 1]) { - ans += sumCost - maxCost; - sumCost = maxCost = 0; - } - sumCost += neededTime[i]; - maxCost = max(maxCost, neededTime[i]); - } - ans += sumCost - maxCost; - return ans; - } -}; - -int main() { - Solution obj; - string colors = "abaac"; - vector<int> neededTime = {1, 2, 3, 4, 5}; - cout << obj.minCost(colors, neededTime); -} |