摘要：
// method 1 public static int majorityElement_1(int[] num) { int major=num[0], count = 1; for (int i=1; i<num.length;i++) { if (count == 0) { count++; 阅读全文
posted @ 2020-04-20 14:44
CodeCorner
阅读(303)
评论(0)
推荐(0)
摘要：
public static void moveZeroes(int[] nums) { if (nums == null || nums.length == 0) return; int insertPos = 0; // 找非0 for (int num: nums) { if (num != 0 阅读全文
posted @ 2020-04-20 14:25
CodeCorner
阅读(150)
评论(0)
推荐(0)
浙公网安备 33010602011771号