题解 | #牛的生长情况#

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

我觉得两层遍历界搞定了