Swap Nodes & Reverse Nodes in k-Group

Swap Nodes |

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

Example

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

分析：使用递归，方便又快捷。

 /**
  * Definition for singly-linked list.
  * public class ListNode {
  *     int val;
  *     ListNode next;
  *     ListNode(int x) { val = x; }
  * }
  */
 public class Solution {
     /**
      * @param head a ListNode
      * @return a ListNode
      */
     public ListNode swapPairs(ListNode head) {
         if (head == null || head.next == null) return head;

         ListNode prev = head;
         ListNode current = head.next;
         head = current.next;
         current.next = prev;

         prev.next = swapPairs(head);

         return current;
     }
 }

Reverse Nodes in k-Group

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed. Only constant memory is allowed.

 

Example

Given this linked list: 1->2->3->4->5

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

 class Solution {
     public ListNode reverseKGroup(ListNode head, int k) {
         if (head == null || !hasKElements(head, k)) return head;

         ListNode prev = null;
         ListNode current = head;
         ListNode next = null;
         int i = ;
         while (i <= k) {
             next = current.next;
             current.next = prev;
             prev = current;
             current = next;
             i++;
         }

         head.next = reverseKGroup(current, k);
         return prev;
     }

     private boolean hasKElements(ListNode head, int k) {
         while(k >= ) {
             if (head == null) return false;
             k--;
             head = head.next;
         }
         return true;
     }
 }