leetcode题解c++ | 25. Reverse Nodes in k-Group
来源:互联网 发布:轩辕剑符鬼突破数据 编辑:程序博客网 时间:2024/06/05 20:21
题目:https://leetcode.com/problems/reverse-nodes-in-k-group/#/description
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the linked 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.
For 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
就是做length/k次单链表反转。链表反转有两种方法,一种是头插法,申请一个头节点,然后每次把轮到的节点插入到头节点后面;另为一种不需要新的
节点,记录相邻的三个节点pre,cur,next,每次把cur指向pre,然后三个节点依次往后移一位。
c++实现:
头插法版本
ListNode* reverseKGroup(ListNode* head, int k){ if(head == NULL || k==1) return head; ListNode *nextList = head; int i; for(i=1; i<=k; ++i) if(nextList!=NULL) nextList = nextList->next; else break; if(nextList==NULL && i!=k+1) return head; ListNode *start = new ListNode(1); ListNode *p; ListNode *q = head; for(i=1; i<=k; ++i) { p = q; q = p->next; p->next = start->next; start->next = p; } p = start->next; for(i=1; i<=k-1; ++i) p = p->next; p->next = reverseKGroup(nextList, k); return start->next;}
非头插法版本
ListNode* reverseKGroup(ListNode* head, int k){ //非头插法反转链表 if(head == NULL || k==1) return head; ListNode *nextList = head; int i; for(i=1; i<=k; ++i) if(nextList!=NULL) nextList = nextList->next; else break; if(i==k+1) { nextList = reverseKGroup(nextList, k); ListNode *p = head; ListNode *q; for(int i=1; i<=k; ++i) { q = p->next; p->next = nextList; nextList = p; p = q; } head = nextList; } return head;}
- LeetCode题解: Reverse Nodes in k-Group
- leetcode题解c++ | 25. Reverse Nodes in k-Group
- leetcode题解-25. Reverse Nodes in k-Group
- Leetcode题解-25. Reverse Nodes in k-Group
- leetcode题解-25. Reverse Nodes in k-Group
- [LeetCode练习题-C语言] 25. Reverse Nodes in k-Group
- 【LeetCode】 25. Reverse Nodes in k-Group C语言
- [LeetCode]25.Reverse Nodes in k-Group
- LeetCode --- 25. Reverse Nodes in k-Group
- LeetCode 25.Reverse Nodes in k-Group
- [Leetcode] 25. Reverse Nodes in k-Group
- 【LeetCode】25.Reverse Nodes in k-Group
- [leetcode] 25.Reverse Nodes in k-Group
- Leetcode-25.Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- leetcode 25. Reverse Nodes in k-Group
- 各种排序算法实现和原理(详细)
- 中国云计算技术大会召开 直面企业IT问题与挑战
- 对比指向文字常量区的指针和数组
- 网址收藏---学习,及工具下载
- boost::filesystem 常用方法
- leetcode题解c++ | 25. Reverse Nodes in k-Group
- 【笔记】shiro中的Password加密设置:
- 红黑树(RBTree)的实现
- 字符串的分解问题
- Json进一步应用
- 汇编语言showStr测试子程序
- How to create a link in Linux
- 【BFS瞎搜】九宫重排
- LeetCode刷题(C++)——Verify Preorder Serialization of a Binary Tree(Medium)