Leetcode 318

318. Maximum Product of Word Lengths

My Submissions

Question

Total Accepted: 12461  Total Submissions: 32103  Difficulty: Medium

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.

用位运算判断是否出现了相同的字母，将string的每一位左移到-‘a' 的位置 ，通过 或 | 运算得到一个string 的二进制表达式 ；

每一个字母在在不同的位上。再将其与其他string进行与 & 运算。如果出现了相同字母那么在同一位上就有两个 1 ，进行与&运算的答案就不会为0；

因此就可以判断 ；代码如下 ；

class Solution {
public:
    int maxProduct(vector<string>& words) {
     int bitmap[(int)words.size()] ;  //  .size() 返回的字节数，所以要转换 ；
      for (int i = 0 ; i < words.size();i++ ){
        bitmap[i] = 0 ;
      for (int j = 0 ; j <words[i].length() ; j++ )
         bitmap[i]  = bitmap[i] | (1 << words[i][j]-'a') ; // 得到每个string 的二进制表达式    }
        int result = 0 ;
        for(int i = 0 ; i < words.size() ; i++ )
        for (int j = i+1 ; j<words.size() ; j++ )
          if((bitmap[i] & bitmap[j] ) == 0 )  //  判断
              result = max(result , (int)words[i].size() * (int)words[j].size()) ; // 求最大值 
        return result ;
    }
};