style(algorithms): pass golint

Author: WindomZ

algorithms/3sum/threeSum.go

@@ -1,4 +1,4 @@
-package three_sum
+package threesum
 
 import "sort"
 

algorithms/3sum/threeSum_test.go

@@ -1,4 +1,4 @@
-package three_sum
+package threesum
 
 import (
 	"testing"

algorithms/3sum_closest/threeSumClosest.go

@@ -1,4 +1,4 @@
-package three_sum_closest
+package threesumclosest
 
 import "sort"
 

algorithms/3sum_closest/threeSumClosest_test.go

@@ -1,4 +1,4 @@
-package three_sum_closest
+package threesumclosest
 
 import (
 	"testing"

algorithms/4sum/fourSum.go

@@ -1,4 +1,4 @@
-package four_sum
+package foursum
 
 import "sort"
 

algorithms/4sum/fourSum_test.go

@@ -1,4 +1,4 @@
-package four_sum
+package foursum
 
 import (
 	"testing"

algorithms/add_two_numbers/addTwoNumbers.go

@@ -1,4 +1,4 @@
-package add_two_numbers
+package addtwonumbers
 
 // ListNode definition for singly-linked list.
 type ListNode struct {

algorithms/add_two_numbers/addTwoNumbers_test.go

@@ -1,4 +1,4 @@
-package add_two_numbers
+package addtwonumbers
 
 import (
 	"testing"

algorithms/container_with_most_water/maxArea.go

@@ -1,4 +1,4 @@
-package container_with_most_water
+package containerwithmostwater
 
 func maxArea(height []int) int {
 	if hs := len(height); hs >= 2 {

algorithms/container_with_most_water/maxArea_test.go

@@ -1,4 +1,4 @@
-package container_with_most_water
+package containerwithmostwater
 
 import (
 	"testing"

algorithms/divide_two_integers/divide.go

@@ -1,4 +1,4 @@
-package divide_two_integers
+package dividetwointegers
 
 import "math"
 

algorithms/divide_two_integers/divide_test.go

@@ -1,4 +1,4 @@
-package divide_two_integers
+package dividetwointegers
 
 import (
 	"math"

algorithms/generate_parentheses/generateParenthesis.go

@@ -1,4 +1,4 @@
-package generate_parentheses
+package generateparentheses
 
 func generateParenthesis(n int) []string {
 	if n >= 1 {

algorithms/generate_parentheses/generateParenthesis_test.go

@@ -1,4 +1,4 @@
-package generate_parentheses
+package generateparentheses
 
 import (
 	"testing"

algorithms/implement_strstr/strStr.go

@@ -1,4 +1,4 @@
-package implement_strstr
+package implementstrstr
 
 func strStr(haystack string, needle string) int {
 	if hl, nl := len(haystack), len(needle); nl == 0 {

algorithms/implement_strstr/strStr_test.go

@@ -1,4 +1,4 @@
-package implement_strstr
+package implementstrstr
 
 import (
 	"testing"

algorithms/integer_to_roman/intToRoman.go

@@ -1,20 +1,20 @@
-package integer_to_roman
+package integertoroman
 
 var (
-	M = [4]string{"", "M", "MM", "MMM"}
-	C = [10]string{"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}
-	X = [10]string{"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}
-	I = [10]string{"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}
+	m = [4]string{"", "m", "MM", "MMM"}
+	c = [10]string{"", "c", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}
+	x = [10]string{"", "x", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}
+	i = [10]string{"", "i", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"}
 )
 
 func intToRoman(num int) string {
 	if num >= 1 && num <= 3999 {
 		if num >= 1000 {
-			return M[num/1000] + C[(num%1000)/100] + X[(num%100)/10] + I[num%10]
+			return m[num/1000] + c[(num%1000)/100] + x[(num%100)/10] + i[num%10]
 		} else if num >= 100 {
-			return C[num/100] + X[(num%100)/10] + I[num%10]
+			return c[num/100] + x[(num%100)/10] + i[num%10]
 		}
-		return X[(num%100)/10] + I[num%10]
+		return x[(num%100)/10] + i[num%10]
 	}
 	return ""
 }

algorithms/integer_to_roman/intToRoman_test.go

@@ -1,4 +1,4 @@
-package integer_to_roman
+package integertoroman
 
 import (
 	"testing"

algorithms/letter_combinations_of_a_phone_number/letterCombinations.go

@@ -1,6 +1,6 @@
-package letter_combinations_of_a_phone_number
+package lettercombinationsofaphonenumber
 
-var charsmap [10]string = [10]string{"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}
+var charsmap = [10]string{"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}
 
 func letterCombinations(digits string) []string {
 	if len(digits) == 0 {

algorithms/letter_combinations_of_a_phone_number/letterCombinations_test.go

@@ -1,4 +1,4 @@
-package letter_combinations_of_a_phone_number
+package lettercombinationsofaphonenumber
 
 import (
 	"testing"

algorithms/longest_common_prefix/longestCommonPrefix.go

@@ -1,4 +1,4 @@
-package longest_common_prefix
+package longestcommonprefix
 
 func longestCommonPrefix(strs []string) string {
 	if len(strs) >= 1 {

algorithms/longest_common_prefix/longestCommonPrefix_test.go

@@ -1,4 +1,4 @@
-package longest_common_prefix
+package longestcommonprefix
 
 import (
 	"testing"

algorithms/longest_palindromic_substring/longestPalindrome.go

@@ -1,4 +1,4 @@
-package longest_palindromic_substring
+package longestpalindromicsubstring
 
 func longestPalindrome(s string) string {
 	if ls := len(s) - 1; ls >= 0 {

algorithms/longest_palindromic_substring/longestPalindrome_test.go

@@ -1,4 +1,4 @@
-package longest_palindromic_substring
+package longestpalindromicsubstring
 
 import (
 	"testing"

algorithms/longest_substring_without_repeating_characters/lengthOfLongestSubstring.go

@@ -1,4 +1,4 @@
-package longest_substring_without_repeating_characters
+package longestsubstringwithoutrepeatingcharacters
 
 func lengthOfLongestSubstring(s string) int {
 	if n := len(s); n >= 1 {

algorithms/longest_substring_without_repeating_characters/lengthOfLongestSubstring_test.go

@@ -1,4 +1,4 @@
-package longest_substring_without_repeating_characters
+package longestsubstringwithoutrepeatingcharacters
 
 import (
 	"testing"

algorithms/median_of_two_sorted_arrays/findMedianSortedArrays.go

@@ -1,4 +1,4 @@
-package median_of_two_sorted_arrays
+package medianoftwosortedarrays
 
 import "math"
 
@@ -16,7 +16,7 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {
 	odd := size%2 != 0 // bool, if size is odd.
 	offset := size / 2 // middle index.
 	if !odd {
-		offset -= 1 // middle index if size is even.
+		offset-- // middle index if size is even.
 	}
 
 	var n1, n2 int

algorithms/median_of_two_sorted_arrays/findMedianSortedArrays_test.go

@@ -1,4 +1,4 @@
-package median_of_two_sorted_arrays
+package medianoftwosortedarrays
 
 import (
 	"testing"

algorithms/merge_k_sorted_lists/mergeKLists.go

@@ -1,4 +1,4 @@
-package merge_k_sorted_lists
+package mergeksortedlists
 
 // ListNode definition for singly-linked list.
 type ListNode struct {

algorithms/merge_k_sorted_lists/mergeKLists_test.go

@@ -1,4 +1,4 @@
-package merge_k_sorted_lists
+package mergeksortedlists
 
 import (
 	"testing"

algorithms/merge_two_sorted_lists/mergeTwoLists.go

@@ -1,4 +1,4 @@
-package merge_two_sorted_lists
+package mergetwosortedlists
 
 // ListNode definition for singly-linked list.
 type ListNode struct {

algorithms/merge_two_sorted_lists/mergeTwoLists_test.go

@@ -1,4 +1,4 @@
-package merge_two_sorted_lists
+package mergetwosortedlists
 
 import (
 	"testing"

algorithms/palindrome_number/isPalindrome.go

@@ -1,4 +1,4 @@
-package palindrome_number
+package palindromenumber
 
 func isPalindrome(x int) bool {
 	if x <= -1 {

algorithms/palindrome_number/isPalindrome_test.go

@@ -1,4 +1,4 @@
-package palindrome_number
+package palindromenumber
 
 import (
 	"testing"

algorithms/regular_expression_matching/isMatch.go

@@ -1,4 +1,4 @@
-package regular_expression_matching
+package regularexpressionmatching
 
 func isMatch(s string, p string) bool {
 	if s != p {

algorithms/regular_expression_matching/isMatch_test.go

@@ -1,4 +1,4 @@
-package regular_expression_matching
+package regularexpressionmatching
 
 import (
 	"testing"

algorithms/remove_duplicates_from_sorted_array/removeDuplicates.go

@@ -1,4 +1,4 @@
-package remove_duplicates_from_sorted_array
+package removeduplicatesfromsortedarray
 
 func removeDuplicates(nums []int) int {
 	if len(nums) >= 2 {

algorithms/remove_duplicates_from_sorted_array/removeDuplicates_test.go

@@ -1,4 +1,4 @@
-package remove_duplicates_from_sorted_array
+package removeduplicatesfromsortedarray
 
 import (
 	"testing"

algorithms/remove_element/removeElement.go

@@ -1,4 +1,4 @@
-package remove_element
+package removeelement
 
 func removeElement(nums []int, val int) int {
 	length := 0

algorithms/remove_element/removeElement_test.go

@@ -1,4 +1,4 @@
-package remove_element
+package removeelement
 
 import (
 	"testing"

algorithms/remove_nth_node_from_end_of_list/removeNthFromEnd.go

@@ -1,4 +1,4 @@
-package remove_nth_node_from_end_of_list
+package removenthnodefromendoflist
 
 // ListNode definition for singly-linked list.
 type ListNode struct {

algorithms/remove_nth_node_from_end_of_list/removeNthFromEnd_test.go

@@ -1,4 +1,4 @@
-package remove_nth_node_from_end_of_list
+package removenthnodefromendoflist
 
 import (
 	"testing"

algorithms/reverse_integer/reverse.go

@@ -1,4 +1,4 @@
-package reverse_integer
+package reverseinteger
 
 import "math"
 

algorithms/reverse_integer/reverse_test.go

@@ -1,4 +1,4 @@
-package reverse_integer
+package reverseinteger
 
 import (
 	"math"

algorithms/reverse_nodes_in_k_group/reverseKGroup.go

@@ -1,4 +1,4 @@
-package reverse_nodes_in_k_group
+package reversenodesinkgroup
 
 // ListNode definition for singly-linked list.
 type ListNode struct {

algorithms/reverse_nodes_in_k_group/reverseKGroup_test.go

@@ -1,4 +1,4 @@
-package reverse_nodes_in_k_group
+package reversenodesinkgroup
 
 import (
 	"testing"

algorithms/roman_to_integer/romanToInt.go

@@ -1,4 +1,4 @@
-package roman_to_integer
+package romantointeger
 
 func romanToInt(s string) int {
 	if l := len(s); l >= 1 {
@@ -24,7 +24,7 @@ func romanToInt(s string) int {
 				result += 5
 				current = 2
 			default: // 'I'
-				result += 1
+				result++
 				current = 1
 			}
 			if last != 0 && last < current {

algorithms/roman_to_integer/romanToInt_test.go

@@ -1,4 +1,4 @@
-package roman_to_integer
+package romantointeger
 
 import (
 	"testing"

algorithms/string_to_integer_atoi/myAtoi.go

@@ -1,4 +1,4 @@
-package string_to_integer_atoi
+package stringtointegeratoi
 
 import "math"
 

algorithms/string_to_integer_atoi/myAtoi_test.go

@@ -1,4 +1,4 @@
-package string_to_integer_atoi
+package stringtointegeratoi
 
 import (
 	"testing"