T306 累加数(回溯+大数加法)

思想：大思路还是每次从串s的[start,end]截取一定长度的子串，当截取的子串数>=2时再去判断本次截取的子串c是否 = 前两次截取的子串a和b的和(所以这里要借助一个List来存储每次截取的字符串，当然也可以只存储前两次的字符串(改用linkedList))。(主要是这里，用int和long来表示每个子串时会发生溢出情况，所以改用大数加法进行验证)

class Solution {
    public boolean isAdditive(String a,String b,String c){//验证c = a+b,大数加法版
       int aIdx = a.length()-1,bIdx = b.length()-1,cIdx = c.length()-1;
       int jw = 0;
       while(aIdx>=0||bIdx>=0||cIdx>=0){
           int aNum = (aIdx>=0)?a.charAt(aIdx)-'0':0;
           int bNum = (bIdx>=0)?b.charAt(bIdx)-'0':0;
           int cNum = (cIdx>=0)?c.charAt(cIdx)-'0':0;//这里注意c不一定是最长的，所以统一处理
           int aSumB = aNum+bNum+jw;
           if(aSumB>=10){
               jw = aSumB/10;
               aSumB = aSumB%10;
           }
           if(aSumB!=cNum){
               return false;
           }
           aIdx--;
           bIdx--;
           cIdx--;
       }
       return true;
    }
    public boolean helper(String s,int start,List<String>trace){
        if(start==s.length()){
            return trace.size()>=3;
        }
        for(int end=start;end<s.length();end++){
            if(s.charAt(start)=='0'&&end>start) continue;
            String curNum = s.substring(start,end+1);
            if(trace.size()<2||isAdditive(trace.get(trace.size()-1),trace.get(trace.size()-2),curNum)){//当截取的子串数<2或者满足a+b =c 时继续下次操做
              trace.add(curNum);
              if(helper(s,end+1,trace)){
                trace.remove(trace.size()-1);  
                return true;
              }
              trace.remove(trace.size()-1);
            }
        }
        return false; 
    }
    public boolean isAdditiveNumber(String num) {
       int len = num.length();
       if(len<3||num.charAt(0)=='0'&&num.length()==1)return false;
       return helper(num,0,new ArrayList<>());
    }
}