2022-09-26 第 312 场周赛题解

2418. 按身高排序

class Solution {
    public String[] sortPeople(String[] names, int[] heights) {
        int n = heights.length;
        Integer[] mapping = new Integer[n];
        int i = 0;
        while (i < n) {
            mapping[i] = i;
            ++i;
        }
        Arrays.sort(mapping,(a,b)->(heights[b]-heights[a]));
        String[] ans = new String[n];
        for (int j = 0; j < n; j++) {
            ans[j] = names[mapping[j]];
        }
        return ans;
    }
}

2419. 按位与最大的最长子数组

class Solution {
    public int longestSubarray(int[] nums) {
        int max = Integer.MIN_VALUE;
        for (int num : nums) {
            max = Math.max(num,max);
        }
        int i = 0; 
        int ans = 1;
        while (i < nums.length) {
            int cnt = 0;
            while (i < nums.length && nums[i] == max)  {
                i++;
                cnt++;
            }
            ans = Math.max(ans,cnt);
            ++i;
        }
        return ans;
    }
}

2420. 找到所有好下标

用两个数组分别标记一个节点其左侧的非递增的最大区间，以及右侧的非递减的最大区间。
最后遍历数组，看当前节点左右两侧最大区间是否大于等于k

class Solution {
    public List<Integer> goodIndices(int[] nums, int k) {
        int[] left = new int[nums.length];
        int[] right = new int[nums.length];
        int n = nums.length;
        left[0] = 1;
        right[n-1] = 1;
        for (int i = 1; i < n; i++) {
            if (nums[i] <= nums[i-1]) {
                left[i] = left[i-1] + 1;
            } else {
                left[i] = 1;
            }
        }
        for (int i = n - 2; i >= 0; i--) {
            if (nums[i] <= nums[i+1]) {
                right[i] = right[i+1] + 1;
            } else {
                right[i] = 1;
            }
        }
        List<Integer> ans = new ArrayList<>();
        for (int i = k; i + k < nums.length; i++) {
            if (left[i-1] >= k && right[i+1] >= k) {
                ans.add(i);
            }
        }
        return ans;
    }
}