test: 19 cases run parallel

WindomZ · WindomZ · commit 3cd46fece4c1 · 2017-09-17T16:18:50.000+08:00
diff --git a/README.md b/README.md
@@ -55,25 +55,25 @@
 |22|[Generate Parentheses][Solutions-22]|[WindomZ][Solutions-22-Go]|Medium|[340 ns/op/4 test cases][Solutions-22-Test]|13 ms|
 |21|[Merge Two Sorted Lists][Solutions-21]|[WindomZ][Solutions-21-Go]|Easy|[89.0 ns/op/3 test cases][Solutions-21-Test]|3 ms|
 |20|[Valid Parentheses][Solutions-20]|[WindomZ][Solutions-20-Go]|Easy|[28.9 ns/op/6 test cases][Solutions-20-Test]|0 ms|
-|19|[Remove Nth Node From End of List][Solutions-19]|[WindomZ][Solutions-19-Go]|Medium|[0.00 ns/op/6 test cases][Solutions-19-Test]|3 ms|
-|18|[4Sum][Solutions-18]|[WindomZ][Solutions-18-Go]|Medium|[796 ns/op/3 test cases][Solutions-18-Test]|16 ms|
-|17|[Letter Combinations of a Phone Number][Solutions-17]|[WindomZ][Solutions-17-Go]|Medium|[1466 ns/op/4 test cases][Solutions-17-Test]|0 ms|
-|16|[3Sum Closest][Solutions-16]|[WindomZ][Solutions-16-Go]|Medium|[1426 ns/op/8 test cases][Solutions-16-Test]|9 ms|
-|15|[3Sum][Solutions-15]|[WindomZ][Solutions-15-Go]|Medium|[614 ns/op/4 test cases][Solutions-15-Test]|1525 ms|
-|14|[Longest Common Prefix][Solutions-14]|[WindomZ][Solutions-14-Go]|Easy|[45.8 ns/op/8 test cases][Solutions-14-Test]|3 ms|
-|13|[Roman to Integer][Solutions-13]|[WindomZ][Solutions-13-Go]|Easy|[101 ns/op/8 test cases][Solutions-13-Test]|19 ms|
-|12|[Integer to Roman][Solutions-12]|[WindomZ][Solutions-12-Go]|Medium|[96.6 ns/op/8 test cases][Solutions-12-Test]|22 ms|
-|11|[Container With Most Water][Solutions-11]|[WindomZ][Solutions-11-Go]|Medium|[38.0 ns/op/5 test cases][Solutions-11-Test]|25 ms|
-|10|[Regular Expression Matching][Solutions-10]|[WindomZ][Solutions-10-Go]|Hard|[630 ns/op/6 test cases][Solutions-10-Test]|3 ms|
-|9|[Palindrome Number][Solutions-9]|[WindomZ][Solutions-9-Go]|Easy|[27.3 ns/op/7 test cases][Solutions-9-Test]|55 ms|
-|8|[String to Integer (atoi)][Solutions-8]|[WindomZ][Solutions-8-Go]|Medium|[33.4 ns/op/5 test cases][Solutions-8-Test]|3 ms|
-|7|[Reverse Integer][Solutions-7]|[WindomZ][Solutions-7-Go]|Easy|[39.3 ns/op/5 test cases][Solutions-7-Test]|3 ms|
-|6|[ZigZag Conversion][Solutions-6]|[WindomZ][Solutions-6-Go]|Medium|[205 ns/op/5 test cases][Solutions-6-Test]|9 ms|
-|5|[Longest Palindromic Substring][Solutions-5]|[WindomZ][Solutions-5-Go]|Medium|[151 ns/op/6 test cases][Solutions-5-Test]|9 ms|
-|4|[Median of Two Sorted Arrays][Solutions-4]|[WindomZ][Solutions-4-Go]|Hard|[74.3 ns/op/14 test cases][Solutions-4-Test]|32 ms|
-|3|[Longest Substring Without Repeating Characters][Solutions-3]|[WindomZ][Solutions-3-Go]|Medium|[103 ns/op/3 test cases][Solutions-3-Test]|6 ms|
-|2|[Add Two Numbers][Solutions-2]|[WindomZ][Solutions-2-Go]|Medium|[79.4 ns/op/1 test cases][Solutions-2-Test]|29 ms|
-|1|[Two Sum][Solutions-1]|[WindomZ][Solutions-1-Go]|Easy|[305 ns/op/3 test cases][Solutions-1-Test]|6 ms|
+|19|[Remove Nth Node From End of List][Solutions-19]|[WindomZ][Solutions-19-Go]|Medium|[97.3 ns/op/6 test cases][Solutions-19-Test]|3 ms|
+|18|[4Sum][Solutions-18]|[WindomZ][Solutions-18-Go]|Medium|[233 ns/op/3 test cases][Solutions-18-Test]|16 ms|
+|17|[Letter Combinations of a Phone Number][Solutions-17]|[WindomZ][Solutions-17-Go]|Medium|[407 ns/op/4 test cases][Solutions-17-Test]|0 ms|
+|16|[3Sum Closest][Solutions-16]|[WindomZ][Solutions-16-Go]|Medium|[379 ns/op/8 test cases][Solutions-16-Test]|9 ms|
+|15|[3Sum][Solutions-15]|[WindomZ][Solutions-15-Go]|Medium|[183 ns/op/4 test cases][Solutions-15-Test]|1525 ms|
+|14|[Longest Common Prefix][Solutions-14]|[WindomZ][Solutions-14-Go]|Easy|[10.6 ns/op/8 test cases][Solutions-14-Test]|3 ms|
+|13|[Roman to Integer][Solutions-13]|[WindomZ][Solutions-13-Go]|Easy|[16.9 ns/op/8 test cases][Solutions-13-Test]|19 ms|
+|12|[Integer to Roman][Solutions-12]|[WindomZ][Solutions-12-Go]|Medium|[26.4 ns/op/8 test cases][Solutions-12-Test]|22 ms|
+|11|[Container With Most Water][Solutions-11]|[WindomZ][Solutions-11-Go]|Medium|[7.84 ns/op/5 test cases][Solutions-11-Test]|25 ms|
+|10|[Regular Expression Matching][Solutions-10]|[WindomZ][Solutions-10-Go]|Hard|[183 ns/op/6 test cases][Solutions-10-Test]|3 ms|
+|9|[Palindrome Number][Solutions-9]|[WindomZ][Solutions-9-Go]|Easy|[6.37 ns/op/7 test cases][Solutions-9-Test]|55 ms|
+|8|[String to Integer (atoi)][Solutions-8]|[WindomZ][Solutions-8-Go]|Medium|[7.31 ns/op/5 test cases][Solutions-8-Test]|3 ms|
+|7|[Reverse Integer][Solutions-7]|[WindomZ][Solutions-7-Go]|Easy|[9.00 ns/op/5 test cases][Solutions-7-Test]|3 ms|
+|6|[ZigZag Conversion][Solutions-6]|[WindomZ][Solutions-6-Go]|Medium|[55.1 ns/op/5 test cases][Solutions-6-Test]|9 ms|
+|5|[Longest Palindromic Substring][Solutions-5]|[WindomZ][Solutions-5-Go]|Medium|[39.1 ns/op/6 test cases][Solutions-5-Test]|9 ms|
+|4|[Median of Two Sorted Arrays][Solutions-4]|[WindomZ][Solutions-4-Go]|Hard|[19.4 ns/op/14 test cases][Solutions-4-Test]|32 ms|
+|3|[Longest Substring Without Repeating Characters][Solutions-3]|[WindomZ][Solutions-3-Go]|Medium|[21.3 ns/op/3 test cases][Solutions-3-Test]|6 ms|
+|2|[Add Two Numbers][Solutions-2]|[WindomZ][Solutions-2-Go]|Medium|[19.4 ns/op/1 test cases][Solutions-2-Test]|29 ms|
+|1|[Two Sum][Solutions-1]|[WindomZ][Solutions-1-Go]|Easy|[79.5 ns/op/3 test cases][Solutions-1-Test]|6 ms|
 
 > **NOTE**: 'Single Repetition Duration' and 'LeetCode Run Time' are for _reference_ only.
 
diff --git a/solutions/3sum/threeSum_test.go b/solutions/3sum/threeSum_test.go
@@ -18,10 +18,15 @@ func Test_threeSum(t *testing.T) {
 }
 
 func Benchmark_threeSum(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		threeSum([]int{})
-		threeSum([]int{1, 3, -4})
-		threeSum([]int{0, 0, 0, 0})
-		threeSum([]int{-1, 0, 1, 2, -1, -4})
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			threeSum([]int{})
+			threeSum([]int{1, 3, -4})
+			threeSum([]int{0, 0, 0, 0})
+			threeSum([]int{-1, 0, 1, 2, -1, -4})
+		}
+	})
 }
diff --git a/solutions/3sum_closest/threeSumClosest_test.go b/solutions/3sum_closest/threeSumClosest_test.go
@@ -18,14 +18,19 @@ func Test_threeSumClosest(t *testing.T) {
 }
 
 func Benchmark_threeSumClosest(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		threeSumClosest([]int{}, 0)
-		threeSumClosest([]int{0, 0, 0}, 1)
-		threeSumClosest([]int{-1, 2, 1, -4}, 5)
-		threeSumClosest([]int{-1, 2, 1, -4, 5, 8}, -5)
-		threeSumClosest([]int{-1, 2, 1, -4, 5, -8, 9}, 11)
-		threeSumClosest([]int{-1, 2, 1, -4, 2, -8, 9, 10, 9}, 25)
-		threeSumClosest([]int{-1, 2, 1, -4, 5, -8, -7, 9, 10, 9}, -20)
-		threeSumClosest([]int{-55, -24, -18, -11, -7, -3, 4, 5, 6, 9, 11, 23, 33}, 0)
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			threeSumClosest([]int{}, 0)
+			threeSumClosest([]int{0, 0, 0}, 1)
+			threeSumClosest([]int{-1, 2, 1, -4}, 5)
+			threeSumClosest([]int{-1, 2, 1, -4, 5, 8}, -5)
+			threeSumClosest([]int{-1, 2, 1, -4, 5, -8, 9}, 11)
+			threeSumClosest([]int{-1, 2, 1, -4, 2, -8, 9, 10, 9}, 25)
+			threeSumClosest([]int{-1, 2, 1, -4, 5, -8, -7, 9, 10, 9}, -20)
+			threeSumClosest([]int{-55, -24, -18, -11, -7, -3, 4, 5, 6, 9, 11, 23, 33}, 0)
+		}
+	})
 }
diff --git a/solutions/4sum/fourSum_test.go b/solutions/4sum/fourSum_test.go
@@ -26,9 +26,14 @@ func Test_fourSum(t *testing.T) {
 }
 
 func Benchmark_fourSum(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		fourSum([]int{}, 0)
-		fourSum([]int{1, 0, -1, 0, -2, 2}, 0)
-		fourSum([]int{1, 0, -1, 0, -2, 2, -3, 3}, 0)
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			fourSum([]int{}, 0)
+			fourSum([]int{1, 0, -1, 0, -2, 2}, 0)
+			fourSum([]int{1, 0, -1, 0, -2, 2, -3, 3}, 0)
+		}
+	})
 }
diff --git a/solutions/add_two_numbers/addTwoNumbers_test.go b/solutions/add_two_numbers/addTwoNumbers_test.go
@@ -134,7 +134,12 @@ func Benchmark_addTwoNumbers(b *testing.B) {
 			},
 		},
 	}
-	for i := 0; i < b.N; i++ {
-		addTwoNumbers(l1, l2)
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			addTwoNumbers(l1, l2)
+		}
+	})
 }
diff --git a/solutions/container_with_most_water/maxArea_test.go b/solutions/container_with_most_water/maxArea_test.go
@@ -19,11 +19,16 @@ func Test_maxArea(t *testing.T) {
 }
 
 func Benchmark_maxArea(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		maxArea([]int{})
-		maxArea([]int{1, 2, 3})
-		maxArea([]int{5, 4, 3, 2, 1})
-		maxArea([]int{1, 2, 3, 4, 5, 6, 7})
-		maxArea([]int{8, 1, 7, 2, 6, 3, 5, 4})
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			maxArea([]int{})
+			maxArea([]int{1, 2, 3})
+			maxArea([]int{5, 4, 3, 2, 1})
+			maxArea([]int{1, 2, 3, 4, 5, 6, 7})
+			maxArea([]int{8, 1, 7, 2, 6, 3, 5, 4})
+		}
+	})
 }
diff --git a/solutions/integer_to_roman/intToRoman_test.go b/solutions/integer_to_roman/intToRoman_test.go
@@ -20,14 +20,19 @@ func Test_intToRoman(t *testing.T) {
 }
 
 func Benchmark_intToRoman(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		intToRoman(0)
-		intToRoman(9)
-		intToRoman(10)
-		intToRoman(99)
-		intToRoman(100)
-		intToRoman(999)
-		intToRoman(1000)
-		intToRoman(3999)
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			intToRoman(0)
+			intToRoman(9)
+			intToRoman(10)
+			intToRoman(99)
+			intToRoman(100)
+			intToRoman(999)
+			intToRoman(1000)
+			intToRoman(3999)
+		}
+	})
 }
diff --git a/solutions/letter_combinations_of_a_phone_number/letterCombinations_test.go b/solutions/letter_combinations_of_a_phone_number/letterCombinations_test.go
@@ -25,10 +25,15 @@ func Test_letterCombinations(t *testing.T) {
 }
 
 func Benchmark_letterCombinations(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		letterCombinations("")
-		letterCombinations("01")
-		letterCombinations("24")
-		letterCombinations("159")
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			letterCombinations("")
+			letterCombinations("01")
+			letterCombinations("24")
+			letterCombinations("159")
+		}
+	})
 }
diff --git a/solutions/longest_common_prefix/longestCommonPrefix_test.go b/solutions/longest_common_prefix/longestCommonPrefix_test.go
@@ -17,14 +17,19 @@ func Test_longestCommonPrefix(t *testing.T) {
 }
 
 func Benchmark_longestCommonPrefix(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		longestCommonPrefix([]string{})
-		longestCommonPrefix([]string{"", "acb"})
-		longestCommonPrefix([]string{"abc", "cba"})
-		longestCommonPrefix([]string{"abc", "acb"})
-		longestCommonPrefix([]string{"abc", "abd"})
-		longestCommonPrefix([]string{"abcd", "abce", "abde"})
-		longestCommonPrefix([]string{"abcd", "abce", "bdea", "abde"})
-		longestCommonPrefix([]string{"abcd", "abcde", "abcdef", "abcefg"})
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			longestCommonPrefix([]string{})
+			longestCommonPrefix([]string{"", "acb"})
+			longestCommonPrefix([]string{"abc", "cba"})
+			longestCommonPrefix([]string{"abc", "acb"})
+			longestCommonPrefix([]string{"abc", "abd"})
+			longestCommonPrefix([]string{"abcd", "abce", "abde"})
+			longestCommonPrefix([]string{"abcd", "abce", "bdea", "abde"})
+			longestCommonPrefix([]string{"abcd", "abcde", "abcdef", "abcefg"})
+		}
+	})
 }
diff --git a/solutions/longest_palindromic_substring/longestPalindrome_test.go b/solutions/longest_palindromic_substring/longestPalindrome_test.go
@@ -16,12 +16,17 @@ func Test_longestPalindrome(t *testing.T) {
 }
 
 func Benchmark_longestPalindrome(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		longestPalindrome("")
-		longestPalindrome("a")
-		longestPalindrome("abcda")
-		longestPalindrome("babad")
-		longestPalindrome("cbbd")
-		longestPalindrome("abacdfgdcaba")
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			longestPalindrome("")
+			longestPalindrome("a")
+			longestPalindrome("abcda")
+			longestPalindrome("babad")
+			longestPalindrome("cbbd")
+			longestPalindrome("abacdfgdcaba")
+		}
+	})
 }
diff --git a/solutions/longest_substring_without_repeating_characters/lengthOfLongestSubstring_test.go b/solutions/longest_substring_without_repeating_characters/lengthOfLongestSubstring_test.go
@@ -14,9 +14,14 @@ func Test_lengthOfLongestSubstring(t *testing.T) {
 }
 
 func Benchmark_lengthOfLongestSubstring(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		lengthOfLongestSubstring("abcabcbb")
-		lengthOfLongestSubstring("bbbbb")
-		lengthOfLongestSubstring("pwwkew")
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			lengthOfLongestSubstring("abcabcbb")
+			lengthOfLongestSubstring("bbbbb")
+			lengthOfLongestSubstring("pwwkew")
+		}
+	})
 }
diff --git a/solutions/median_of_two_sorted_arrays/findMedianSortedArrays_test.go b/solutions/median_of_two_sorted_arrays/findMedianSortedArrays_test.go
@@ -69,20 +69,25 @@ func Test_findMedianSortedArrays(t *testing.T) {
 }
 
 func Benchmark_findMedianSortedArrays(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		findMedianSortedArrays([]int{1}, []int{2, 3, 4})
-		findMedianSortedArrays([]int{2}, []int{1, 3, 4})
-		findMedianSortedArrays([]int{3}, []int{1, 2, 4})
-		findMedianSortedArrays([]int{4}, []int{1, 2, 3})
-		findMedianSortedArrays([]int{1, 2}, []int{3, 4})
-		findMedianSortedArrays([]int{1, 3}, []int{2, 4})
-		findMedianSortedArrays([]int{1, 4}, []int{2, 3})
-		findMedianSortedArrays([]int{2, 3}, []int{1, 4})
-		findMedianSortedArrays([]int{2, 4}, []int{1, 3})
-		findMedianSortedArrays([]int{3, 4}, []int{1, 2})
-		findMedianSortedArrays([]int{1, 2, 3}, []int{4})
-		findMedianSortedArrays([]int{1, 2, 4}, []int{3})
-		findMedianSortedArrays([]int{1, 3, 4}, []int{2})
-		findMedianSortedArrays([]int{2, 3, 4}, []int{1})
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			findMedianSortedArrays([]int{1}, []int{2, 3, 4})
+			findMedianSortedArrays([]int{2}, []int{1, 3, 4})
+			findMedianSortedArrays([]int{3}, []int{1, 2, 4})
+			findMedianSortedArrays([]int{4}, []int{1, 2, 3})
+			findMedianSortedArrays([]int{1, 2}, []int{3, 4})
+			findMedianSortedArrays([]int{1, 3}, []int{2, 4})
+			findMedianSortedArrays([]int{1, 4}, []int{2, 3})
+			findMedianSortedArrays([]int{2, 3}, []int{1, 4})
+			findMedianSortedArrays([]int{2, 4}, []int{1, 3})
+			findMedianSortedArrays([]int{3, 4}, []int{1, 2})
+			findMedianSortedArrays([]int{1, 2, 3}, []int{4})
+			findMedianSortedArrays([]int{1, 2, 4}, []int{3})
+			findMedianSortedArrays([]int{1, 3, 4}, []int{2})
+			findMedianSortedArrays([]int{2, 3, 4}, []int{1})
+		}
+	})
 }
diff --git a/solutions/palindrome_number/isPalindrome_test.go b/solutions/palindrome_number/isPalindrome_test.go
@@ -18,13 +18,18 @@ func Test_isPalindrome(t *testing.T) {
 }
 
 func Benchmark_isPalindrome(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		isPalindrome(-1)
-		isPalindrome(5)
-		isPalindrome(10)
-		isPalindrome(121)
-		isPalindrome(1210)
-		isPalindrome(123454321)
-		isPalindrome(123456764321)
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			isPalindrome(-1)
+			isPalindrome(5)
+			isPalindrome(10)
+			isPalindrome(121)
+			isPalindrome(1210)
+			isPalindrome(123454321)
+			isPalindrome(123456764321)
+		}
+	})
 }
diff --git a/solutions/regular_expression_matching/isMatch_test.go b/solutions/regular_expression_matching/isMatch_test.go
@@ -38,12 +38,17 @@ func Test_isMatch(t *testing.T) {
 }
 
 func Benchmark_isMatch(b *testing.B) {
-	for i := 0; i < b.N; i++ {
-		isMatch("", "")
-		isMatch("aa", "aa")
-		isMatch("aa", "a.")
-		isMatch("ab", ".*")
-		isMatch("aab", "c*a*b")
-		isMatch("acdefgb", "a.*b")
-	}
+	b.StopTimer()
+	b.ReportAllocs()
+	b.StartTimer()
+	b.RunParallel(func(pb *testing.PB) {
+		for pb.Next() {
+			isMatch("", "")
+			isMatch("aa", "aa")
+			isMatch("aa", "a.")
+			isMatch("ab", ".*")
+			isMatch("aab", "c*a*b")
+			isMatch("acdefgb", "a.*b")
+		}
+	})
 }
diff --git a/solutions/remove_nth_node_from_end_of_list/removeNthFromEnd_test.go b/solutions/remove_nth_node_from_end_of_list/removeNthFromEnd_test.go
diff --git a/solutions/reverse_integer/reverse_test.go b/solutions/reverse_integer/reverse_test.go
diff --git a/solutions/roman_to_integer/romanToInt_test.go b/solutions/roman_to_integer/romanToInt_test.go
diff --git a/solutions/string_to_integer_atoi/myAtoi_test.go b/solutions/string_to_integer_atoi/myAtoi_test.go
diff --git a/solutions/two_sum/twoSum_test.go b/solutions/two_sum/twoSum_test.go
diff --git a/solutions/zigzag_conversion/convert_test.go b/solutions/zigzag_conversion/convert_test.go
