lintcode-medium-Swap Two Nodes in Linked List
2016-04-07 07:53
549 查看
Given a linked list and two values v1 and v2. Swap the two nodes in the linked list with values v1 and v2. It's guaranteed there is no duplicate values in the linked list. If v1 or v2 does not exist in the given linked list, do nothing.
Notice
You should swap the two nodes with values v1 and v2. Do not directly swap the values of the two nodes.
Example
Given
Return
Notice
You should swap the two nodes with values v1 and v2. Do not directly swap the values of the two nodes.
Example
Given
1->2->3->4->nulland v1 =
2, v2 =
4.
Return
1->4->3->2->null.
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { /** * @param head a ListNode * @oaram v1 an integer * @param v2 an integer * @return a new head of singly-linked list */ public ListNode swapNodes(ListNode head, int v1, int v2) { // Write your code here if(head == null || head.next == null) return head; if(v1 == v2) return head; ListNode fakehead = new ListNode(0); fakehead.next = head; ListNode p1 = fakehead; ListNode p2 = fakehead; while(p1.next != null){ if(p1.next.val == v1) break; p1 = p1.next; } if(p1.next == null) return head; while(p2.next != null){ if(p2.next.val == v2) break; p2 = p2.next; } if(p2.next == null) return head; ListNode node1 = p1.next; p1.next = null; ListNode node2 = p2.next; p2.next = null; p2.next = node1; p1.next = node2; ListNode head2 = null; ListNode head3 = null; if(node1.next != null) head2 = node1.next; else head2 = null; if(node2.next != null) head3 = node2.next; else head3 = null; node2.next = head2; node1.next = head3; return fakehead.next; } }
相关文章推荐
- 222. Count Complete Tree Nodes
- LeetCode Remove Nth Node From End of List
- 【NodeJS 】Express
- 222. Count Complete Tree Nodes 完全二叉树节点
- 使用supervisor提高nodejs调试效率
- 024 Swap Nodes in Pairs
- leetcode——24—— Swap Nodes in Pairs
- LeetCode 24. Swap Nodes in Pairs
- NodeJS、NPM安装配置步骤(windows版本)
- Nodejs Error: Cannot find module 'unicode/category/So'
- nodejs 升级命令
- nodejs之promise书写规范
- LeetCode 237 -Delete Node in a Linked List ( JAVA )
- node.js 使用笔记--源自技术
- leetcode——19——Remove Nth Node From End of List
- LeetCode *** 237. Delete Node in a Linked List
- express 4.x 获取post提交的数据
- sublime的js调试环境(基于node环境)
- [nodejs] ccap验证码
- Leetcode 19. Remove Nth Node From End of List(python)