linkedlist

func DeleteDuplicates ¶

func DeleteDuplicates(head *ListNode) *ListNode

DeleteDuplicates deletes all duplicates such that each element appears only once. Return the linked list sorted as well

func DeleteDuplicates2 ¶

func DeleteDuplicates2(head *ListNode) *ListNode

DeleteDuplicates2 deletes all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as wel

func DetectCycle ¶

func DetectCycle(head *ListNode) *ListNode

DetectCycle returns the node where the cycle begins. If there is no cycle, it returns nil.

func GetIntersectionNode ¶

func GetIntersectionNode(headA, headB *ListNode) *ListNode

func MergeInBetween ¶

func MergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode

MergeInBetween removes nodes that index between a, b in list1, and put list2 in their place.

func NewList ¶

func NewList(vals []int) *ListNode

NewList build a new linked list from array.

func OddEvenList ¶

func OddEvenList(head *ListNode) *ListNode

func Partition ¶

func Partition(head *ListNode, x int) *ListNode

Partition partitions list such that all nodes less than x come before nodes greater than or equal to x.

func RemoveElements ¶

func RemoveElements(head *ListNode, val int) *ListNode

RemoveElements removes elements which value is val from head.

func ReverseBetween ¶

func ReverseBetween(head *ListNode, left int, right int) *ListNode

ReverseBetween reverse the nodes of the list from position left to position right, and return the reversed list

func ReverseList ¶

func ReverseList(head *ListNode) *ListNode

ReverseList reverses the given list.

func SwapPairs ¶

func SwapPairs(head *ListNode) *ListNode

SwapPairs swaps every two adjacent nodes and return its head

func CopyRandomList ¶

func CopyRandomList(head *Node) *Node