首页 > 代码库 > [LeetCode] 147. Insertion Sort List
[LeetCode] 147. Insertion Sort List
https://leetcode.com/problems/insertion-sort-list/
思路:从旧链表中取出来,插入新链表中。
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ public class Solution { public ListNode insertionSortList(ListNode head) { if (head == null || head.next == null) { return head; } ListNode dummy = new ListNode(Integer.MIN_VALUE); while (head != null) { ListNode current = head; head = head.next; ListNode pre = dummy; ListNode p = dummy.next; while (p != null && p.val < current.val) { p = p.next; pre = pre.next; } ListNode tmp = pre.next; pre.next = current; current.next = tmp; } return dummy.next; } }
[LeetCode] 147. Insertion Sort List
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。