LeetCode
林中野
这个作者很懒,什么都没留下…
展开
-
Roman to Integer
#include #include #include main() { char lm[29]; char *p; int num = 0; printf("请输入一个罗马数字: "); gets(lm); p = lm; for(; *p; p++ ) { if(*p== 'C'&& *(p+1)== 'M') {原创 2016-12-13 13:44:39 · 207 阅读 · 0 评论 -
3 Sum Closest
#include #include int fun(int a, int b, int c) { if((a { return 1; } return 0; } main() { int a[3] = {0}; int s[6] = {-1, 0, 1, 2, -1, -4}; int i, j, k; int temp; int t=原创 2016-12-13 22:27:22 · 176 阅读 · 0 评论 -
Longest Common Prefix
#include#include#includemain(){char s[1024][1024], s1[1024];int n = 6;int i , j;int count = 0;for(i = 0; i < n; i++){gets(s[i]); } for(i = 0; i < strlen(s[0]); i++) { for(j = 1; j < n; j++) { if(s[j][原创 2016-12-13 23:33:08 · 152 阅读 · 0 评论 -
[LeetCode] Letter Combinations of a Phone Number 电话号码的字母组合
待更新原创 2016-12-13 23:42:27 · 223 阅读 · 0 评论 -
[LeetCode] Valid Parentheses 验证括号
#include #include main() { char s1[1024]; char *p1; int count1=0, count2=0, count3=0, count4=0; int i, j, k; char *p2, *p3, *p4, *p5; gets(s1); p1 = s1;原创 2016-12-14 00:32:43 · 153 阅读 · 0 评论