Additive Number

[leetcode]Additive Number

链接：https://leetcode.com/problems/additive-number/description/

Question

Additive number is a string whose digits can form additive sequence.

A valid additive sequence should contain at least three numbers. Except for the first two numbers, each subsequent number in the sequence must be the sum of the preceding two.

Given a string containing only digits '0'-'9', write a function to determine if it’s an additive number.

Note: Numbers in the additive sequence cannot have leading zeros, so sequence 1, 2, 03 or 1, 02, 3 is invalid.

Example 1

Input: "112358"
Output: true 
Explanation: The digits can form an additive sequence: 1, 1, 2, 3, 5, 8. 
             1 + 1 = 2, 1 + 2 = 3, 2 + 3 = 5, 3 + 5 = 8

Example 2

Input: "199100199"
Output: true 
Explanation: The additive sequence is: 1, 99, 100, 199. 
             1 + 99 = 100, 99 + 100 = 199

Solution

class Solution {
public:
  string num;
  typedef long long int ll;
  bool dfs(int left, vector<ll> ans) {
    if (left == num.size() && ans.size() >= 3) return true;
    for (int gap = 1; left+gap <= num.size() && gap <= num.size()/2; gap++) {
      string sub = num.substr(left, gap);
      if (sub[0] == '0' && sub.size() > 1) continue;
      ll sub_num = stol(sub.c_str());
      if (ans.size() <= 1) {
        ans.push_back(sub_num);
        bool success = dfs(left+gap, ans);
        ans.pop_back();
        if (success) return true;
      } else {
        ll first = ans[ans.size()-2];
        ll second = ans[ans.size()-1];
        if (first+second == sub_num) {
          ans.push_back(sub_num);
          bool success = dfs(left+gap, ans);
          ans.pop_back();
          if (success) return true;
        } else if (first+second < sub_num) break;
      }
    }
    return false;
  }

  bool isAdditiveNumber(string num) {
    this->num = num;
    return dfs(0, vector<ll>());
  }
};

思路：类似之前的一道判断是不是斐波那契数列的题，常规回溯;-)注意要判断不能有前置的0，巧妙的地方在于gap。