摘要: 传送门 代码 class Solution { public int findKthLargest(int[] nums, int k) { return quickSelect(nums,0,nums.length - 1,nums.length - k); } public int quickS 阅读全文
posted @ 2020-12-13 14:00 lukelmouse 阅读(85) 评论(0) 推荐(0) 编辑
摘要: 传送门 代码 class Solution { public ListNode reverseList(ListNode head) { ListNode cur = head,pre = null; while(cur != null) { ListNode tmp = cur.next; cur 阅读全文
posted @ 2020-12-13 13:20 lukelmouse 阅读(46) 评论(0) 推荐(0) 编辑