算法题4.的答案 感谢楼主的面经 public class bitsumMax { public static int bitmulti(int n ){ if (n<=0) return -1; int result = 1; while (n!=0){ result = result*(n%10); n = n/10; } return result; } public static int findmax(int num){ int max = 0; List<Integer> list = new ArrayList<>(); for (int i =0;i<=num;i++){ int temp = bitmulti(i); if (temp>=max){ max = temp; } } for (int i = 0;i<=num;i++){ if (bitmulti(i)==max){ list.add(i); } } int[] result = new int[list.size()]; for (int j = 0;j<result.length;j++){ result[j] = list.get(j); } Arrays.sort(result); return result[result.length-1]; } public static void main(String[] args){ System.out.println(findmax(202)); } }