test: 1578 solution

py, c++, go, java

Author: QuBenhao

problems/problems_1578/Solution.cpp

@@ -1,29 +1,39 @@
 //go:build ignore
 #include "cpp/common/Solution.h"
 
-
 using namespace std;
 using json = nlohmann::json;
 
 class Solution {
 public:
-    int minCost(string colors, vector<int>& neededTime) {
-        
+  int minCost(const string &colors, const vector<int> &neededTime) {
+    int ans = 0, n = colors.length();
+    for (int i = 0, j = 0; i < n - 1; i = j) {
+      for (j = i + 1; j < n && colors[j] == colors[i]; ++j) {
+        if (neededTime[i] < neededTime[j]) {
+          ans += neededTime[i];
+          i = j;
+        } else {
+          ans += neededTime[j];
+        }
+      }
     }
+    return ans;
+  }
 };
 
 json leetcode::qubh::Solve(string input_json_values) {
-	vector<string> inputArray;
-	size_t pos = input_json_values.find('\n');
-	while (pos != string::npos) {
-		inputArray.push_back(input_json_values.substr(0, pos));
-		input_json_values = input_json_values.substr(pos + 1);
-		pos = input_json_values.find('\n');
-	}
-	inputArray.push_back(input_json_values);
+  vector<string> inputArray;
+  size_t pos = input_json_values.find('\n');
+  while (pos != string::npos) {
+    inputArray.push_back(input_json_values.substr(0, pos));
+    input_json_values = input_json_values.substr(pos + 1);
+    pos = input_json_values.find('\n');
+  }
+  inputArray.push_back(input_json_values);
 
-	Solution solution;
-	string colors = json::parse(inputArray.at(0));
-	vector<int> neededTime = json::parse(inputArray.at(1));
-	return solution.minCost(colors, neededTime);
+  Solution solution;
+  string colors = json::parse(inputArray.at(0));
+  vector<int> neededTime = json::parse(inputArray.at(1));
+  return solution.minCost(colors, neededTime);
 }

problems/problems_1578/Solution.java

@@ -4,16 +4,27 @@
 import java.util.*;
 import qubhjava.BaseSolution;
 
-
 public class Solution extends BaseSolution {
     public int minCost(String colors, int[] neededTime) {
-        
+        int ans = 0;
+        int n = colors.length();
+        for (int i = 0, j = 0; i < n - 1; i = j) {
+            for (j = i + 1; j < n && colors.charAt(i) == colors.charAt(j); j++) {
+                if (neededTime[i] < neededTime[j]) {
+                    ans += neededTime[i];
+                    i = j;
+                } else {
+                    ans += neededTime[j];
+                }
+            }
+        }
+        return ans;
     }
 
     @Override
     public Object solve(String[] inputJsonValues) {
         String colors = jsonStringToString(inputJsonValues[0]);
-		int[] neededTime = jsonArrayToIntArray(inputJsonValues[1]);
+        int[] neededTime = jsonArrayToIntArray(inputJsonValues[1]);
         return JSON.toJSON(minCost(colors, neededTime));
     }
 }

problems/problems_1578/solution.go

@@ -6,8 +6,19 @@ import (
 	"strings"
 )
 
-func minCost(colors string, neededTime []int) int {
-    
+func minCost(colors string, neededTime []int) (ans int) {
+	n := len(colors)
+	for i, j := 0, 0; i < n-1; i = j {
+		for j = i + 1; j < n && colors[j] == colors[i]; j++ {
+			if neededTime[i] < neededTime[j] {
+				ans += neededTime[i]
+				i = j
+			} else {
+				ans += neededTime[j]
+			}
+		}
+	}
+	return
 }
 
 func Solve(inputJsonValues string) any {

problems/problems_1578/solution.py

@@ -1,3 +1,5 @@
+from itertools import pairwise
+
 import solution
 from typing import *
 
@@ -7,5 +9,9 @@ def solve(self, test_input=None):
         return self.minCost(*test_input)
 
     def minCost(self, colors: str, neededTime: List[int]) -> int:
-        pass
-
+        ans = 0
+        for i, (a, b) in enumerate(pairwise(colors)):
+            if a == b:
+                ans += min(neededTime[i], neededTime[i + 1])
+                neededTime[i + 1] = max(neededTime[i], neededTime[i + 1])
+        return ans

problems/problems_1578/testcase

@@ -1,2 +1,2 @@
-["\"abaac\"\n[1,2,3,4,5]", "\"abc\"\n[1,2,3]", "\"aabaa\"\n[1,2,3,4,1]"]
-[3, 0, 2]
+["\"abaac\"\n[1,2,3,4,5]", "\"abc\"\n[1,2,3]", "\"aabaa\"\n[1,2,3,4,1]", "\"aaabbbabbbb\"\n[3,5,10,7,5,3,5,5,4,8,1]"]
+[3, 0, 2, 26]

problems/problems_1578/testcase.py

@@ -10,6 +10,7 @@ def __init__(self):
 		self.testcases.append(case(Input=['abaac', [1, 2, 3, 4, 5]], Output=3))
 		self.testcases.append(case(Input=['abc', [1, 2, 3]], Output=0))
 		self.testcases.append(case(Input=['aabaa', [1, 2, 3, 4, 1]], Output=2))
+		self.testcases.append(case(Input=["aaabbbabbbb",[3,5,10,7,5,3,5,5,4,8,1]], Output=26))
 
 	def get_testcases(self):
 		return self.testcases