肉丝r0ysue大数据安全技术算法实战入门
if (nums == null || nums.length == 0) {
return;
}
for (int i = 1; i < nums.length; i++) {
int j = i - 1;
int key = nums[i];
while (j >= 0 && nums[j] > key) {
nums[j + 1] = nums[j];
j--;
}
nums[j + 1] = key;
}
}}
