README.md

78. Subsets

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], [] ] 

Solutions (Rust)

1. Solution

implSolution{pubfnsubsets(nums:Vec<i32>) -> Vec<Vec<i32>>{letmut ret = vec![vec![]];for num in nums {letmut temp = ret.clone(); temp.iter_mut().for_each(|x| x.push(num)); ret.append(&mut temp);} ret }}