題目

https://leetcode.com/problems/maximum-product-of-word-lengths/

題解

中規(guī)中矩的題目，中規(guī)中矩的思路，不像是一個 medium 題。直接上草稿。

class Solution {public int maxProduct(String[] words) {boolean[][] a = new boolean[words.length][26];for (int i = 0; i < words.length; i++) {for (int j = 0; j < words[i].length(); j++) {a[i][words[i].charAt(j) - 'a'] = true;}}int maxProduct = 0;for (int i = 0; i < words.length; i++) {for (int j = i + 1; j < words.length; j++) {// if (words[i].length() * words[j].length() < maxProduct) continue; // 剪枝（優(yōu)化效果不明顯）int k;for (k = 0; k < words[i].length(); k++) {if (a[j][words[i].charAt(k) - 'a']) break;}if (k == words[i].length()) maxProduct = Math.max(maxProduct, words[i].length() * words[j].length());}}return maxProduct;} }

總結(jié)

以上是生活随笔為你收集整理的leetcode 318. Maximum Product of Word Lengths | 318. 最大单词长度乘积的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。