《真·力扣来的题解》

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;

class Solution{//力扣写法，及时复盘
public:
    int Count_of_swapping(vector<int>& nums){
        int count=0;
        while(!is_sorted(nums.begin(),nums.end())){
            for (int i=0;i<nums.size()-1;i++){
                if (nums[i]>nums[i+1]){swap(nums[i],nums[i+1]);count++;}
            }
        }
        return count;
    }
};
int main(){//力扣后台进行复盘
    Solution stock;//定义力扣复盘对象
    vector<int>array;
    int n;
    cin>>n;
    while(n--){
        int object;
        cin>>object;
        array.push_back(object);
    }
    cout<<stock.Count_of_swapping(array);
    return 0;
}