public class Solution {
/**
* @param A an integer array
* @return void
*/
public void sortIntegers(int[] A) {
// Write your code here
if (A == null) return;
for(int i = 0; i < A.length; i++){ //不断地浮出最小数
for(int j = i+1; j < A.length; j++){
if(A[i] > A[j]){
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
}
}
}
}
}
lintcode/leetcode由易至难第2题:冒泡排序
最新推荐文章于 2023-02-20 22:06:04 发布