链接:https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/solution/shua-by-xun-ge-v-hz33/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
题目
示例
思路
解题思路
题意需要对数组进行分组大体有三种思路:
- 哈希表,建立一个以组大小为键,数组下标为元素的哈希表,遍历一次数组,即可完成分组
- 双指针,简称暴力解法,直接遍历数组,遇到相同组就下标加入相同组,满了就换个组加,简单无脑
- 利用排序,将数组下标与组大小捆绑在一起,利用桶排序,将组大小升序排列,然后捡下标就可以了
代码注释超级详细
代码
哈希表
typedef struct Array {//简易哈希表
int *arr;
int pos;
int size;
} Array;
Array* creatArray(int size) {
Array *obj = (Array *)malloc(sizeof(Array));
obj->arr = (int *)malloc(sizeof(int) * size);
obj->size = size;
obj->pos = 0;
return obj;
}
void freeArray(Array *obj) {
free(obj->arr);
free(obj);
}
int** groupThePeople(int* groupSizes, int groupSizesSize, int* returnSize, int** returnColumnSizes){
Array **groups = (Array **)malloc(sizeof(Array *) * (groupSizesSize + 1));
for (int i = 0; i <= groupSizesSize; i++) {//初始化
groups[i] = creatArray(groupSizesSize);
}
for (int i = 0; i < groupSizesSize; i++) {//将元素加入哈希表
int size = groupSizes[i];
groups[size]->arr[groups[size]->pos++] = i;
}
int **groupList = (int **)malloc(sizeof(int *) * groupSizesSize);
*returnColumnSizes = (int *)malloc(sizeof(int) * groupSizesSize);
int pos = 0;
for (int k = 0; k <= groupSizesSize; k++) {//根据哈希表,对相同组进行合并
if (groups[k]->pos == 0) {
continue;
}
int size = k;
int groupCount = groups[k]->pos / size;
for (int i = 0; i < groupCount; i++) {
int *group = (int *)malloc(sizeof(int) * size);
int start = i * size, index = 0;
for (int j = 0; j < size; j++) {
group[index++] = groups[k]->arr[start + j];
}
(*returnColumnSizes)[pos] = size;
groupList[pos++] = group;
}
}
*returnSize = pos;
for (int i = 0; i <= groupSizesSize; i++) {//销毁哈希表
freeArray(groups[i]);
}
return groupList;
}
作者:xun-ge-v
链接:https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/solution/shua-by-xun-ge-v-hz33/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
双指针
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
*/
int** groupThePeople(int* groupSizes, int groupSizesSize, int* returnSize, int** returnColumnSizes){
*returnSize = 0;
int ** ans = (int **)malloc(sizeof(int *) * groupSizesSize);
*returnColumnSizes = (int *)malloc(sizeof(int) * groupSizesSize);//初始化变量
for(int i = 0; i < groupSizesSize; i++)//双指针遍历数组,寻找对于组
{
if(groupSizes[i] == -1)//处理过的元素就没有用了,下面会处理掉,加快检索速度
{
continue;
}
int inode = 0;
int size = groupSizes[i];//保存组大小,防止丢失
(*returnColumnSizes)[*returnSize] = groupSizes[i];
ans[*returnSize] = malloc(sizeof(int) * groupSizes[i]);//初始化变量
for(int j = i; j < groupSizesSize; j++)//找相同组大小元素
{
if(groupSizes[j] == size)//保存下标,并将其处理掉
{
ans[*returnSize][inode++] = j;
groupSizes[j] = -1;
}
if(inode == size)//当前组满了,换下一组
{
break;
}
}
(*returnSize)++;
}
return ans;
}
作者:xun-ge-v
链接:https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/solution/shua-by-xun-ge-v-hz33/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
利用排序
typedef struct {
int index;
int group_nums;
}group;
int Cmp(const void * a, const void * b) //桶排序
{
group * c = (group*)a;
group * d = (group*)b;
if (c->group_nums > d->group_nums) {
return 1;
} else {
return -1;
}
}
int** groupThePeople(int* groupSizes, int groupSizesSize, int* returnSize, int** returnColumnSizes)
{
int index_r = 0;
group Group[groupSizesSize];
*returnSize = 0;
for (int i = 0; i < groupSizesSize; i++) {//先将数组元素与下标捆绑
Group[i].index = i;
Group[i].group_nums = groupSizes[i];
}
qsort(Group, groupSizesSize, sizeof(group), Cmp);//排序
int ** ret = (int **)malloc(groupSizesSize * sizeof(int*));
for (int i = 0; i < groupSizesSize;) {//捡元素,将元素下标按顺序填入即可
int step = Group[i].group_nums;
ret[index_r] = (int*)malloc(step * sizeof(int));
returnColumnSizes[0][index_r] = step;
for (int j = 0; j < step; j++) {
ret[index_r][j] = Group[i++].index;
}
index_r++;
}
*returnSize = index_r;
return ret;
}
作者:xun-ge-v
链接:https://leetcode.cn/problems/group-the-people-given-the-group-size-they-belong-to/solution/shua-by-xun-ge-v-hz33/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。