- 博客(5)
- 收藏
- 关注
RSS订阅原创 leetcode 938. 二叉搜索树的范围和
/int sum;int rangeSumBST(struct TreeNode root, int L, int R){if(root != NULL){int val = root->val;if(val<L){rangeSumBST(root->right, L, R);}else if(val == L){sum += L;rangeSumBST(root...
2019-09-17 19:13:53
117
原创 leetcode 237. 删除链表中的节点
/*Definition for singly-linked list.struct ListNode {int val;struct ListNode *next;};*/void deleteNode(struct ListNode node) {node->val=node->next->val;node->next=node->next-&g...
2019-09-17 19:12:57
107
原创 leetcode 807. 保持城市天际线
int maxIncreaseKeepingSkyline(int** grid, int gridSize, int* gridColSize){int m = gridSize;int n = gridColSize;int res = 0;int R = (int*)malloc(sizeof(int)m);int C = (int*)malloc(sizeof(int)*n);...
2019-09-17 19:11:20
140
原创 leetcode 1108.IP地址无效化
char * defangIPaddr(char * address){char *ret = malloc(sizeof(char)*22);char *r = ret;while(*address){if(*address == ‘.’){*ret++ = ‘[’;*ret++ = ‘.’;*ret++ = ‘]’;*address++;}else{*ret++ = *ad...
2019-09-17 19:09:27
155
原创 leetcode 771.宝石与石头
int numJewelsInStones(char * J, char * S){int i, j, count=0;for(i=0; i<strlen(J); i++)for(j=0; j<strlen(S); j++)if(J[i] == S[j])count++;return count;}
2019-09-17 19:07:49
119
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人