AC C++ solution beats 100%, easy to understand
AC C++ solution beats 100%, easy to understand\n\n bool game(vector<double> & nums,int n)\n    {\n        if(n==1)\n        {\n            if(fabs(nums[0]-24)<1
AC C++ solution beats 100%, easy to understand\n```\n bool game(vector<double> & nums,int n)\n    {\n        if(n==1)\n        {\n            if(fabs(nums[0]-24)<1e-6)\n                return true;\n            else \n                return false;\n            \n            \n            \n        }\n        \n        for(int i=0;i<n;i++)\n        {for(int j=i+1;j<n;j++)\n        {\n            double a=nums[i];\n            double b=nums[j];\n            nums[j]=nums[n-1];\n            \n            nums[i]=a+b;\n            if(game(nums,n-1))\n                return true;\n            \n            \n            nums[i]=a-b;\n              if(game(nums,n-1))\n                return true;\n            \n            \n                nums[i]=b-a;\n              if(game(nums,n-1))\n                return true;  \n            \n            \n                          nums[i]=b*a;\n              if(game(nums,n-1))\n                return true;  \n            \n            if(b!=0)\n            {\n                              nums[i]=a/b;\n              if(game(nums,n-1))\n                return true;  \n            }\n            \n            if(a!=0)\n            {\n                              nums[i]=b/a;\n              if(game(nums,n-1))\n                return true;  \n                \n            }\n            nums[i]=a;\n            nums[j]=b;\n            \n            \n        }}\n        return false;\n        \n        \n        \n        \n        \n    }\n    \n    bool judgePoint24(vector<int>& nums) {\n        vector<double>  qq(nums.size(),0.0);\n        for(int i=0;i<4;i++)\n            qq[i]=(double)nums[i];\n        return game(qq,4);\n        \n    }\n```
[]