Feature: optimized Permutations

Author: devbins

46Permutations.org

@@ -85,22 +85,22 @@
     class Solution {
     public:
         vector<vector<int>> res;
-    
+
         vector<vector<int>> permute(vector<int>& nums) {
             vector<int> track;
             backTrack(nums, 0, track);
             return res;
         }
-    
-        void backTrack(vector<int>& nums, int index, vector<int>& track) {
+
+        void backTrack(vector<int>& nums, vector<int>& track) {
             if (track.size() == nums.size()) {
                 res.push_back(track);
                 return;
             }
             for (int i = 0; i < nums.size(); ++i) {
                 if (find(track.begin(), track.end(), nums[i]) == track.end()) {
                     track.push_back(nums[i]);
-                    backTrack(nums, index + 1, track);
+                    backTrack(nums, track);
                     track.pop_back();
                 }
             }