Linkedlist Palindrome Linked List

isPalindrome.go

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func isPalindrome(head *ListNode) bool {
    
    dummy := &ListNode{
        Val:head.Val,
        Next: head.Next,
    }
    reversed :=dummy
    var prev *ListNode
    
    var original = []int{} 

    for dummy != nil{
        original = append(original, dummy.Val)

        nextTmp:= dummy.Next
        dummy.Next = prev
        prev = dummy
        dummy = nextTmp 
        if dummy != nil {
            reversed = dummy
        }
    }

    for _,num := range original {
        
        if num != reversed.Val {
            return false
        }

        reversed = reversed.Next
    }
    
    return true
}