g0901_1000.s0916_word_subsets.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 g0901_1000.s0916_word_subsets;

// #Medium #Array #String #Hash_Table #2022_03_29_Time_30_ms_(57.30%)_Space_88_MB_(54.80%)

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

public class Solution {
    public List wordSubsets(String[] words1, String[] words2) {
        List l1 = new ArrayList<>();
        int[] target = new int[26];
        for (String s1 : words2) {
            int[] temp = new int[26];
            for (char ch1 : s1.toCharArray()) {
                temp[ch1 - 'a']++;
                target[ch1 - 'a'] = Math.max(target[ch1 - 'a'], temp[ch1 - 'a']);
            }
        }
        for (String s1 : words1) {
            int[] count = new int[26];
            for (char ch1 : s1.toCharArray()) {
                count[ch1 - 'a']++;
            }

            if (checkIt(target, count)) {
                l1.add(s1);
            }
        }
        return l1;
    }

    private boolean checkIt(int[] target, int[] count) {
        for (int i = 0; i < 26; i++) {
            if (count[i] < target[i]) {
                return false;
            }
        }
        return true;
    }
}