[LeetCOde]Reverse Nodes in k-Group
来源:互联网 发布:刺马案 知乎 编辑:程序博客网 时间:2024/05/18 12:29
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.
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
核心:reverseNode() 将k个链表倒叙
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution {public ListNode reverseKGroup(ListNode head, int k) {ListNode start = new ListNode(0);start.next = head;boolean flag = false;for (ListNode cur = start;; cur = kNode(cur, k)) {for (int i = 1; i <= k; i++) {if (kNode(cur, i) == null) {flag = true;break;}}if (flag) {break;}cur.next = reverseNode(cur.next, k);}return start.next;}private ListNode kNode(ListNode node, int k) {ListNode ln = node;for (int i = 0; i < k; i++) {ln = ln.next;}return ln;}private ListNode reverseNode(ListNode left, int k) {ListNode ln = kNode(left,k-1).next;ListNode res = kNode(left,k-1);for(int i=k-1;i>0;i--){kNode(left,i).next = kNode(left,i-1);}left.next = ln;return res;}}
0 0
- LeetCode:Reverse Nodes in k-Group
- LeetCode: Reverse Nodes in k-Group
- LeetCode : Reverse Nodes in k-Group
- leetcode 42: Reverse Nodes in k-Group
- [Leetcode] reverse nodes in K-Group
- [LeetCode]Reverse Nodes in k-Group
- LeetCode-Reverse Nodes in k-Group
- LeetCode - Reverse Nodes in k-Group
- LeetCode | Reverse Nodes in k-Group
- 【leetcode】Reverse Nodes in k-Group
- Leetcode: Reverse Nodes in k-Group
- leetcode Reverse Nodes in k-Group
- [LeetCode] Reverse Nodes in k-Group
- LeetCode题解: Reverse Nodes in k-Group
- 【Leetcode】Reverse Nodes in k-Group
- LeetCode Reverse Nodes in k-Group
- [Leetcode] Reverse Nodes in k-Group (Java)
- LeetCode(25)Reverse Nodes in K-Group
- QTP/UFT11.5官方下载与安装教程及汉化
- Qt中停靠窗口的实现
- 别再用JS里面的Math.random()方法生成随机数
- html学习笔记(一)——什么是html及html标签
- 关于ios中的setNeedsDisplay和setNeedsLayout
- [LeetCOde]Reverse Nodes in k-Group
- 局域网内查找固定ip插口所绑定的ip地址(linux)
- MyEclipse从数据库反向生成实体类之Hibernate方式 反向工程
- Qt使用QStackedWidget实现堆栈窗口
- oracle 存储过程
- 输出1-100 以内的质数
- GCC 中的编译器堆栈保护技术
- NSDate实例的类方法
- uva 1462 - Fuzzy Google Suggest(字典树+dfs)