首页 > 代码库 > leetcode318
leetcode318
public class Solution { public int MaxProduct(string[] words) { if (words == null || words.Length == 0) { return 0; } int len = words.Length; int[] value = http://www.mamicode.com/new int[len]; for (int i = 0; i < len; i++) { string tmp = words[i]; value[i] = 0; for (int j = 0; j < tmp.Length; j++) { value[i] |= 1 << (tmp[j] - ‘a‘); } } int maxProduct = 0; for (int i = 0; i < len; i++) { for (int j = i + 1; j < len; j++) { if ((value[i] & value[j]) == 0 && (words[i].Length * words[j].Length > maxProduct)) { maxProduct = words[i].Length * words[j].Length; } } } return maxProduct; } }
https://leetcode.com/problems/maximum-product-of-word-lengths/#/description
leetcode318
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。