摘要: Sort a linked list using insertion sort. /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* insertionSortList(str... 阅读全文
posted @ 2015-12-04 20:51 dylqt 阅读(159) 评论(0) 推荐(0)
摘要: Sort a linked list in O(n log n) time using constant space complexity. 1、使用快排:交换的次数太多,超过时间限制 选择第一个值为基准值,然后比较 #include // Definition for singly-linked list. struct ListNode { int val; st... 阅读全文
posted @ 2015-12-04 18:24 dylqt 阅读(174) 评论(0) 推荐(0)