day 290: more efficient memory usage

vaskoz · Jun 9, 2019 · 4b65726 · 4b65726
1 parent 2eadef3
commit 4b65726
Showing 1 changed file with 6 additions and 8 deletions.
diff --git a/day290/problem.go b/day290/problem.go
@@ -16,14 +16,12 @@ func MinimizeQux(input []rune) []rune {
 }
 
 func minimizeQux(input []rune) []rune {
-	copied := make([]rune, len(input))
-	copy(copied, input)
-	min := copied
-	for i := 1; i < len(copied); i++ {
-		if copied[i] != copied[i-1] {
-			missing := 'R' + 'G' + 'B' - copied[i] - copied[i-1]
-			end := append([]rune{missing}, copied[i+1:]...)
-			candidate := append([]rune{}, copied[:i-1]...)
+	min := input
+	for i := 1; i < len(input); i++ {
+		if input[i] != input[i-1] {
+			missing := 'R' + 'G' + 'B' - input[i] - input[i-1]
+			end := append([]rune{missing}, input[i+1:]...)
+			candidate := append([]rune{}, input[:i-1]...)
 			candidate = append(candidate, end...)
 			candidate = minimizeQux(candidate)
 			if len(candidate) < len(min) {