21. merge-two-sorted-lists, golang

最新推荐文章于 2021-03-28 22:25:33 发布

sky527759

最新推荐文章于 2021-03-28 22:25:33 发布

阅读量126

点赞数

分类专栏： leetcode-myself

本文链接：https://blog.csdn.net/sky527759/article/details/103249777

版权

leetcode-myself 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

code:

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode {
    if nil == l1 {
        return l2
    } else if nil == l2 {
        return l1
    } else {
        temp1, temp2 := l1, l2
        var listRet, temp3 *ListNode
        if l1.Val > l2.Val {
            listRet, temp2 = l2, l2.Next
        } else {
            listRet, temp1 = l1, l1.Next
        }
        temp3 = listRet
        
        for temp1 != nil || temp2 != nil {
            if nil == temp1 {
                temp3.Next = temp2
                break
            } else if nil == temp2 {
                temp3.Next = temp1
                break
            } else {
                if temp1.Val > temp2.Val {
                    temp3.Next, temp2 = temp2, temp2.Next
                } else {
                    temp3.Next, temp1 = temp1, temp1.Next
                }
                temp3 = temp3.Next
            }//else
        }//for l1 != nil && l2 != nil
        
        return listRet
    }//else
}//func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode