llllmz

摘要： \ bool isUnique(char* astr){ int temp[26]={0}; for(int i=0;i<strlen(astr);i++){ temp[astr[i]-'a']++; } for(int i=0;i<26;i++){ if(temp[i]>1) return fal 阅读全文

摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ bool hasCycle(struct ListNode *head) { struct 阅读全文

摘要： 回文串 置逆，栈，双指针。 bool judge(char c){ if(c>='a'&&c<='z') return true; if(c>='A'&&c<='Z') return true; if(c>='0'&&c<='9') return true; return false; } bool 阅读全文

摘要： int singleNumber(int* nums, int numsSize) { int t=nums[0]; for(int i=1;i<numsSize;i++) t=t^nums[i]; return t; } 结果： 阅读全文

摘要： int sum(int num1, int num2){ return num1+num2; } 阅读全文

摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* pre; bool judge(struct ListN 阅读全文

摘要： char findTheDifference(char* s, char* t) { int temps[26]={0}; int tempt[26]={0}; int n1=strlen(s),n2=strlen(t); for(int i=0;i<n1;i++) temps[s[i]-'a']+ 阅读全文

摘要： /** * Note: The returned array must be malloced, assume caller calls free(). */ void reverse(int* a,int n){ int head=0,tail=n-1; while(head<=tail){ in 阅读全文

摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ int pre; struct ListNode* f(struct ListNode* 阅读全文

摘要： 特好的题目，进制转化就刷它。 void reverse(char* s){ int n=strlen(s); int head=0,tail=n-1; while(head<=tail){ char t=s[head]; s[head]=s[tail]; s[tail]=t; head++; tai 阅读全文

摘要： int cmp(const void* a,const void* b){ return *(int*)a-*(int*)b; } int majorityElement(int* nums, int numsSize) { qsort(nums,numsSize,sizeof(int),cmp); 阅读全文

摘要： bool isPalindrome(int x) { char c[1000]={0}; sprintf(c,"%d",x); int n=strlen(c); int head=0,tail=n-1; while(head<=tail){ if(c[head]!=c[tail]) return f 阅读全文

摘要： /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* mergeTwoLists(struct ListNod 阅读全文

摘要： char* longestCommonPrefix(char** strs, int strsSize) { int index=1,min=INT_MAX; if(strsSize==1) return strs[0]; while(index<strsSize){ int i=0; while( 阅读全文

摘要： int romanToInt(char* s) { int n=strlen(s); int c[26]; c['I'-'A']=1; c['V'-'A']=5; c['X'-'A']=10; c['L'-'A']=50; c['C'-'A']=100; c['D'-'A']=500; c['M'- 阅读全文

摘要： int max(int i,int j){ if(i>j) return i; return j; } int maxProfit(int* prices, int pricesSize) { int** dp=(int**)malloc(sizeof(int*)*pricesSize); for( 阅读全文

摘要： char * mergeAlternately(char * word1, char * word2){ int n1=strlen(word1),n2=strlen(word2); char* temp=(char*)malloc(sizeof(char)*(n1+n2+1)); int inde 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： 脑残了，参数传错了，debug了半天。 /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: B 阅读全文

摘要： /** * Note: The returned array must be malloced, assume caller calls free(). */ char c[10][10]={" "," ","abc\0","def\0","ghi\0","jkl\0","mno\0","pqrs\ 阅读全文

摘要： /** * Return an array of arrays of size *returnSize. * The sizes of the arrays are returned as *returnColumnSizes array. * Note: Both returned array a 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* bu 阅读全文

摘要： /** * Definition for a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */ struct TreeNode* tr 阅读全文