LeetCode --- 24. Swap Nodes in Pairs

最新推荐文章于 2024-03-08 07:59:27 发布

MissXy_

最新推荐文章于 2024-03-08 07:59:27 发布

阅读量198

点赞数

分类专栏： LeetCode ''算法''不能停…… 文章标签： 24. Swap Nodes in Pairs C++

本文链接：https://blog.csdn.net/MissXy_/article/details/88792064

版权

LeetCode 同时被 2 个专栏收录

55 篇文章 0 订阅

订阅专栏

''算法''不能停……

38 篇文章 2 订阅

订阅专栏

24. Swap Nodes in Pairs

Difficulty: Medium

Given a linked list, swap every two adjacent nodes and return its head.

You may not modify the values in the list’s nodes, only nodes itself may be changed.

Example:

Given 1->2->3->4, you should return the list as 2->1->4->3.

Solution

Language: C++

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        if (head == NULL || head->next == NULL){
            return head;
        }
        ListNode *p, *q, *h, *t;
        p = head;
        q = head->next;
        h = q;
        while(p != NULL && q != NULL){
            p->next = q->next;
            q->next = p;
            t = p;
            if (p->next != NULL)
                p = p->next;
            else
                return h;
            if (p->next != NULL){
                q = p->next;
                t->next = q;
            }
            else
                return h;
        }
        return head;		//不加这个返回值 编译出错 个人感觉没必要
    }
};