leetcode(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.

分析：题意为求字符串数组中两个字符串长度乘积的最大值，其中这两个字符串不含有相同的字符

思路是设置一个变量res记录长度乘积的最大值，两层遍历数组，先判断两个字符串是否含有相同字符，若不含有，计算两个字符串长度的乘积并与res比较，取较大者存入res变量中。

需要写一个方法判断两个字符串是否含有相同字符，由于题设只含有小写字符，故可设一个长度为26的boolean型辅助数组，时间复杂度为O(n)

public class Solution {
    public int maxProduct(String[] words) {
        int res= 0;
        for (int i = 0; i < words.length; i++) {
            for (int j = i+1; j < words.length; j++) {
                if(compare(words[i],words[j])){//不含有相同的字符
                    int pro=words[i].length()* words[j].length();
                    res= res>pro?res:pro;
                }
            }
        }
        return res;
    }
    private static boolean compare(String v, String w)
    {
       boolean[] chars = new boolean[26];
        for (int i = 0; i < v.length(); i++) {
            chars[v.charAt(i) - 'a'] = true;
        }
        for (int j = 0; j < w.length(); j++) {
            if (chars[w.charAt(j) - 'a']) return false;
        }
        return true;
    }
}