Skip to content

Commit c021340

Browse files
committed
test: 6 cases changes to run parallel
1 parent eac884c commit c021340

File tree

7 files changed

+81
-51
lines changed

7 files changed

+81
-51
lines changed

README.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -28,12 +28,12 @@
2828
|47|[Permutations II][Solutions-47]|[WindomZ][Solutions-47-Go]|Medium|[198 ns/op/3 test cases][Solutions-47-Test]|19 ms|
2929
|46|[Permutations][Solutions-46]|[WindomZ][Solutions-46-Go]|Medium|[484 ns/op/3 test cases][Solutions-46-Test]|9 ms|
3030
|45|[Jump Game II][Solutions-45]|[WindomZ][Solutions-45-Go]|Hard|[5.14 ns/op/6 test cases][Solutions-45-Test]|19 ms|
31-
|44|[Wildcard Matching][Solutions-44]|[WindomZ][Solutions-44-Go]|Hard|[49.6 ns/op/9 test cases][Solutions-44-Test]|15 ms|
32-
|43|[Multiply Strings][Solutions-43]|[WindomZ][Solutions-43-Go]|Medium|[215 ns/op/6 test cases][Solutions-43-Test]|3 ms|
33-
|42|[Trapping Rain Water][Solutions-42]|[WindomZ][Solutions-42-Go]|Hard|[74.1 ns/op/6 test cases][Solutions-42-Test]|6 ms|
34-
|41|[First Missing Positive][Solutions-41]|[WindomZ][Solutions-41-Go]|Hard|[60.3 ns/op/6 test cases][Solutions-41-Test]|3 ms|
35-
|40|[Combination Sum II][Solutions-40]|[WindomZ][Solutions-40-Go]|Medium|[710 ns/op/3 test cases][Solutions-40-Test]|3 ms|
36-
|39|[Combination Sum][Solutions-39]|[WindomZ][Solutions-39-Go]|Medium|[623 ns/op/3 test cases][Solutions-39-Test]|6 ms|
31+
|44|[Wildcard Matching][Solutions-44]|[WindomZ][Solutions-44-Go]|Hard|[10.9 ns/op/9 test cases][Solutions-44-Test]|15 ms|
32+
|43|[Multiply Strings][Solutions-43]|[WindomZ][Solutions-43-Go]|Medium|[53.4 ns/op/6 test cases][Solutions-43-Test]|3 ms|
33+
|42|[Trapping Rain Water][Solutions-42]|[WindomZ][Solutions-42-Go]|Hard|[14.4 ns/op/6 test cases][Solutions-42-Test]|6 ms|
34+
|41|[First Missing Positive][Solutions-41]|[WindomZ][Solutions-41-Go]|Hard|[12.3 ns/op/6 test cases][Solutions-41-Test]|3 ms|
35+
|40|[Combination Sum II][Solutions-40]|[WindomZ][Solutions-40-Go]|Medium|[203 ns/op/3 test cases][Solutions-40-Test]|3 ms|
36+
|39|[Combination Sum][Solutions-39]|[WindomZ][Solutions-39-Go]|Medium|[165 ns/op/3 test cases][Solutions-39-Test]|6 ms|
3737
|38|[Count and Say][Solutions-38]|[WindomZ][Solutions-38-Go]|Easy|[262 ns/op/4 test cases][Solutions-38-Test]|0 ms|
3838
|37|[Sudoku Solver][Solutions-37]|[WindomZ][Solutions-37-Go]|Hard|[134573 ns/op/2 test cases][Solutions-37-Test]|0 ms|
3939
|36|[Valid Sudoku][Solutions-36]|[WindomZ][Solutions-36-Go]|Medium|[565 ns/op/3 test cases][Solutions-36-Test]|6 ms|

solutions/combination_sum/combinationSum_test.go

Lines changed: 10 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -14,9 +14,14 @@ func Test_combinationSum(t *testing.T) {
1414
}
1515

1616
func Benchmark_combinationSum(b *testing.B) {
17-
for i := 0; i < b.N; i++ {
18-
combinationSum([]int{}, 0)
19-
combinationSum([]int{7, 3}, 17)
20-
combinationSum([]int{2, 3, 6, 7}, 7)
21-
}
17+
b.StopTimer()
18+
b.ReportAllocs()
19+
b.StartTimer()
20+
b.RunParallel(func(pb *testing.PB) {
21+
for pb.Next() {
22+
combinationSum([]int{}, 0)
23+
combinationSum([]int{7, 3}, 17)
24+
combinationSum([]int{2, 3, 6, 7}, 7)
25+
}
26+
})
2227
}

solutions/combination_sum_ii/combinationSum2_test.go

Lines changed: 10 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -14,9 +14,14 @@ func Test_combinationSum2(t *testing.T) {
1414
}
1515

1616
func Benchmark_combinationSum2(b *testing.B) {
17-
for i := 0; i < b.N; i++ {
18-
combinationSum2([]int{}, 0)
19-
combinationSum2([]int{2, 3, 6, 7}, 7)
20-
combinationSum2([]int{10, 1, 2, 7, 6, 1, 5}, 8)
21-
}
17+
b.StopTimer()
18+
b.ReportAllocs()
19+
b.StartTimer()
20+
b.RunParallel(func(pb *testing.PB) {
21+
for pb.Next() {
22+
combinationSum2([]int{}, 0)
23+
combinationSum2([]int{2, 3, 6, 7}, 7)
24+
combinationSum2([]int{10, 1, 2, 7, 6, 1, 5}, 8)
25+
}
26+
})
2227
}

solutions/first_missing_positive/firstMissingPositive_test.go

Lines changed: 13 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -16,12 +16,17 @@ func Test_firstMissingPositive(t *testing.T) {
1616
}
1717

1818
func Benchmark_firstMissingPositive(b *testing.B) {
19-
for i := 0; i < b.N; i++ {
20-
firstMissingPositive([]int{})
21-
firstMissingPositive([]int{1, 2, 0})
22-
firstMissingPositive([]int{3, 4, -1, 1})
23-
firstMissingPositive([]int{3, 4, -1, 1, 2, 5})
24-
firstMissingPositive([]int{3, 4, -1, 1, 2, 5, 8, 9})
25-
firstMissingPositive([]int{6, 4, -1, -2, 2, 5, 3, 1})
26-
}
19+
b.StopTimer()
20+
b.ReportAllocs()
21+
b.StartTimer()
22+
b.RunParallel(func(pb *testing.PB) {
23+
for pb.Next() {
24+
firstMissingPositive([]int{})
25+
firstMissingPositive([]int{1, 2, 0})
26+
firstMissingPositive([]int{3, 4, -1, 1})
27+
firstMissingPositive([]int{3, 4, -1, 1, 2, 5})
28+
firstMissingPositive([]int{3, 4, -1, 1, 2, 5, 8, 9})
29+
firstMissingPositive([]int{6, 4, -1, -2, 2, 5, 3, 1})
30+
}
31+
})
2732
}

solutions/multiply_strings/multiply_test.go

Lines changed: 13 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -18,12 +18,17 @@ func Test_multiply(t *testing.T) {
1818
}
1919

2020
func Benchmark_multiply(b *testing.B) {
21-
for i := 0; i < b.N; i++ {
22-
multiply("1", "0")
23-
multiply("1", "1")
24-
multiply("10", "2")
25-
multiply("12", "23")
26-
multiply("123", "45")
27-
multiply("999", "99")
28-
}
21+
b.StopTimer()
22+
b.ReportAllocs()
23+
b.StartTimer()
24+
b.RunParallel(func(pb *testing.PB) {
25+
for pb.Next() {
26+
multiply("1", "0")
27+
multiply("1", "1")
28+
multiply("10", "2")
29+
multiply("12", "23")
30+
multiply("123", "45")
31+
multiply("999", "99")
32+
}
33+
})
2934
}

solutions/trapping_rain_water/trap_test.go

Lines changed: 13 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -16,12 +16,17 @@ func Test_trap(t *testing.T) {
1616
}
1717

1818
func Benchmark_trap(b *testing.B) {
19-
for i := 0; i < b.N; i++ {
20-
trap([]int{})
21-
trap([]int{4, 1, 0, 2, 1, 0})
22-
trap([]int{4, 4, 2, 2, 1, 3, 5})
23-
trap([]int{4, 4, 2, 2, 1, 3, 5, 5, 5})
24-
trap([]int{0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1})
25-
trap([]int{2, 1, 6, 6, 1, 1, 1, 3, 5, 1, 2, 1})
26-
}
19+
b.StopTimer()
20+
b.ReportAllocs()
21+
b.StartTimer()
22+
b.RunParallel(func(pb *testing.PB) {
23+
for pb.Next() {
24+
trap([]int{})
25+
trap([]int{4, 1, 0, 2, 1, 0})
26+
trap([]int{4, 4, 2, 2, 1, 3, 5})
27+
trap([]int{4, 4, 2, 2, 1, 3, 5, 5, 5})
28+
trap([]int{0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1})
29+
trap([]int{2, 1, 6, 6, 1, 1, 1, 3, 5, 1, 2, 1})
30+
}
31+
})
2732
}

solutions/wildcard_matching/isMatch_test.go

Lines changed: 16 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -19,15 +19,20 @@ func Test_isMatch(t *testing.T) {
1919
}
2020

2121
func Benchmark_isMatch(b *testing.B) {
22-
for i := 0; i < b.N; i++ {
23-
isMatch("", "")
24-
isMatch("aa", "a")
25-
isMatch("aa", "aa")
26-
isMatch("aaa", "aa")
27-
isMatch("aa", "*")
28-
isMatch("aa", "a*")
29-
isMatch("ab", "?*")
30-
isMatch("aab", "c*a*b")
31-
isMatch("aab", "*a*b**")
32-
}
22+
b.StopTimer()
23+
b.ReportAllocs()
24+
b.StartTimer()
25+
b.RunParallel(func(pb *testing.PB) {
26+
for pb.Next() {
27+
isMatch("", "")
28+
isMatch("aa", "a")
29+
isMatch("aa", "aa")
30+
isMatch("aaa", "aa")
31+
isMatch("aa", "*")
32+
isMatch("aa", "a*")
33+
isMatch("ab", "?*")
34+
isMatch("aab", "c*a*b")
35+
isMatch("aab", "*a*b**")
36+
}
37+
})
3338
}

0 commit comments

Comments
 (0)