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