写个玩具algo

There are several people that will sit around the same table in a

circular fashion. Since all these people are very self-conscious about

their height, you don't want to sit any short person next to a tall one.

To formalize this, we want to minimize the maximum height difference

between 2 adjacent persons.
You will be given the heights of the people as a vector <int>. Return a

vector <int> with the height of each individual in clockwise order of a

seating arrangement that follows the above rule. If there are several

solutions, return the lexicographically first one.

int increaseHeight(vector<int> v,int i,int p); int minIncreasePos(vector<int> v ,int p); int minCos(vector<int> v); int main(); int minCos(vector<int> v) { list<int> vTemp; int i=0; for (;i<3;++i) { vTemp.push_back(v[i]); } while(i<v.size()) { int index=minIncreasePos(vTemp,v[i]); vTemp.insert(vTemp.begin()+index,v[i]); } for (int i=0;i<v.size();i++) { v[i]=vTemp[i]; } } int minIncreasePos(vector<int> v,int p) { int index=-1; int tempI=0; int m=9999; int len=v.size(); for (int i=0;i<len;i++) { tempI=increaseHeight(v,i,p); if (m>tempI) { m=tempI; index=i; } } return index; } int increaseHeight(vector<int> v,int i,int p) { if (i>v.size()) { return; } return abs(p-v[i])+abs(p-v[(i+1)%v.size()])-abs(v[i]-v[(i+1)%v.size()]); }