数列的排列/组合/组合sum问题

• 从数列中找到k个数的全排列情况

  private void doAllRange(LinkedList<Integer> path, int[] nums, int k,
      List<List<Integer>> r) {
    if (path.size() == k) {
      r.add(new ArrayList<>(path));
      return;
    }

    for (int i = 0; i < nums.length; i++) {
      if (path.contains(nums[i])) {
        continue;
      }
      path.add(nums[i]);
      doAllRange(path, nums, k, r);
      path.removeLast();
    }
  }

• 从数列中找到k个数的全组合情况
• 组合和排列的区别是：组合不强调顺序，排序含有顺序的含义

private void doAllRange(LinkedList<Integer> path, int[] nums, int k, int start,
      List<List<Integer>> r) {
    if (path.size() == k) {
      r.add(new ArrayList<>(path));
      return;
    }
    for (int i = start; i < nums.length; i++) {
      if (path.contains(nums[i])) {
        continue;
      }
      path.add(nums[i]);
      doAllRange(path, nums, k, i + 1, r);
      path.removeLast();
    }
  }

• k个数的sum = target的全部情况
• 与二叉树中根-叶子节点的sum在函数开始path.add()/sum+=不同，数列的组合sum在循环中。

private void doSumkRange(LinkedList<Integer> path, int[] nums, int k, int start, int target,
      int sum,
      List<List<Integer>> r) {
    if (path.size() == k && sum == target) {
      r.add(new ArrayList<>(path));
      return;
    }
    for (int i = start; i < nums.length; i++) {
      if (path.contains(nums[i])) {
        continue;
      }
      path.add(nums[i]);
      sum += nums[i];
      doSumkRange(path, nums, k, i + 1, target, sum, r);
      path.removeLast();
      sum -= nums[i];
    }
  }