Leetcode剑指Offer刷题 - 第二十三天

Leetcode剑指Offer刷题指南：

Leetcode剑指Offer刷题-学习计划目录_DEGv587的博客-CSDN博客

剑指 Offer 39. 数组中出现次数超过一半的数字

解法一：排序库函数 + 取中位数

class Solution {
    public int majorityElement(int[] nums) {
        if (nums.length == 0) return -1;
        Arrays.sort(nums);
        return nums[nums.length / 2];
    }
}

解法二：hashmap

class Solution {
    public int majorityElement(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int n : nums) {
            map.put(n, map.getOrDefault(n, 0) + 1);
            if (map.get(n) > (nums.length / 2)) {
                return n;
            }
        }
        return -1;
    }
}

解法三：摩尔投票法，极限一换一，留到最后的就是过半数

class Solution {
    public int majorityElement(int[] nums) {
        int count = 0, ret = 0;
        for (int n : nums) {
            if (count == 0) {
                ret = n;
                ++count;
            } else {
                count = ret == n ? ++count : --count;
            }
        }

        return ret;
    }
}

剑指 Offer 66. 构建乘积数组

解法：从左往右累乘，然后从右往左累乘

class Solution {
    public int[] constructArr(int[] a) {
        int len = a.length;
        int[] ret = new int[len];
        //从左往右累乘
        int cur = 1;
        for (int i = 0; i < len; ++i) {
            ret[i] = cur;
            cur *= a[i];
        }
        //从右往左累乘
        cur = 1;
        for (int i = len - 1; i >= 0; --i) {
            ret[i] *= cur;
            cur *= a[i];
        }

        return ret;
    }
}