78. Subsets (not use befroe, so int I = start, dfs(i+1)
subset: ๅ ็ด unique, ไธไฝฟ็จ้่คๆธๅญ
subset, ไธๅ ่จฑไฝฟ็จ้่คๆธๅญ
with int i = start, dfs(i+1) to next level, ไธๅฑคๆ้ธ็ๆธๅญๅฟ ๅฎๆฏๆฒ็จ้, ๆไปฅไธๆๆ้่ค
time: O(2^n) or O(2^n*n) , the subset's count is 2^n
space: O(2^n) or O(2^n*n)
Previous39. Combination Sum (not use befroe, so int I = start, dfs(i) -> is i !!Next77. Combinations (not use before, so int I = start, dfs(i+1
Last updated