codingbat:recursion-2:1(JAVA)

最新推荐文章于 2020-11-26 14:21:59 发布

zafzap1

最新推荐文章于 2020-11-26 14:21:59 发布

阅读量788

点赞数

分类专栏：扯蛋

本文链接：https://blog.csdn.net/zafzap1/article/details/50444858

版权

扯蛋专栏收录该内容

25 篇文章 1 订阅

订阅专栏

public boolean groupSum(int start, int[] nums, int target) {
if(start>=nums.length&&target!=0)
     return false;
if(target==0)
     return true;
else
     return groupSum(start+1,nums,target-nums[start])||groupSum(start+1,nums,
     target);
}

public boolean groupSum6(int start, int[] nums, int target) {
if(start>=nums.length&&target!=0)
     return false;
if(target==0&&start==nums.length)
     return true;
if(nums[start]==6)
      return groupSum6(start+1,nums,target-6);
   else
      return groupSum6(start+1,nums,target)||groupSum6(start+1,nums,target-nums[start]);

}

public boolean groupNoAdj(int start, int[] nums, int target) {
if(start>=nums.length&&target!=0)
     return false;
if(target==0)
     return true;
else
      return groupNoAdj(start+2,nums,target-nums[start])||groupNoAdj(start+1,nums,target);

}

public boolean groupSum5(int start, int[] nums, int target) {
if(start>=nums.length&&target!=0)
     return false;
if(start==nums.length&&target==0)
     return true;
if(nums[start]%5==0){
     if(start<nums.length-1&&nums[start+1]==1)
        return groupSum5(start+2,nums,target-nums[start]);
     else
     return groupSum5(start+1,nums,target-nums[start]);}
     else
return groupSum5(start+1,nums,target-nums[start])||groupSum5(start+1,nums,target);
}
public boolean groupSumClump(int start, int[] nums, int target) {
if(start>=nums.length&&target!=0)
     return false;
if(start==nums.length&&target==0)
     return true;
if(start<nums.length-1&&nums[start+1]==nums[start])
     return groupSumClump(start+2,nums,target)||groupSumClump(start+2,nums,target-2*nums[start]);
else
    return groupSumClump(start+1,nums,target-nums[start])||groupSumClump(start+1,nums,target);
}
public boolean splitArray(int[] nums) {
return split(0,nums,0,0);
}
public boolean split(int start,int[]nums,int a,int b){
    if(start>=nums.length&&a!=b)
       return false;
    if(start==nums.length&&a==b)
       return true;
    else
       return split(start+1,nums,a+nums[start],b)||split(start+1,nums,a,b+nums[start]);
}

public boolean splitOdd10(int[] nums) {
return split(0,nums,0,0);
}
public boolean split(int start,int[]nums,int a,int b){
    if(start==nums.length){
    if(a%10==0&&b%2!=0)
       return true;
    else
       return false;}
    else
       return split(start+1,nums,a+nums[start],b)||split(start+1,nums,a,b+nums[start]);
}

public boolean split53(int[] nums) {
return split(0,nums,0,0);
}
public boolean split(int start,int[] nums,int a,int b)
{
     if(start==nums.length){
         if(a==b)
           return true;
         else
           return false;
     }
     else{
        if(nums[start]%5==0)
          return split(start+1,nums,a+nums[start],b);
        else if(nums[start]%3==0)
          return split(start+1,nums,a,b+nums[start]);
        else
          return split(start+1,nums,a+nums[start],b)||split(start+1,nums,a,b+nums[start]);
     }
}