#include <vector> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param weights int整型vector * @return int整型vector */ vector<int> weightGrowth(vector<int>& weights) { // write code here // 双重遍历 vector<int> v; for(int i=0; i<weights.size(); ++i) { bool flag = false; for(int j=i+1; j<weights.size(); ++j) { if(weights[j]>weights[i]) { v.emplace_back(j-i); flag = true; break; } } if(!flag) v.emplace_back(-1); } return v; } };