给出n和m，设计一个算法，给出所有n个数相加和为m的所有情况,Java实现。

参考代码

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

public class SumCombination {

    public static List<List<Integer>> findSumCombinations(int n, int m) {
        List<List<Integer>> result = new ArrayList<>();
        backtrack(result, new ArrayList<>(), n, m, 0, 0);
        return result;
    }

    private static void backtrack(List<List<Integer>> result, List<Integer> currentList, int n, int m, int start, int sum) {
        if (currentList.size() == n && sum == m) {
            result.add(new ArrayList<>(currentList));
            return;
        }

        if (currentList.size() < n) {
            for (int i = start; i <= m - (n - currentList.size()) * start; i++) {
                currentList.add(i);
                backtrack(result, currentList, n, m, i, sum + i);
                currentList.remove(currentList.size() - 1); // 回溯，移除当前尝试的数
            }
        }
    }

    public static void main(String[] args) {
        int n = 4;
        int m = 10;
        List<List<Integer>> combinations = findSumCombinations(n, m);
        for (List<Integer> combination : combinations) {
            System.out.println(combination);
        }
    }
}