题目描述
给你链表的头节点 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/swapping-nodes-in-a-linked-list
解题思路:
定义一个node结点和快慢指针都指向头结点,fast快指针一直往前走直到遇见null,当node结点走到正数第k个结点时停止,此时slow慢指针开始出发,最后fast快指针走完链表时,slow慢指针所在位置刚好就是倒数第k个结点。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode swapNodes(ListNode head, int k) {
ListNode node = head;
ListNode slow = head;
ListNode fast = head;
int count = 1;
while(fast.next != null) {
if(count < k){
node = node.next;
}else{
slow = slow.next;
}
fast = fast.next;
count++;
}
int temp = node.val;
node.val = slow.val;
slow.val = temp;
return head;
}
}