鍩虹珯鎺у埗鍣�

ckage com.leetcode; import java.util.ArrayList; import java.util.List; public class _0078_Subsets { private List> res = new ArrayList<>(); private List tmp = new ArrayList<>(); public List> subsets(int[] nums) { dfs(nums, 0); return res; } private void dfs(int[] nums, int index) { res.add(new ArrayList<>(tmp)); for (int i = index; i < nums.length; i++) { tmp.add(nums[i]); dfs(nums, i + 1); tmp.remove(tmp.size() - 1); } } }

---

抱歉，此页面的内容受版权保护，复制需扣除次数，次数不足时需付费购买。

如需下载请点击：点击此处下载

关闭

扫码付费即可复制
X

• 在通信搜索中检索“鍩虹珯鎺у埗鍣ā�

鐗规�ф枃妗� | SA鐗规�ф枃妗� | MR鏁版嵁 | AAU 64T64R | gNV | S | codeword | 璋冨埗 | 璋冨埗鏄犲皠 | Packet Switched Channels | 涓嬭浇閫熺巼 | cn-Domain: ps |