Beautiful Arrangement II

Construct a permutation of 1..n such that the multiset of absolute differences between consecutive elements contains exactly k distinct values. The typical challenge is to design a sequence (commonly by alternating low/high to produce k distinct gap sizes, then filling the remainder sequentially) that yields precisely k distinct adjacent differences.