Commit 65db02d

committed

clean code

1 parent 3c218fc commit 65db02dCopy full SHA for 65db02d

File tree

-5

lines changed

src
- 0023_merge_k_sorted_lists
  - mksl.go
- 0215_kth_largest_element_in_an_array
  - kthleiaa.go

-5

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -37,7 +37,7 @@ func mergeKLists(lists []ListNode) ListNode {`
`37`	`37`	`cur := head`
`38`	`38`	`for len(lists) > 0 {`
`39`	`39`	`for i := (len(lists) - 1) / 2; i >= 0; i-- {`
`40`		`- shiftUp(lists, len(lists), i)`
	`40`	`+ siftUp(lists, len(lists), i)`
`41`	`41`	`}`
`42`	`42`	`cur.Next = &ListNode{Val: lists[0].Val}`
`43`	`43`	`cur = cur.Next`
`@@ -50,7 +50,7 @@ func mergeKLists(lists []ListNode) ListNode {`
`50`	`50`	`}`
`51`	`51`
`52`	`52`	`// build heap`
`53`		`-func shiftUp(lists []*ListNode, n int, k int) {`
	`53`	`+func siftUp(lists []*ListNode, n int, k int) {`
`54`	`54`	`for 2*k+1 < n {`
`55`	`55`	`j := 2*k + 1`
`56`	`56`	`if j+1 < n && lists[j+1].Val < lists[j].Val {`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -19,17 +19,17 @@ package kthleiaa`
`19`	`19`	`func findKthLargest(nums []int, k int) int {`
`20`	`20`	`// heapify`
`21`	`21`	`for i := (len(nums) - 1) / 2; i >= 0; i-- {`
`22`		`- shiftDown(nums, len(nums), i)`
	`22`	`+ siftDown(nums, len(nums), i)`
`23`	`23`	`}`
`24`	`24`
`25`	`25`	`for i := len(nums) - 1; i >= len(nums)-k; i-- {`
`26`	`26`	`nums[i], nums[0] = nums[0], nums[i]`
`27`		`- shiftDown(nums, i, 0)`
	`27`	`+ siftDown(nums, i, 0)`
`28`	`28`	`}`
`29`	`29`	`return nums[len(nums)-k]`
`30`	`30`	`}`
`31`	`31`
`32`		`-func shiftDown(nums []int, n int, i int) {`
	`32`	`+func siftDown(nums []int, n int, i int) {`
`33`	`33`	`for 2*i+1 < n {`
`34`	`34`	`j := 2*i + 1`
`35`	`35`	`if j+1 < n && nums[j+1] > nums[j] {`

Comments

(0)