Commit 3b85ebc

authored

26 remove duplicate from sorted array solved (#10)

* remove duplicate from sorted array solved * add more ut case for remove duplicates

1 parent d6bd5d8 commit 3b85ebcCopy full SHA for 3b85ebc

File tree

+67

-0

lines changed

README.md
src
- 0026_remove_duplicates_from_sorted_array
  - rdfsa.go
  - rdfsa_test.go
- README.md

+67

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,6 +11,7 @@ continually updating 😃.`
`11`	`11`
`12`	`12`	`### Array`
`13`	`13`	* [1. Two Sum](./src/0001_two_sum/twosum.go)   `lookup table;`  `hash table`
	`14`	+* [26. Remove Duplicates from Sorted Array](./src/0026_remove_duplicates_from_sorted_array/rdfsa.go)   `double index;`  `array`
`14`	`15`	* [27. Remove Element](src/0027_remove_element/remove_element.go)   `double index;`  `array`
`15`	`16`	* [167. Two Sum II - Input array is sorted](./src/0167_two_sum2/two_sum2.go)   `double index;`  `binary search`
`16`	`17`	* [209. Minimum Size Subarray Sum](./src/0209_minimum_size_subarray_sum/minimum_size_subarray_sum.go)   `sliding window`

Lines changed: 45 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,45 @@`
	`1`	`+/*`
	`2`	`+26. Remove Duplicates from Sorted Array`
	`3`	`+https://leetcode.com/problems/remove-duplicates-from-sorted-array/`
	`4`	`+`
	`5`	`+Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.`
	`6`	`+`
	`7`	`+Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.`
	`8`	`+*/`
	`9`	`+// time: 2018年12月20日`
	`10`	`+`
	`11`	`+package rdfsa`
	`12`	`+`
	`13`	`+// double index`
	`14`	`+// time complexity: O(n)`
	`15`	`+// space complexity: O(1)`
	`16`	`+func removeDuplicates(nums []int) int {`
	`17`	`+ n := len(nums)`
	`18`	`+`
	`19`	`+ if 0 == n {`
	`20`	`+ return n`
	`21`	`+ }`
	`22`	`+`
	`23`	`+ var (`
	`24`	`+ res = 1`
	`25`	`+ i = 1`
	`26`	`+ index = nextDifferentCharacterIndex(nums, 1) // 下一个不重复的地址`
	`27`	`+ )`
	`28`	`+`
	`29`	`+ for index < n {`
	`30`	`+ res++`
	`31`	`+ nums[i] = nums[index]`
	`32`	`+ i++`
	`33`	`+ index = nextDifferentCharacterIndex(nums, index+1)`
	`34`	`+ }`
	`35`	`+ return res`
	`36`	`+}`
	`37`	`+`
	`38`	`+func nextDifferentCharacterIndex(nums []int, p int) int {`
	`39`	`+ for ; p < len(nums); p++ {`
	`40`	`+ if nums[p] != nums[p-1] {`
	`41`	`+ break`
	`42`	`+ }`
	`43`	`+ }`
	`44`	`+ return p`
	`45`	`+}`

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,20 @@`
	`1`	`+package rdfsa`
	`2`	`+`
	`3`	`+import "testing"`
	`4`	`+`
	`5`	`+func TestRemoveDuplicates(t *testing.T) {`
	`6`	`+ // removeDuplicates([]int{0, 0, 1, 1, 1, 2, 2, 3, 3, 4})`
	`7`	`+ testCases := [][]int{`
	`8`	`+ {1, 1, 2},`
	`9`	`+ {0, 0, 1, 1, 1, 2, 2, 3, 3, 4},`
	`10`	`+ {},`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ expected := []int{2, 5, 0}`
	`14`	`+`
	`15`	`+ for index, data := range testCases {`
	`16`	`+ if res := removeDuplicates(data); expected[index] != res {`
	`17`	`+ t.Errorf("expected %d, got %d", expected[index], res)`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+}`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,6 +9,7 @@`
`9`	`9`	\|0020\|[Valid Parentheses](0020_valid_parentheses/valid_parentheses.go)\|Easy\|`string;` `stack`\|
`10`	`10`	\|0021\|[Merge Two Sorted Lists](0021_merge_two_sorted_lists/mergeTwoLists.go)\|Easy\|`linked list`\|
`11`	`11`	\|0025\|[Reverse Nodes in k-Group](./0025_reverse_nodes_in_k_group/reverse_node_k_group.go)\|Hard\|`linked list`\|
	`12`	+\|0026\|[Remove Duplicates from Sorted Array](0026_remove_duplicates_from_sorted_array/rdfsa.go)\|Easy\|`array;` `double index`\|
`12`	`13`	\|0027\|[Remove Element](0027_remove_element/remove_element.go)\|Easy\|`array`\|
`13`	`14`	\|0033\|[Search in Rotated Sorted Array](0033_search_in_rotated_sorted_array/search_in_rotated_sorted_array.go)\|Medium\|`binary search`\|
`14`	`15`	\|0034\|[ Find First and Last Position of Element in Sorted Array](0034_find_first_and_last_position_of_element_in_sorted_array/find_first_and_last_position_of_element_in_sorted_array.go)\|Medium\|`binary search`\|

Comments

(0)