中级农民
- 积分
- 155
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2014-4-17
- 最后登录
- 1970-1-1
|
写了下代码,请问有比brute force更好的办法吗?
- public class MaxStringProductWithoutSameCharacter {
- public static void main(String[] args) {
- List<String> strs = new ArrayList<String>();
- strs.add("abc");
- strs.add("cgdsrh");
- strs.add("egdsrh");
- strs.add("badgagerwgwe");
- strs.add("dfaaadfsdfe");
- strs.add("jtyjukuk");
- int res = findMaxStringProductWithoutSameCharacter(strs);
- System.out.println(res);
- }
- public static int findMaxStringProductWithoutSameCharacter(List<String> strs) {
- if (strs == null || strs.size() == 0) {
- return 0;
- }
- int max = 0;
- for (int i = 0; i < strs.size(); i++) {
- for (int j = i + 1; j < strs.size(); j++) {
- if (!containsSameCharacter(strs.get(i), strs.get(j))) {
- System.out.println(strs.get(i) + " " + strs.get(j) + " " + strs.get(i).length() * strs.get(j).length());
- max = Math.max(max, strs.get(i).length() * strs.get(j).length());
- }
- }
- }
-
- return max;
- }
- private static boolean containsSameCharacter(String str1, String str2) {
- HashSet<Character> set = new HashSet<Character>();
- for (char c : str1.toCharArray()) {
- set.add(c);
- }
- for (char c : str2.toCharArray()) {
- if (set.contains(c)) {
- return true;
- }
- }
- return false;
- }
- }
复制代码 |
|