leetcode Next Permutation

#include <algorithm>

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        int n = num.size()-1;
        for (auto i=num.end()-2;i>=num.begin();i--){
            if ((*i)>=(*(i+1))) continue;
            else {
                auto min_ptr = i+1;
                for (auto j = i+1;j<num.end();j++){
                    if (*j < *min_ptr  && *j > *i) min_ptr = j;
                }
                int temp = *min_ptr;
                *min_ptr = *i;
                *i = temp;
                
                sort(i+1,num.end());
                return;
            }
        }
        sort(num.begin(),num.end());
        
    }
};