318. Maximum Product of Word Lengths解题报告

题目

Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.

Example 1: Given [“abcw”, “baz”, “foo”, “bar”, “xtfn”, “abcdef”]

Return 16

The two words can be “abcw”, “xtfn”.

Example 2: Given [“a”, “ab”, “abc”, “d”, “cd”, “bcd”, “abcd”]

Return 4

The two words can be “ab”, “cd”.

Example 3: Given [“a”, “aa”, “aaa”, “aaaa”]

Return 0 No such pair of words.

题意解析

给定一系列的字符串，求出他们彼此之间没有共同字符(a-z)的最大长度之乘积

思路解析

对于第i个字符串，可以使用map统计它的字符，然后遍历i+1到n，在第i个map字符中是否能找到有关他们的字符，如果没有，则更新结果，复杂度是o(n^2 * l)

AC代码

class Solution {
public:
    int maxProduct(vector<string>& words) {
        if (words.size() == 0) return 0;
        int result = 0;
        for (int i = 0; i < words.size() - 1; ++i) {
            map<char, int> calculator;
            for (int k = 0; k < words[i].length(); ++k) {
                calculator[words[i][k]] = 1;
            }
            for (int j = i + 1; j < words.size(); ++j) {
                bool find = false;
                for(int l = 0; l < words[j].length(); ++l) {
                    map<char,int>::iterator key = calculator.find(words[j][l]);
                    if (key != calculator.end()) {
                        find = true;
                        break;
                    }
                }
                if (!find) {
                    int curlen = words[i].length() * words[j].length();
                    result = max(result, curlen);
                }
            }
        }
        return result;
    }
};