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

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

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

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

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

摘要：把交叉点的坐标求出来即可。#define max(a,b) ( (a)>(b)?(a):(b) )#define min(a,b) ( (a)upx||downy>upy)crossArea=0; else crossArea=(upx-downx)*(upy-downy); all... 阅读全文

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

摘要：dp.#define MAX 1000int rowLeft[MAX][MAX];int colUp[MAX][MAX];int dp[MAX][MAX];void calRow(char **matrix,int matrixRowSize,int matrixColSize){ int i... 阅读全文

摘要：编程之美上一样的题目。寻找发帖水王。利用分治的思想。int majorityElement(int* nums, int numsSize) { int candidate; int nTimes,i; for(i=0,nTimes=0;i<numsSize;i++){ ... 阅读全文

摘要：很简单的26进制问题int titleToNumber(char* s) { int sum=0,temp; char *p=s; while(*p!='\0'){ sum=sum*26+(*p-'A'+1); p++; } return sum;} 阅读全文

摘要：#include #include #include #define MAX 1000int cmp(char *s1,char *s2){ char temp1[100]; char temp2[100]; strcpy(temp1,s1); strcat(temp1,s2... 阅读全文