We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Absolute Permutation
  5. Discussions

Absolute Permutation

  • anarod_val25
     + 0 comments

    c++

    vector<int> absolutePermutation(int n, int k) {    
    vector<int> permuted(n,0);
    vector<bool> ussage(n,false);
    
    for (int i = 1; i<=n; i++){
        
        if(i-k>0 && ussage[i-k-1]==false){
            permuted[i-k-1] = i;
            ussage[i-k-1] = true;
        }else if(i+k<=n && ussage[i+k-1]==false){
            permuted[i+k-1] = i;
            ussage[i+k-1] = true;
        }else{
            return {-1};
        }       
    }
    
    
    return permuted;
}