This commit is contained in:
chefyuan 2021-04-06 20:00:16 +08:00
parent dad4faeb01
commit d8bb2881d8

View File

@ -39,7 +39,7 @@ class Solution {
//根据增量分组 //根据增量分组
for (int i = 0; i < increment; ++i) { for (int i = 0; i < increment; ++i) {
//这快是不是有点面熟,回去看看咱们的插入排序 //这快是不是有点面熟,回去看看咱们的插入排序
for (int j = i + increment; j < nums.length; ++j) { for (int j = i + increment; j < nums.length; j += increment) {
int temp = nums[j]; int temp = nums[j];
int k; int k;
for (k = j - increment; k >= 0; k -= increment) { for (k = j - increment; k >= 0; k -= increment) {