2023-08-02 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's August LeetCoding Challenge with cpp.

August LeetCoding Challenge 2

Description

Permutations

Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

 

Example 1:

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

Example 2:

Input: nums = [0,1]
Output: [[0,1],[1,0]]

Example 3:

Input: nums = [1]
Output: [[1]]

 

Constraints:

  • 1 <= nums.length <= 6
  • -10 <= nums[i] <= 10
  • All the integers of nums are unique.

Solution

auto speedup = [](){
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  return 0;
}();
class Solution {
public:
  vector<vector<int>> permute(vector<int>& nums) {
    vector<vector<int>> answer;
    sort(nums.begin(), nums.end());
    do {
      answer.push_back(nums);
    } while(next_permutation(nums.begin(), nums.end()));
    return answer;
  }
};

// Accepted
// 26/26 cases passed (4 ms)
// Your runtime beats 70.64 % of cpp submissions
// Your memory usage beats 78.16 % of cpp submissions (7.6 MB)
Algorithm