tag:blogger.com,1999:blog-5872623838295077986.post6915634048105990868..comments2024-03-20T01:07:56.465-07:00Comments on JavaProblems.com - Free coding problems and exercises: Java > Recursion-2 > splitArray (CodingBat Solution)Unknownnoreply@blogger.comBlogger6125tag:blogger.com,1999:blog-5872623838295077986.post-32017093569687204042020-09-16T06:26:07.577-07:002020-09-16T06:26:07.577-07:00public boolean splitArray(int[] nums) {
return g...public boolean splitArray(int[] nums) {<br /> return groupSum(0, nums, 0, 0);<br />}<br />private boolean groupSum(int start,int[] nums,int sum1,int sum2) {<br /> if (start >= nums.length){<br /> return (sum1 == sum2);<br /> }<br /> return groupSum(start + 1, nums, sum1 + nums[start], sum2)<br /> || groupSum(start + 1, nums, sum1, nums[start] + sum2);<br /> <br />}Anonymoushttps://www.blogger.com/profile/18315574734870276996noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-7547379126488192402017-06-14T07:51:41.597-07:002017-06-14T07:51:41.597-07:00public boolean splitArray(int[] nums) {
retur...public boolean splitArray(int[] nums) {<br /><br /> return helper(0,nums,0,0);<br />}<br /><br />public boolean helper(int start, int[] nums, int left, int right){<br /> if(start == nums.length){<br /> return left == right;<br /> }<br /> if(helper(start + 1, nums, left + nums[start], right))<br /> return true;<br /> if(helper(start + 1, nums, left, right + nums[start]))<br /> return true;<br /> <br /> return false;<br /> <br />}Anonymoushttps://www.blogger.com/profile/17353931196897421655noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-25056274903544228252017-05-03T02:14:26.906-07:002017-05-03T02:14:26.906-07:00public boolean splitArray(int[] nums) {
return a...public boolean splitArray(int[] nums) {<br /> return arrSum(nums, 0, 0);<br />}<br />public boolean arrSum(int[] nums, int start, int target) {<br /> if(start == nums.length) {<br /> if(target == 0) return true;<br /> return false;<br /> }<br /> return arrSum(nums, start + 1, target - nums[start]) <br /> || arrSum(nums, start + 1, target + nums[start]);<br />}Anonymoushttps://www.blogger.com/profile/01270390780068886387noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-51769520645903355952016-07-26T21:51:25.567-07:002016-07-26T21:51:25.567-07:00public boolean splitArray(int[] nums) {
return g...public boolean splitArray(int[] nums) {<br /> return groupSum(0,nums,0,0);<br />}<br />private boolean groupSum(int start,int[] nums,int sum1,int sum2) {<br /> if (start >= nums.length) return sum1==sum2;<br /> if (groupSum(start+1,nums,sum1+nums[start],sum2)) return true;<br /> if (groupSum(start+1,nums,sum1,sum2+nums[start])) return true;<br /> return false;<br />}Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-17779810295185201052015-12-31T10:09:50.111-08:002015-12-31T10:09:50.111-08:00;kj;kjmohitblackra1nhttps://www.blogger.com/profile/12432584307495789822noreply@blogger.comtag:blogger.com,1999:blog-5872623838295077986.post-25886909818874541702015-12-31T10:05:49.218-08:002015-12-31T10:05:49.218-08:00;kj;kjmohitblackra1nhttps://www.blogger.com/profile/12432584307495789822noreply@blogger.com