Commit 3e92a32

committed

Revert "go mod support."

This reverts commit 6d34346.

1 parent 6d34346 commit 3e92a32Copy full SHA for 3e92a32

File tree

13 files changed

+12

-15

lines changed

go.mod
src
- 0004_median_of_two_sorted_arrays
  - motsa.go
- 0011_container_with_most_water
  - container_with_most_water.go
- 0076_minimum_window_substring
  - minimum_window_substring.go
- 0111_minimum_depth_of_binary_tree
  - minimum_depth_of_binary_tree.go
- 0120_triangle
  - triangle.go
- 0198_house_robber
  - house_robber.go
- 0300_longest_increasing_subsequence
  - lis.go
- 0343_integer_break
  - integer_break.go
- 0349_intersection_of_2_arrays
  - intersection_of_two_arrays.go
- 0376_wiggle_subsequence
  - wiggle_subsequence.go
- 0435_non_overlapping_intervals
  - dp_solution.go
- 0747_largest_number_at_least_twice_of_others
  - largest_number_at_least_twice_of_others.go

13 files changed

+12

-15

lines changed

`‎go.mod`

Lines changed: 0 additions & 3 deletions

This file was deleted.

`‎src/0004_median_of_two_sorted_arrays/motsa.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@ You may assume nums1 and nums2 cannot be both empty.`
`12`	`12`
`13`	`13`	`package motsa`
`14`	`14`
`15`		`-import "github.com/zwfang/leetcode/utils"`
	`15`	`+import "leetcode/utils"`
`16`	`16`
`17`	`17`	`// binary search`
`18`	`18`	`// 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`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ Note: You may not slant the container and n is at least 2.`
`14`	`14`
`15`	`15`	`package containerwithmostwater`
`16`	`16`
`17`		`-import "github.com/zwfang/leetcode/utils"`
	`17`	`+import "leetcode/utils"`
`18`	`18`
`19`	`19`	`// time complexity: O(n)`
`20`	`20`	`// space complexity: O(1)`

`‎src/0076_minimum_window_substring/minimum_window_substring.go`

Lines changed: 1 addition & 1 deletion

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

`‎src/0111_minimum_depth_of_binary_tree/minimum_depth_of_binary_tree.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,7 @@ Note: A leaf is a node with no children.`
`12`	`12`
`13`	`13`	`package minimumdepthofbinarytree`
`14`	`14`
`15`		`-import "github.com/zwfang/leetcode/utils"`
	`15`	`+import "leetcode/utils"`
`16`	`16`
`17`	`17`	`// TreeNode binary tree node.`
`18`	`18`	`type TreeNode struct {`

`‎src/0120_triangle/triangle.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -8,7 +8,7 @@ Given a triangle, find the minimum path sum from top to bottom. Each step you ma`
`8`	`8`
`9`	`9`	`package triangle`
`10`	`10`
`11`		`-import "github.com/zwfang/leetcode/utils"`
	`11`	`+import "leetcode/utils"`
`12`	`12`
`13`	`13`	`// dfs`
`14`	`14`	`/*`

`‎src/0198_house_robber/house_robber.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@ Explanation: Rob house 1 (money = 2), rob house 3 (money = 9) and rob house 5 (m`
`26`	`26`
`27`	`27`	`package houserobber`
`28`	`28`
`29`		`-import "github.com/zwfang/leetcode/utils"`
	`29`	`+import "leetcode/utils"`
`30`	`30`
`31`	`31`	`/*`
`32`	`32`	`func rob(nums []int) int {`

`‎src/0300_longest_increasing_subsequence/lis.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -20,7 +20,7 @@ Follow up:`
`20`	`20`
`21`	`21`	`package lis`
`22`	`22`
`23`		`-import "github.com/zwfang/leetcode/utils"`
	`23`	`+import "leetcode/utils"`
`24`	`24`
`25`	`25`	`// Dynamic Programming`
`26`	`26`	`// TIme complexity: O(n^2)`

`‎src/0343_integer_break/integer_break.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@ Note: You may assume that n is not less than 2 and not larger than 58.`
`19`	`19`
`20`	`20`	`package integerbreak`
`21`	`21`
`22`		`-import "github.com/zwfang/leetcode/utils"`
	`22`	`+import "leetcode/utils"`
`23`	`23`
`24`	`24`	`// recursion`
`25`	`25`	`/*`

`‎src/0349_intersection_of_2_arrays/intersection_of_two_arrays.go`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -20,7 +20,7 @@ Note:`
`20`	`20`
`21`	`21`	`package intersectionof2arrays`
`22`	`22`
`23`		`-import "github.com/zwfang/leetcode/utils"`
	`23`	`+import "leetcode/utils"`
`24`	`24`
`25`	`25`	`func intersection(nums1 []int, nums2 []int) []int {`
`26`	`26`	`set1 := utils.NewSet()`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 3e92a32

File tree

13 files changed

13 files changed

`‎go.mod`

`‎src/0004_median_of_two_sorted_arrays/motsa.go`

`‎src/0011_container_with_most_water/container_with_most_water.go`

`‎src/0076_minimum_window_substring/minimum_window_substring.go`

`‎src/0111_minimum_depth_of_binary_tree/minimum_depth_of_binary_tree.go`

`‎src/0120_triangle/triangle.go`

`‎src/0198_house_robber/house_robber.go`

`‎src/0300_longest_increasing_subsequence/lis.go`

`‎src/0343_integer_break/integer_break.go`

`‎src/0349_intersection_of_2_arrays/intersection_of_two_arrays.go`

0 commit comments