This module provides a function to generate all possible distinct permutations of a given collection of integers using a backtracking algorithm. Generates all possible distinct permutations of a given vector of integers. # Arguments `nums` - A vector of integers. The input vector is sorted before generating permutations to handle duplicates effectively. # Returns A vector containing all possib
(mut nums: Vec<isize>)
source not stored for this graph (policy: none)
nothing calls this directly
no test coverage detected