【leetcode】商品折扣后的最终价格

//C++
class Solution {
public:
    vector<int> finalPrices(vector<int>& prices) {
        vector<int> arr;
        int i,j;
        for(i=0; i<prices.size()-1; i++)
        {
            for(j=i+1; j<prices.size(); j++)
            {
                if(prices[i]>=prices[j]){
                    prices[i]-=prices[j];
                    break;
                }               
            }
        }
        return prices;
    }
};