146. LRU 缓存

中等

题目

解法：遍历

Java

class Solution {
    public ListNode sortList(ListNode head) {
		if(head == null) return null;
		ListNode node = head;
		ArrayList<Integer> list = new ArrayList<>();
		while(node != null) {
			list.add(node.val);
			node = node.next;
		}
		Object[] array = list.toArray();
		Arrays.sort(array);
		ListNode res = new ListNode((int)array[0]);
		ListNode idx = res;
		for (int i = 1; i < array.length; i++) {
			idx.next = new ListNode((int)array[i]);
			idx = idx.next;
		}
		return res;
    }
}

Python

class Solution:
    def sortList(self, head: Optional[ListNode]) -> Optional[ListNode]:
        node_vals = []
        cur = head
        while(cur != None):
            node_vals.append(cur.val)
            cur = cur.next
        node_vals = sorted(node_vals)
        cur = head
        idx = 0
        while (cur != None):
            cur.val = node_vals[idx]
            idx += 1
            cur = cur.next
        return head