LYYF177的博客

Find All Numbers Disappeared in an Array题目分析：这也是跟前面有道题类似，用数组参数表达原数组元素。int* findDisappearedNumbers(int* nums, int numsSize, int* returnSize){ char * temp = (char *)malloc(numsSize*sizeof(char)); int * result = (int *)malloc(numsSize*sizeof(int)).

Third Maximum Number题目分析：创建三个变量分别保存数组中从大到小的前三个数，并计数。最后判断计数即可。int thirdMax(int* nums, int numsSize){ long num_1=LONG_MIN, num_2=LONG_MIN, num_3=LONG_MIN; int count=0; for(int j=0; j<numsSize; j++){ if(nums[j] > num_1){ .

Intersection of Two Arrays II题目分析：与349的区别是相同元素的出现次数也要相同。可以用哈希表创建保存元素值和出现个数，但是对于C语言来说哈希表很麻烦，所以直接用qsort先对两个数组排序，再使用双指针进行比较。int cmpfunc(const void * a, const void * b){ return (*(int*)a - *(int*)b);}int* intersect(int* nums1, int nums1Size, int* nums.

Intersection of Two Arrays题目分析：取小的那个数组创建空间，创建一个数组可以记录个数小的那个数组中的各个值标记为1，遍历第二个数组比较是否有相同元素的数组并放入res空间中输出。int* intersection(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize){ int i, j = 0; int size = nums1Size < nums2Si.

Range Sum Query - Immutable题目分析：创建指针数组并分配合适的空间，计算好数组里元素的和，比如2-5之间的值用0-5的和减0-2的和。typedef struct { int *sum; int size;} NumArray;NumArray* numArrayCreate(int* nums, int numsSize) { NumArray *na = calloc(1, sizeof(NumArray)); na->su.

Move Zeroes题目分析：将数组中所有的0元素移动到数组尾部。直接想法先判断是否为后移位，再根据位置再补0。void moveZeroes(int* nums, int numsSize){ if(numsSize < 2) return nums; int j = 0; for(int i = 0; i < numsSize; i++) { if(nums[i] != 0) { .

Missing Number题目分析：直接想法，因为数组肯定会少一个数字，所以直接数组累加求和被加和减去就是缺少的数字int missingNumber(int *arr,int arrSize) { int nSum=0; int sum=0; int total=0; for (int i=0;i<arrSize+1;i++) { nSum+=i; } for (int i=0;i<arrSize;i++) { su.

博主日常leetcode学习记录分享，仅供学习参考

Contains Duplicate题目要求查找数组中是否有两个相同的元素。首先想到的是双遍历比较，不过这样时间和空间复杂度都太大。可以先对数组进行排序再逐次比较相邻的两个元素。int cmp(const int* a, const int* b){ return *a - *b;}bool containsDuplicate(int* nums, int numsSize) { qsort(nums, numsSize, sizeof(int), cmp); if (n.

Excel Sheet Column Number分别计算每一位后*26再加上最后一位，简单粗暴。效果也确实一般般。int titleToNumber(char * columnTitle){ if(columnTitle == 0)return NULL; int len = strlen(columnTitle); int sum = 0; int i,j,k; for(i=0;i<len;i++) { k=1; .

Majority Element用一个状态变量记录顺序记录相同元素个数并用作判断。但是好像并没有判断出是否是大于一半的数量。int majorityElement(int* nums, int numsSize){ int major = -1; int cnt = 0; for (int i = 0; i < numsSize; i++) { if (major == -1 && cnt == 0) .

Excel Sheet Column Titlechar *convertToTitle(int n) { int i = 0; char *ch = malloc(255); char *ch1 = malloc(255); memset(ch, 0, sizeof(ch)); memset(ch1, 0, sizeof(ch1)); while(n > 0){ n--; *(ch + i) = (n%26) +.

Two Sum II - Input Array Is Sorted分别从两头向中间比较。/** * Return an array of size *returnSize. * Note: The returned array must be malloced, assume caller calls free(). */int* twoSum(int* numbers, int numbersSize, int target, int* returnSize) { int i;.

Min Stacktypedef struct Stack{ int data; int min; struct Stack *next;} MinStack;MinStack* minStackCreate() { MinStack *ptr = malloc(sizeof(MinStack)); ptr->next = NULL; ptr->min = INT_MAX; return ptr;}void minSt.

Min Stacktypedef struct Stack{ int data; int min; struct Stack *next;} MinStack;MinStack* minStackCreate() { MinStack *ptr = malloc(sizeof(MinStack)); ptr->next = NULL; ptr->min = INT_MAX; return ptr;}void minSta.

void func(struct TreeNode* root, int* res, int* index){ if(NULL == root) return; func(root->left, res, index); func(root->right, res, index); res[(*index)++] = root->val;}int* postorderTraversal(struct TreeNode* root, int* retu.

递归。void func(struct TreeNode* root, int* res, int* index){ if(NULL == root) return; res[(*index)] = root->val; (*index)++; func(root->left, res, index); func(root->right, res, index);}int* preorderTraversal(struct TreeNode.