weixin_37850264的博客

调整数组顺序使奇数位于偶数前面 class Solution { public int[] exchange(int[] nums) { int i = 0, j = nums.length - 1, tmp; while(i < j) { while(i < j && (nums[i] & 1) == 1) i++; while(i < j && (nums[j

40. 最小的k个数 class Solution { public int[] getLeastNumber(int[] arr,int k){ int []vec=new int[k]; if(k==0){ return vec; } PriorityQueue<Integer> queue = new PriorityQueue<Integer>(new Comparator<Integer>() { public i

24 反转链表 class Solution { public ListNode reverseList(ListNode head){ if(head==null || head.next==null){ return head; } ListNode node=reverseList(head.next); head.next.next=head; head.next=null; return node; } } 3 数组中重复的数字 查找任意一个出现超过一次的