题目描述
给你链表的头节点 head
和一个整数 k
。
交换 链表正数第 k
个节点和倒数第 k
个节点的值后,返回链表的头节点(链表 从 1 开始索引)。
示例 1:
输入:head = [1,2,3,4,5], k = 2 输出:[1,4,3,2,5]
示例 2:
输入:head = [7,9,6,6,7,8,3,0,9,5], k = 5 输出:[7,9,6,6,8,7,3,0,9,5]
示例 3:
输入:head = [1], k = 1 输出:[1]
示例 4:
输入:head = [1,2], k = 1 输出:[2,1]
示例 5:
输入:head = [1,2,3], k = 2 输出:[1,2,3]
提示:
- 链表中节点的数目是
n
1 <= k <= n <= 105
0 <= Node.val <= 100
AC代码
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* swapNodes(ListNode* head, int k) {
//统计链表长度
int len = 0;
for (ListNode* tem = head; tem; len++) {
tem = tem->next;
}
if (k * 2 == len + 1) {
return head;
}
if (k * 2 > len+1)
k = len-k+1;
//交换
if (!head->next) return head;
int n1, n2, flag = 0;
ListNode* tem = head;
ListNode* tem1 = head;
ListNode* tem2 = head;
for (int i = 1; tem1->next; i++) {
if (i == k) {
n1 = tem1->val;
tem = tem1;
}
tem1 = tem1->next;
if (i >= k && tem2->next) tem2 = tem2->next;
}
n2 = tem2->val;
tem->val = n2;
tem2->val = n1;
return head;
}
};