摘要:
/*方法一:使用额外空间思路与算法开辟一个新字符串。然后从头到尾遍历原字符串,直到找到空格为止,此时找到了一个单词,并能得到单词的起止位置。随后,根据单词的起止位置,可以将该单词逆序放到新字符串当中。如此循环多次,直到遍历完原字符串,就能得到翻转后的结果。*/char * reverseWords( 阅读全文
摘要:
. bool judgeCircle(char * moves){ int n = strlen(moves),int count1=0,count2=0; for (int i=0; i<n; i++) { if (moves[i] == 'U') count1++; else if (moves 阅读全文
摘要:
int romanToInt(char * s){ int* hash = (int*)calloc(26,sizeof(int)); hash['I'-65] = 1; hash['V'-65] = 5; hash['X'-65] = 10; hash['L'-65] = 50; hash['C' 阅读全文
摘要:
bool rotateString(char * A, char * B){ if (strlen(A) != strlen(B)) return false; char* s = (char*)calloc(strlen(A)*2+1,sizeof(char)); strcat(strcat(s, 阅读全文
摘要:
bool judge(int x) { int num=0; while(x) { if (x % 10 == 3 || x % 10 == 4 || x % 10 == 7) return false; else if (x % 10 == 2 || x % 10 == 5 || x % 10 = 阅读全文
摘要:
int* runningSum(int* nums, int numsSize, int* returnSize){ for (int i=1; i<numsSize; i++) nums[i] += nums[i-1]; *returnSize = numsSize; return nums; } 阅读全文
摘要:
bool isSameTree(struct TreeNode* p, struct TreeNode* q){ if (!p && !q) return true; if(!p || !q || p->val != q->val) return false; return isSameTree(p 阅读全文
摘要:
int searchInsert(int* nums, int numsSize, int target){ for (int i=0; i<numsSize; i++) if (nums[i] >= target) return i; return numsSize; } 阅读全文
摘要:
struct TreeNode* searchBST(struct TreeNode* root, int val){ if (!root)?NULL: return (root->val==val)?root:(root->val<val)?searchBST(root->right,val):s 阅读全文