go mod support.

go.mod

@@ -0,0 +1,3 @@
+module github.com/zwfang/leetcode
+
+go 1.12

src/0004_median_of_two_sorted_arrays/motsa.go

@@ -12,7 +12,7 @@ You may assume nums1 and nums2 cannot be both empty.
 
 package motsa
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // binary search
 // time complexity: O(log(m+n)), where m is nums1's length, n is nums2's length.

src/0011_container_with_most_water/container_with_most_water.go

@@ -14,7 +14,7 @@ Note: You may not slant the container and n is at least 2.
 
 package containerwithmostwater
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // time complexity: O(n)
 // space complexity: O(1)

src/0076_minimum_window_substring/minimum_window_substring.go

@@ -15,7 +15,7 @@ Note:
 
 package minimumwindowsubstring
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 /*
 使用滑动窗口解决这一问题，使用map或者slice统计T字符串中的字母的个数，之后，开始遍历S字符串，对于S中遍历到

src/0111_minimum_depth_of_binary_tree/minimum_depth_of_binary_tree.go

@@ -12,7 +12,7 @@ Note: A leaf is a node with no children.
 
 package minimumdepthofbinarytree
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // TreeNode binary tree node.
 type TreeNode struct {

src/0120_triangle/triangle.go

@@ -8,7 +8,7 @@ Given a triangle, find the minimum path sum from top to bottom. Each step you ma
 
 package triangle
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // dfs
 /*

src/0198_house_robber/house_robber.go

@@ -26,7 +26,7 @@ Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (m
 
 package houserobber
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 /*
 func rob(nums []int) int {

src/0300_longest_increasing_subsequence/lis.go

@@ -20,7 +20,7 @@ Follow up:
 
 package lis
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // Dynamic Programming
 // TIme complexity: O(n^2)

src/0343_integer_break/integer_break.go

@@ -19,7 +19,7 @@ Note: You may assume that n is not less than 2 and not larger than 58.
 
 package integerbreak
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // recursion
 /*

src/0349_intersection_of_2_arrays/intersection_of_two_arrays.go

@@ -20,7 +20,7 @@ Note:
 
 package intersectionof2arrays
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 func intersection(nums1 []int, nums2 []int) []int {
 	set1 := utils.NewSet()

src/0376_wiggle_subsequence/wiggle_subsequence.go

@@ -29,7 +29,7 @@ Can you do it in O(n) time?
 
 package wigglesubsequence
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 /*
  * 用up[i]和down[i]分别记录到第i个元素为止以上升沿和下降沿结束的最长“摆动”

src/0435_non_overlapping_intervals/dp_solution.go

@@ -12,7 +12,7 @@ Note:
 package nonoverlappingintervals
 
 import (
-	"leetcode/utils"
+	"github.com/zwfang/leetcode/utils"
 	"sort"
 )
 

src/0747_largest_number_at_least_twice_of_others/largest_number_at_least_twice_of_others.go

@@ -34,7 +34,7 @@ Note:
 
 package largestnumberatleasttwiceofothers
 
-import "leetcode/utils"
+import "github.com/zwfang/leetcode/utils"
 
 // Time complexity: O(n)
 // Space complexity: O(1)