g1101_1200.s1177_can_make_palindrome_from_substring.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g1101_1200.s1177_can_make_palindrome_from_substring;

// #Medium #String #Hash_Table #Bit_Manipulation #Prefix_Sum
// #2022_03_03_Time_13_ms_(93.08%)_Space_136.3_MB_(53.08%)

import java.util.ArrayList;
import java.util.List;

public class Solution {
    public List canMakePaliQueries(String s, int[][] queries) {
        return this.canMakeP(s, queries);
    }

    private List canMakeP(String s, int[][] qs) {
        int n = s.length();
        int[] counts = new int[n];
        for (int i = 0; i < n; i++) {
            int m = 0;
            if (i > 0) {
                m = counts[i - 1];
            }
            char c = s.charAt(i);
            m = m ^ (1 << (c - 'a'));
            counts[i] = m;
        }
        List ans = new ArrayList<>();
        for (int[] q : qs) {
            ans.add(check(q, counts));
        }
        return ans;
    }

    private boolean check(int[] q, int[] counts) {
        int l = q[0];
        int r = q[1];
        int k = q[2];
        int prev = l > 0 ? counts[l - 1] : 0;
        int kk = Integer.bitCount(prev ^ counts[r]);
        return (kk / 2) <= k;
    }
}