Revert "go mod support."

zwfang · zwfang · commit 3e92a32f7adc · 2019-06-12T10:24:08.000+08:00
This reverts commit 6d34346.
diff --git a/go.mod b/go.mod
diff --git a/src/0004_median_of_two_sorted_arrays/motsa.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // binary search
 // time complexity: O(log(m+n)), where m is nums1's length, n is nums2's length.
diff --git a/src/0011_container_with_most_water/container_with_most_water.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // time complexity: O(n)
 // space complexity: O(1)
diff --git a/src/0076_minimum_window_substring/minimum_window_substring.go b/src/0076_minimum_window_substring/minimum_window_substring.go
@@ -15,7 +15,7 @@ Note:
 
 package minimumwindowsubstring
 
-import ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 /*
 使用滑动窗口解决这一问题，使用map或者slice统计T字符串中的字母的个数，之后，开始遍历S字符串，对于S中遍历到
diff --git a/src/0111_minimum_depth_of_binary_tree/minimum_depth_of_binary_tree.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // TreeNode binary tree node.
 type TreeNode struct {
diff --git a/src/0120_triangle/triangle.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // dfs
 /*
diff --git a/src/0198_house_robber/house_robber.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 /*
 func rob(nums []int) int {
diff --git a/src/0300_longest_increasing_subsequence/lis.go b/src/0300_longest_increasing_subsequence/lis.go
@@ -20,7 +20,7 @@ Follow up:
 
 package lis
 
-import ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // Dynamic Programming
 // TIme complexity: O(n^2)
diff --git a/src/0343_integer_break/integer_break.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // recursion
 /*
diff --git a/src/0349_intersection_of_2_arrays/intersection_of_two_arrays.go b/src/0349_intersection_of_2_arrays/intersection_of_two_arrays.go
@@ -20,7 +20,7 @@ Note:
 
 package intersectionof2arrays
 
-import ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 func intersection(nums1 []int, nums2 []int) []int {
 	set1 := utils.NewSet()
diff --git a/src/0376_wiggle_subsequence/wiggle_subsequence.go b/src/0376_wiggle_subsequence/wiggle_subsequence.go
@@ -29,7 +29,7 @@ Can you do it in O(n) time?
 
 package wigglesubsequence
 
-import ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 /*
  * 用up[i]和down[i]分别记录到第i个元素为止以上升沿和下降沿结束的最长“摆动”
diff --git a/src/0435_non_overlapping_intervals/dp_solution.go b/src/0435_non_overlapping_intervals/dp_solution.go
@@ -12,7 +12,7 @@ Note:
 package nonoverlappingintervals
 
 import (
-	".com/zwfang/leetcode/utils"
+	"leetcode/utils"
 	"sort"
 )
 
diff --git a/src/0747_largest_number_at_least_twice_of_others/largest_number_at_least_twice_of_others.go b/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 ".com/zwfang/leetcode/utils"
+import "leetcode/utils"
 
 // Time complexity: O(n)
 // Space complexity: O(1)

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@ Note:`
`12`	`12`	`package nonoverlappingintervals`
`13`	`13`
`14`	`14`	`import (`
`15`		`-".com/zwfang/leetcode/utils"`
	`15`	`+"leetcode/utils"`
`16`	`16`	`"sort"`
`17`	`17`	`)`
`18`	`18`