[LeetCode] 86. Partition List Java

题目：

Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.

You should preserve the original relative order of the nodes in each of the two partitions.

For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.

题意及分析：给出一个链表和一个值x，将链表中值小于x的点移动到值大于等于x的点之前，分别需要保持保持两部分中点的相对位置不变。可以分别得到大于等于x的链表和小于x的链表，然后把两个链表组合起来就是需要的结果。

代码：

/*** Definition for singly-linked list.* public class ListNode {*     int val;*     ListNode next;*     ListNode(int x) { val = x; }* }*/
public class Solution {public ListNode partition(ListNode head, int x) {ListNode list1=new ListNode(0);ListNode list2=new ListNode(0);ListNode p1=list1;ListNode p2=list2;ListNode start=head;while(start!=null){int value=start.val;if(value<x){p1.next = start;p1=p1.next;// list1.next=null;}else{p2.next = start;p2=p2.next;}start=start.next;}p2.next=null;p1.next=list2.next;return list1.next;}
}

转载于:https://www.cnblogs.com/271934Liao/p/8045988.html

[LeetCode] 86. Partition List Java相关推荐

【技巧】LeetCode 86. Partition List
LeetCode 86. Partition List Solution1: 我的答案,时间复杂度O(n)O(n)O(n),空间复杂度O(n)O(n)O(n) /*** Definition for ...
[Leetcode][第889题][JAVA][根据前序和后序遍历构造二叉树][分治][递归]
[问题描述][中等] [解答思路] copyOfRange class Solution {public TreeNode constructFromPrePost(int[] pre, int[] ...
[Leetcode][第106题][JAVA][ 从中序与后序遍历序列构造二叉树][分治][递归]
[问题描述][中等] [解答思路] public class Solution {public TreeNode buildTree(int[] inorder, int[] postorder) { ...
[Leetcode][第78题][JAVA][子集][位运算][回溯]
[问题描述][中等] [解答思路] 1. 位运算复杂度 class Solution {List<Integer> t = new ArrayList<Integer>(); ...
[Leetcode][第79题][JAVA][单词搜索][DFS][回溯]
[问题描述][中等] [解答思路] 1. DFS繁琐版本 class Solution {public boolean exist(char[][] board, String word) {bool ...
[Leetcode][第40题][JAVA][数组总和2][回溯][剪枝]
[问题描述][中等] [解答思路] 1. 减法 import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Ar ...
[Leetcode][第216题][JAVA][数组之和3][回溯]
[问题描述][中等] [解答思路] 回溯剪树枝当和超过n 或个数超过k 1. 正向求和优化前 class Solution {public List<List<Integer> ...
[Leetcode][第39题][JAVA][组合总和][回溯][dfs][剪枝]
[问题描述][中等] [解答思路] 1. 回溯 import java.util.ArrayDeque; import java.util.ArrayList; import java.util.De ...
[Leetcode][第77题][JAVA][组合][回溯]
[问题描述][中等] [解答思路] 1. 回溯 class Solution {List<List<Integer>> lists = new ArrayList<> ...

[LeetCode] 86. Partition List Java

[LeetCode] 86. Partition List Java相关推荐

最新文章

热门文章