给定一个string数组dic,代表单词列表,同时给定列表的长度n,请返回最大子矩阵的面积,其中子矩阵中的行和列相同,且有相同字母组成。保证单词的大小小于等于50,且某一长度的串的数量小于等于12。 测试样例: ["aaa","aaa","aaa","bb","bb"] 返回:9
加载中...
import java.util.*; public class AlphaMatrix { public int findAlphaMatrix(String[] dic, int n) { // write code here } }
class AlphaMatrix { public: int findAlphaMatrix(vector
dic, int n) { // write code here } };
# -*- coding:utf-8 -*- class AlphaMatrix: def findAlphaMatrix(self, dic, n): # write code here
class AlphaMatrix { public int findAlphaMatrix(string[] dic, int n) { // write code here } }