赎金信
bool canConstruct(char * ransomNote, char * magazine){
int record[26]={0};
int length_ransomNote = strlen( ransomNote );
int length_magazine = strlen( magazine );
if( length_ransomNote > length_magazine ) return false;
int i;
for( i=0; i<length_magazine; i++ )
{
record[magazine[i]-'a']++;
}
for( i=0; i<length_ransomNote; i++ )
{
record[ransomNote[i]-'a']--;
if( record[ransomNote[i]-'a']<0 ) return false;
}
return true;
}
三数之和
int cmp(const void* ptr1, const void* ptr2) {
return *((int*)ptr1) > *((int*)ptr2);
}
int** threeSum(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) {
int **ans = (int**)malloc(sizeof(int*) * 18000);
int ansTop = 0;
if(numsSize < 3) {
*returnSize = 0;
return ans;
}
qsort(nums, numsSize, sizeof(int), cmp);
int i;
for(i = 0; i < numsSize - 2; i++) {
if(nums[i] > 0)
break;
if(i > 0 && nums[i] == nums[i-1])
continue;
int left = i + 1;
int right = numsSize - 1;
while(right > left) {
int sum = nums[right] + nums[left] + nums[i];
if(sum < 0)
left++;
else if(sum > 0)
right--;
else {
int* arr = (int*)malloc(sizeof(int) * 3);
arr[0] = nums[i];
arr[1] = nums[left];
arr[2] = nums[right];
ans[ansTop++] = arr;
while(right > left && nums[right] == nums[right - 1])
right--;
while(left < right && nums[left] == nums[left + 1])
left++;
left++;
right--;
}
}
}
*returnSize = ansTop;
*returnColumnSizes = (int*)malloc(sizeof(int) * ansTop);
int z;
for(z = 0; z < ansTop; z++) {
(*returnColumnSizes)[z] = 3;
}
return ans;
}
四数之和
int comp(const void* a, const void* b) {
return *(int*)a - *(int*)b;
}
int** fourSum(int* nums, int numsSize, int target, int* returnSize, int** returnColumnSizes) {
int** quadruplets = malloc(sizeof(int*) * 1001);
*returnSize = 0;
*returnColumnSizes = malloc(sizeof(int) * 1001);
if (numsSize < 4) {
return quadruplets;
}
qsort(nums, numsSize, sizeof(int), comp);
int length = numsSize;
for (int i = 0; i < length - 3; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
if ((long) nums[i] + nums[i + 1] + nums[i + 2] + nums[i + 3] > target) {
break;
}
if ((long) nums[i] + nums[length - 3] + nums[length - 2] + nums[length - 1] < target) {
continue;
}
for (int j = i + 1; j < length - 2; j++) {
if (j > i + 1 && nums[j] == nums[j - 1]) {
continue;
}
if ((long) nums[i] + nums[j] + nums[j + 1] + nums[j + 2] > target) {
break;
}
if ((long) nums[i] + nums[j] + nums[length - 2] + nums[length - 1] < target) {
continue;
}
int left = j + 1, right = length - 1;
while (left < right) {
long sum = (long) nums[i] + nums[j] + nums[left] + nums[right];
if (sum == target) {
int* tmp = malloc(sizeof(int) * 4);
tmp[0] = nums[i], tmp[1] = nums[j], tmp[2] = nums[left], tmp[3] = nums[right];
(*returnColumnSizes)[(*returnSize)] = 4;
quadruplets[(*returnSize)++] = tmp;
while (left < right && nums[left] == nums[left + 1]) {
left++;
}
left++;
while (left < right && nums[right] == nums[right - 1]) {
right--;
}
right--;
} else if (sum < target) {
left++;
} else {
right--;
}
}
}
}
return quadruplets;
}