leetcode # 78 subset

Given a set of distinct integers, nums, return all possible subsets (the power set).

Note: The solution set must not contain duplicate subsets.

Example:

Input: nums = [1,2,3]
Output:
[
[3],
[1],
[2],
[1,2,3],
[1,3],
[2,3],
[1,2],
[]
]/

本题用到backtracking
看别人的思路解出但是不明白的是为什么结果
一次走一边走到1，2，3 后 如何变为1，3？
[[],[1],[1,2],[1,2,3],[1,3],[2],[2,3],[3]]

1

class Solution {
    public List<List<Integer>> subsets(int[] nums) {
         List<List<Integer>> res = new ArrayList<>();
         List<Integer> temp = new ArrayList<>();
        dfs(res,temp, nums, 0);
        return res;
    }
    
    private void dfs(List<List<Integer>> res, List<Integer> temp, int[] nums, int j) {
    
        res.add(new ArrayList<Integer>(temp));
        for(int i= j ; i < nums.length;i++){
            temp.add(nums[i]);
              dfs(res,temp, nums, i+1);
             temp.remove(temp.size() - 1); 
        }
    }
}