摘要：
题目 Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums = 阅读全文
摘要：
题目 Given an integer array nums that may contain duplicates, return all possible subsets (the power set). The solution set must not contain duplicate s 阅读全文
摘要：
题目 Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. R 阅读全文
摘要：
题目 Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any o 阅读全文
摘要：
题目 Given an m x n matrix board containing 'X' and 'O', capture all regions that are 4-directionally surrounded by 'X'. A region is captured by flippin 阅读全文