Commit 7653cb0

authored

217 solved. (#54)

1 parent a2c7603 commit 7653cb0Copy full SHA for 7653cb0

File tree

+47

-0

lines changed

+47

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,7 @@ continually updating 😃.`
`26`	`26`	* [200. Number of Islands](src/0200_number_of_island/number_of_island.go)   `dfs;`  `bfs`
`27`	`27`	* [209. Minimum Size Subarray Sum](./src/0209_minimum_size_subarray_sum/minimum_size_subarray_sum.go)   `sliding window`
`28`	`28`	* [215. Kth Largest Element in an Array](./src/0215_kth_largest_element_in_an_array/kthleiaa.go)   `sort`
	`29`	+* [217. Contains Duplicate](src/0217_contains_duplicate/contains_duplicate.go)   `map`
`29`	`30`	* [283. Move Zeroes(solution1)](./src/0283_move_zeroes/move_zeroes.go)   `sliding window`
`30`	`31`	* [283. Move Zeroes(solution2)](./src/0283_move_zeroes/move_zeroes2.go)   `sliding window`
`31`	`32`	`* [303. Range Sum Query - Immutable](src/0303_range_sum_query/rsqim.go)`

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,28 @@`
	`1`	`+/*`
	`2`	`+217. Contains Duplicate`
	`3`	`+https://leetcode.com/problems/contains-duplicate/`
	`4`	`+`
	`5`	`+Given an array of integers, find if the array contains any duplicates.`
	`6`	`+`
	`7`	`+Your function should return true if any value appears at least twice in the array,`
	`8`	`+and it should return false if every element is distinct.`
	`9`	`+*/`
	`10`	`+// time: 2019年01月07日`
	`11`	`+`
	`12`	`+package cd`
	`13`	`+`
	`14`	`+// using HashTable`
	`15`	`+// time complexity: O(n)`
	`16`	`+// space complexity: O(n)`
	`17`	`+func containsDuplicate(nums []int) bool {`
	`18`	`+ record := make(map[int]int)`
	`19`	`+`
	`20`	`+ for _, num := range nums {`
	`21`	`+ if _, ok := record[num]; !ok {`
	`22`	`+ record[num] = 1`
	`23`	`+ } else {`
	`24`	`+ return true`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+ return false`
	`28`	`+}`

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,17 @@`
	`1`	`+package cd`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+func TestContainsDuplicate(t *testing.T) {`
	`6`	`+ testCases := [][]int{`
	`7`	`+ {1, 2, 3, 1},`
	`8`	`+ {1, 2, 3, 4},`
	`9`	`+ }`
	`10`	`+ expected := []bool{true, false}`
	`11`	`+`
	`12`	`+ for index, nums := range testCases {`
	`13`	`+ if res := containsDuplicate(nums); res != expected[index] {`
	`14`	`+ t.Errorf("expected %t, got %t", expected[index], res)`
	`15`	`+ }`
	`16`	`+ }`
	`17`	`+}`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -68,6 +68,7 @@`
`68`	`68`	\|0206\|[206. Reverse Linked List](0206_reverse_linked_list/reverse_linked_list.go)\|Easy\|`linked list`\|
`69`	`69`	\|0209\|[Minimum Size Subarray Sum](./0209_minimum_size_subarray_sum/minimum_size_subarray_sum.go)\|Medium\|`sliding window`\|
`70`	`70`	\|0215\|[215. Kth Largest Element in an Array](0215_kth_largest_element_in_an_array/kthleiaa.go)\|Medium\|`sort`\|
	`71`	+\|0217\|[217. Contains Duplicate](0217_contains_duplicate/contains_duplicate.go)\|Easy\|`map`\|
`71`	`72`	\|0226\|[Invert Binary Tree](./0226_invert_binary_tree/invert_binary_tree.go)\|Easy\|`recursion; ` `binary tree`\|
`72`	`73`	\|0283\|[Move Zeroes(solution1)](./0283_move_zeroes/move_zeroes.go) <br/> [Move Zeroes(solution2)](./0283_move_zeroes/move_zeroes2.go)\|Easy\|`array`\|
`73`	`74`	\|0300\|[Longest Increasing Subsequence](./0300_longest_increasing_subsequence/lis.go)\|Medium\|`dp`\|

Comments

(0)