摘要:
力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台 /** * Note: The returned array must be malloced, assume caller calls free(). */ int cmp(const void * a, const void * b) 阅读全文
摘要:
#include <stdio.h> int main () { char* s = "hello"; // 字符串名字就是首地址 printf("%x\n",s); // s是char指针,size = 4 or 8 printf("sizeof s is %d\n", sizeof(s)); / 阅读全文
摘要:
167. 两数之和 II - 输入有序数组 - 力扣(LeetCode) /** * Note: The returned array must be malloced, assume caller calls free(). */ int* twoSum(int* numbers, int num 阅读全文
摘要:
力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台 /** * Note: The returned array must be malloced, assume caller calls free(). */ int* intersection(int* nums1, int nums1 阅读全文
摘要:
26. 删除有序数组中的重复项 - 力扣(LeetCode) int checkIn(int* nums, int numsSize, int target) { for (int i = 0; i < numsSize; i++) { if (nums[i] == target) { return 阅读全文
摘要:
27. 移除元素 - 力扣(LeetCode) int removeElement(int* nums, int numsSize, int val){ int left = 0; int right = 0; while (right < numsSize){ if (nums[right] != 阅读全文
摘要:
int search(int* nums, int numsSize, int target){ int left = 0; int right = numsSize - 1; int middle; while (left <= right){ middle = (left + right) / 阅读全文