24点运算3
package myMath.ershisidian; import itmao.Iershidian; import java.util.ArrayList; import java.util.HashMap; import java.util.Map; import java.util.Set; /** * ITMAOO * 2011.12.23 * **/ public class Main { int count=-1; double sum=0.00; Main(int a,int b,int c,int d){ ArrayList array=new ArrayList(); array.add(a); array.add(b); array.add(c); array.add(d); rankAll(array,new ArrayList()); } public static void main(String[] args) { new Main(30,24,8,12); } /****** * 全排列算法一,实现数字的全排 * ******/ void rankAll(ArrayList array,ArrayList target){ if(array.size()==0){ Map<Integer,String> outs=new HashMap<Integer,String>(); double[] intArray={Double.valueOf(target.get(0).toString()), Double.valueOf(target.get(1).toString()), Double.valueOf(target.get(2).toString()), Double.valueOf(target.get(3).toString())}; digui(intArray,sum,outs,count); } for(int i=0;i < array.size();i++ ){ ArrayList newArray=new ArrayList(array); ArrayList newtarget=new ArrayList(target); newtarget.add(newArray.get(i)); newArray.remove(i); rankAll(newArray,newtarget); } } /****** * 全排列算法二,实现运算符的全排列 * ******/ public void digui(double[] array,double sum,Map outs,int count){ count++; //处理加法,并递归调用 if(count<=3){ outs.put(count,"+"); digui(array,sum+array[count],outs,count); // sum=sum-array[count];digui(array,sum); } //输出 if(count==4&&sum==24.00){ System.out.println(outs.get(0).toString()+(int)array[0]+outs.get(1).toString()+(int)array[1]+outs.get(2).toString()+(int)array[2]+outs.get(3).toString()+(int)array[3]+"=24"); } //处理减法,并递归调用 if(count<=3){ outs.remove(count); outs.put(count, "-"); digui(array,sum-array[count],outs,count); } //处理乘法,并递归调用 if(0<count&&count<=3){ outs.remove(count); outs.put(count, "*"); if(outs.get(count-1).toString().equals("+")){ digui(array,sum-array[count-1]+array[count]*array[count-1],outs,count); }else if (outs.get(count-1).toString().equals("-")){ digui(array,sum+array[count-1]-array[count]*array[count-1],outs,count); }else if (outs.get(count-1).toString().equals("*")){ if(outs.get(count-2).toString().equals("+")){ digui(array,sum-array[count-2]*array[count-1]+array[count-2]*array[count-1]*array[count],outs,count); }else if (outs.get(count-2).toString().equals("-")){ digui(array,sum+array[count-2]*array[count-1]-array[count-2]*array[count-1]*array[count],outs,count); }else if (outs.get(count-2).toString().equals("*")){ if(outs.get(count-3).toString().equals("+")){ digui(array,array[count-3]*array[count-2]*array[count-1]*array[count],outs,count);; }else if (outs.get(count-3).toString().equals("-")){ digui(array,-array[count-3]*array[count-2]*array[count-1]*array[count],outs,count); } } } } //处理除法,并递归调用 if(1<count&&count<=3){ outs.remove(count); outs.put(count, "/"); if(outs.get(count-1).toString().equals("+")){ digui(array,sum-array[count-1] + array[count-1]/array[count],outs,count); }else if (outs.get(count-1).toString().equals("-")){ digui(array,sum+array[count-1] - array[count-1]/array[count],outs,count); }else if (outs.get(count-1).toString().equals("*")){ if(outs.get(count-2).toString().equals("+")){ digui(array,sum-array[count-2]*array[count-1]+array[count-2]*array[count-1]/array[count],outs,count); }else if (outs.get(count-2).toString().equals("-")){ digui(array,sum+array[count-2]*array[count-1]-array[count-2]*array[count-1]/array[count],outs,count); }else if (outs.get(count-2).toString().equals("*")){ if(outs.get(count-3).toString().equals("+")){ digui(array,array[count-3]*array[count-2]*array[count-1]/array[count],outs,count);; }else if (outs.get(count-3).toString().equals("-")){ digui(array,-array[count-3]*array[count-2]*array[count-1]/array[count],outs,count); } }else if (outs.get(count-2).toString().equals("/")){ if(outs.get(count-3).toString().equals("+")){ digui(array,array[count-3]/array[count-2]*array[count-1]/array[count],outs,count);; }else if (outs.get(count-3).toString().equals("-")){ digui(array,-array[count-3]/array[count-2]*array[count-1]/array[count],outs,count); } } }else if (outs.get(count-1).toString().equals("/")){ if(outs.get(count-2).toString().equals("+")){ digui(array,sum-array[count-2]/array[count-1]+array[count-2]/array[count-1]/array[count],outs,count); }else if (outs.get(count-2).toString().equals("-")){ digui(array,sum+array[count-2]/array[count-1]-array[count-2]/array[count-1]/array[count],outs,count); }else if (outs.get(count-2).toString().equals("*")){ if(outs.get(count-3).toString().equals("+")){ sum=array[count-3]*array[count-2]/array[count-1]/array[count];digui(array,sum,outs,count);; }else if (outs.get(count-3).toString().equals("-")){ sum=-array[count-3]*array[count-2]/array[count-1]/array[count];digui(array,sum,outs,count); } }else if (outs.get(count-2).toString().equals("/")){ if(outs.get(count-3).toString().equals("+")){ sum=array[count-3]/array[count-2]/array[count-1]/array[count];digui(array,sum,outs,count);; }else if (outs.get(count-3).toString().equals("-")){ sum=-array[count-3]/array[count-2]/array[count-1]/array[count];digui(array,sum,outs,count); } } } } } }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列:基于图像分类模型对图像进行分类
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 25岁的心里话
· 闲置电脑爆改个人服务器(超详细) #公网映射 #Vmware虚拟网络编辑器
· 零经验选手,Compose 一天开发一款小游戏!
· 因为Apifox不支持离线,我果断选择了Apipost!
· 通过 API 将Deepseek响应流式内容输出到前端