leetcode 61. Rotate List
来源:互联网 发布:nginx 默认错误页面 编辑:程序博客网 时间:2024/06/06 03:12
Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.
需要两个指针 一个j指向5一个i指向3
所以起始的时候i指向1 j指向3 即走k步
public ListNode rotateRight(ListNode head, int k) { if(head == null) return null; ListNode iNode = head; ListNode jNode = head; int length; for(length = 0;iNode != null;length++) iNode = iNode.next; iNode = head; k = k % length; if(k == 0) return head; for(int i = 0;i < k ;i++){ if(jNode.next != null)jNode = jNode.next; else jNode = head; } while(jNode.next != null){ iNode = iNode.next; jNode = jNode.next; } jNode.next = head; head = iNode.next; iNode.next = null; return head; }
0 0
- [LeetCode]61.Rotate List
- LeetCode --- 61. Rotate List
- [Leetcode] 61. Rotate List
- [leetcode] 61.Rotate List
- [leetcode] 61. Rotate List
- leetcode 61. Rotate List
- LeetCode 61. Rotate List
- [leetcode] 61. Rotate List
- 61. Rotate List LeetCode
- leetcode 61. Rotate List
- LeetCode 61. Rotate List
- leetcode 61. Rotate List
- [LeetCode]61. Rotate List
- LeetCode 61. Rotate List
- LeetCode *** 61. Rotate List
- LeetCode 61. Rotate List
- [Leetcode]61. Rotate List
- LeetCode - 61. Rotate List
- mysql主从复制
- Scrapy爬取美女图片第四集 突破反爬虫(上)
- 二叉树的先序,中序,后序遍历
- 64位Ubuntu kylin 16.04显示CPU内存使用率
- 漫步线性代数二十四——行列式应用
- leetcode 61. Rotate List
- 当Qt数据库应用找不到MySql
- 自定义EditText
- unity 编写代码日常(一)
- 奇虎360_2017校园招聘笔试编程题第二题
- SEO优化第一步
- 享元模式(Flyweight)
- 2013计算机视觉代码合集(一、二)
- 浅谈对java集合的理解