chefyuan
parent
dad4faeb01
commit
d8bb2881d8
|
@ -39,7 +39,7 @@ class Solution {
|
|||
//根据增量分组
|
||||
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 k;
|
||||
for (k = j - increment; k >= 0; k -= increment) {
|
||||
|
|
Loading…
Reference in New Issue