给表达式添加运算符（LeetCode：282） java代码实现

算法的重要性，我就不多说了吧，想去大厂，就必须要经过基础知识和业务逻辑面试+算法面试。所以，为了提高大家的算法能力，这个公众号后续每天带大家做一道算法题，题目就从LeetCode上面选 ！

今天和大家聊的问题叫做 给表达式添加运算符，我们先来看题面：

https://leetcode-cn.com/problems/expression-add-operators/

Given a string num that contains only digits and an integer target, return all possibilities to add the binary operators %22+%22, %22-%22, or %22*%22 between the digits of num so that the resultant expression evaluates to the target value.

给定一个仅包含数字 0-9 的字符串和一个目标值，在数字之间添加 二元 运算符（不是一元）+、- 或 * ，返回所有能够得到目标值的表达式。

示例

示例 1:
输入: num = "123", target = 6
输出: ["1+2+3", "1*2*3"]
示例 2:
输入: num = "232", target = 8
输出: ["2*3+2", "2+3*2"]
示例 3:
输入: num = "105", target = 5
输出: ["1*0+5","10-5"]
示例 4:
输入: num = "00", target = 0
输出: ["0+0", "0-0", "0*0"]
示例 5:
输入: num = "3456237490", target = 9191
输出: []

JAVA代码实现

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String num = s.next();
        int target = s.nextInt();
        List<String> result = addOperators(num, target);
        System.out.println(result);
    }

    private static List<String> addOperators(String num, int target) {
        List<String> ret = new ArrayList<>();
        if (num.length() == 0) {
            return ret;
        }
        char[] path = new char[num.length() * 2 - 1];
        char[] digits = num.toCharArray();
        int n = 0;
        for (int i = 0; i < digits.length; i++) {
            n = n * 10 + digits[0] - '0';
            path[i] = digits[i];
            dfs(ret, path, i + 1, 0, n, digits, i + 1, target);
            if (n == 0) {
                break;
            }
        }
        return ret;
    }

    private static void dfs(List<String> res, char[] path, int len2, int left, int cur, char[] num, int index, int aim) {
        if (index == num.length) {
            if (left + cur == aim) {
                StringBuilder result = new StringBuilder();
                for (int i = 0; i < len2; i++) {
                    result.append(path[i]);
                }
                res.add(result.toString());
            }
            return;
        }
        int n = 0;
        int j = len2 + 1;
        for (int i = index; i < num.length; i++) {
            n = n * 10 + num[i] - '0';
            path[j] = num[i];
            j++;
            path[len2] = "+".toCharArray()[0];
            dfs(res, path, j, left + cur, n, num, i + 1, aim);
            path[len2] = "-".toCharArray()[0];
            dfs(res, path, j, left + cur, -n, num, i + 1, aim);
            path[len2] = "*".toCharArray()[0];
            dfs(res, path, j, left, cur * n, num, i + 1, aim);
            if (num[index] == 0) {
                break;
            }
        }
    }
}