1. 两数之和
int* twoSum(int* nums, int numsSize, int target, int* returnSize){
for (int i=0; i<numsSize-1;i++) {
for (int j=i+1; j<numsSize;j++) {
if (nums[i]+nums[j] == target) {
returnSize = malloc(sizeof(int) *2);
if (returnSize == NULL) return NULL;
returnSize[0] = i;
returnSize[1] = j;
return returnSize;
}
}
}
return NULL;
}
9. 回文数
#include <stdio.h>
bool isPalindrome(int x){
char str[25];
sprintf(str, "%d", x);
int len = strlen(str);
for (int i=0; i<(len+1)/2; i++) {
if (str[i] != str[len-1-i])
return false;
}
return true;
}
13. 罗马数字转整数
int romanToInt(char * s){
int sum = 0;
int len;
if (s == NULL)
return -1;
len = strlen(s);
for(int i=0; i<len; i++) {
switch (s[i]) {
case 'I':
if (i<=len-2 && s[i+1]=='V') {
i++;
sum = sum +4;
} else if (i<=len-2 && s[i+1]=='X') {
i++;
sum = sum +9;
} else {
sum = sum +1;
}
break;
case 'V':
sum = sum +5;
break;
case 'X':
if (i<=len-2 && s[i+1]=='L') {
i++;
sum = sum +40;
} else if (i<=len-2 && s[i+1]=='C') {
i++;
sum = sum +90;
} else {
sum = sum +10;
}
break;
case 'L':
sum = sum +50;
break;
case 'C':
if (i<=len-2 && s[i+1]=='D') {
i++;
sum = sum +400;
} else if (i<=len-2 && s[i+1]=='M') {
i++;
sum = sum +900;
} else {
sum = sum +100;
}
break;
case 'D':
sum = sum +500;
break;
case 'M':
sum = sum +1000;
break;
default:
break;
}
}
return sum;
}
14. 最长公共前缀
char * longestCommonPrefix(char ** strs, int strsSize){
#define MAX_NUM 200
char *ret = (char *)calloc(1, MAX_NUM);
if (ret == NULL)
return NULL;
if (strsSize == 1) {
strcpy(ret, strs[0]);
return ret;
}
for (int i=0;i<MAX_NUM;i++) {
for (int j=1;j<strsSize;j++) { //第j个字符串
if (strs[j][i] == strs[0][i] && strs[0][i] != '\0')
continue;
else {
if (i == 0)
strcpy(ret, "");
else
strncpy(ret, strs[0], i);
return ret;
}
}
}
strcpy(ret, "");
return ret;
}
20. 有效的括号
bool isValid(char * s){
char a[10000]={0};
unsigned int i = 0, j = 0;
while(s[i]) {
if (s[i] == '{') {
a[j] = '}';
j++;
} else if (s[i] == '(') {
a[j] = ')';
j++;
} else if (s[i] == '[') {
a[j] = ']';
j++;
} else if (s[i] == '}' ||s[i] == ')' || s[i] == ']') {
if (j>=1 && a[j-1] == s[i]) j--;
else return false;
}
i++;
}
if (j == 0) return true;
else return false;
}