public void sort(int[] nums) {
        if(nums == null || nums.length < 2) return;
        int n = nums.length;
        for (int i = n - 1; i >= 0; i--) {//每次排序最后位置元素一定是最大值
            for (int j = 1; j <= i; j++) {
                if(nums[j - 1] > nums[j])
                    swap(nums,j - 1,j);
            }
        }
}
    private void swap(int[] nums,int left,int right) {
        int tmp = nums[left];
        nums[left] = nums[right];
        nums[right] = tmp;
}