-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmaximum-difference-by-remapping-a-digit.go
82 lines (72 loc) · 1.35 KB
/
maximum-difference-by-remapping-a-digit.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package main
import (
"fmt"
"strconv"
"strings"
)
// source: https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/
func itoa(x int) string {
return strconv.FormatInt(int64(x), 10)
}
func atoi(x string) int {
y, _ := strconv.ParseInt(x, 10, 32)
return int(y)
}
func min(x, y int) int {
if x < y {
return x
}
return y
}
func max(x, y int) int {
if x > y {
return x
}
return y
}
func minMaxDifference(num int) int {
numStr := itoa(num)
minV, maxV := num, num
for i := 0; i < 10; i++ {
for j := 0; j < 10; j++ {
if i == j {
continue
}
newNumStr := strings.ReplaceAll(numStr, string(rune(i+'0')), string(rune(j+'0')))
newNum := atoi(newNumStr)
minV = min(minV, newNum)
maxV = max(maxV, newNum)
}
}
return maxV - minV
}
func main() {
testCases := []struct {
num int
want int
}{
{
num: 11891,
want: 99009,
},
{
num: 90,
want: 99,
},
}
successes := 0
for _, tc := range testCases {
x := minMaxDifference(tc.num)
status := "ERROR"
if fmt.Sprint(x) == fmt.Sprint(tc.want) {
status = "OK"
successes++
}
fmt.Println(status, " Expected: ", tc.want, " Actual: ", x)
}
if l := len(testCases); successes == len(testCases) {
fmt.Printf("===\nSUCCESS: %d of %d tests ended successfully\n", successes, l)
} else {
fmt.Printf("===\nFAIL: %d tests failed\n", l-successes)
}
}