Heitu的博客

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array. Coul...

题目来源：148. 排序链表 在 O(n log n) 时间复杂度和常数级空间复杂度下，对链表进行排序。 示例1: 输入: 4->2->1->3 输出: 1->2->3->4 示例2: 输入: -1->5->3->4->0 输出: -1->0->3->4->5 思路：