Merge pull request xxg1413#30 from willalways/master

No.xx

Author: willalways

10.Regular Expression Matching/shadowcoder/data.txt

@@ -0,0 +1,39 @@
+"aa"
+"a"
+
+"aa"
+"aa"
+
+"aaa"
+"aa"
+
+"aa"
+"a*"
+
+"aa"
+".*"
+
+"ab"
+".*"
+
+"aab"
+"c*a*b"	
+
+"aaa"
+"ab*a*c*a"
+
+
+"abcdede"
+"ab.*de"
+
+"a"
+"ab*"
+
+"ab"
+".*c"
+
+"ab"
+".*.."
+
+"bbab"
+"b*a*"

10.Regular Expression Matching/shadowcoder/head.h

@@ -0,0 +1,5 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <math.h>

10.Regular Expression Matching/shadowcoder/regex.c

@@ -0,0 +1,43 @@
+#include "head.h"
+char *nextlogiceq(char s, char *p)
+{
+	if (!*p) return NULL;
+	if (*p == '.' || s == *p) return p;
+	if (p[1] == '*') return nextlogiceq(s, p + 2);
+	return NULL;
+}
+
+int isMatch(char* s, char* p) 
+{
+	while (*p && *s) {
+		if (p[1] != '*') {
+			if (*p == '.' || *s == *p) 
+				p++,s++;
+			else
+				return 0;
+		} else {
+			if (*p != '.' && *s != *p) {
+			    p += 2;
+			    continue;
+			}
+			char *tmp = nextlogiceq(*s, p + 2);
+			if (tmp)
+				if (isMatch(s, tmp)) return  1;
+			s += 1;
+			continue;
+		}
+	}
+
+	if (*s) return 0;
+	while (*p)
+		if (p[1] == '*') p+=2;
+		else return 0;
+	return 1;
+}
+
+int main(int argc, char *argv[])
+{
+	char s[] = {"bbab"};
+	char p[] = {"b*a*"};
+	printf("%d\n", isMatch(s, p));
+}

11.Container With Most Water/shadowcoder/mywater.c

@@ -0,0 +1,20 @@
+#define MIN(x,y) ((x) > (y)? (y) : (x))
+int maxArea(int* height, int heightSize)
+{
+    int area = 0;
+    int maxi, max = 0;
+    int i, j, k;
+    for (i = 0; i < heightSize; i++)
+	    if (height[i] > max) {
+	    	max = height[i];
+		maxi = i;
+	    }
+
+    for (i = 0; i <= maxi; i++) {
+    	for (j = heightSize - 1; j >= maxi; j--) {
+		k = MIN(height[i], height[j]) * (j - i);
+		if (k > area) area = k;
+	}
+    }
+    return area;
+}

11.Container With Most Water/shadowcoder/water.c

@@ -0,0 +1,21 @@
+#include "head.h"
+#define MIN(x,y) ((x) > (y)? (y) : (x))
+
+int maxArea(int* height, int heightSize)
+{
+    int area = 0, k;
+    int i = 0, j = heightSize - 1;
+    while (i < j) {
+    	k = MIN(height[i], height[j]) * (j - i);
+	if (k > area) area = k;
+	if (height[i] <= height[j]) i++;
+	else j--;
+    }
+    return area;
+}
+
+int main(int argc, char *argv[])
+{
+	int i[] = {1, 3, 5, 7, 9};
+	printf("%d\n", maxArea(i, 5));
+}

12.Integer to Roman/shadowcoder/head.h

@@ -0,0 +1,5 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <math.h>

12.Integer to Roman/shadowcoder/roman.c

@@ -0,0 +1,46 @@
+#include "head.h"
+int lt1000(char *result, int num, int level, char n1, char n2, char n3)
+{
+	int k = 0;
+	while (num >= level) {
+		if (num >= 9 * level) {
+			result[k++] = n1;
+			result[k++] = n3;
+			num -= 9 * level;
+		} else if(num >= 5 * level) {
+			result[k++] = n2;
+			num -= 5 * level;
+		} else if(num >= 4 * level) {
+			result[k++] = n1;
+			result[k++] = n2;
+			num -= 4 * level;
+		} else if(num >= level) {
+			while (num >= level) {
+				result[k++] = n1;
+				num -= level;
+			}
+		}
+	}
+	return k;
+}
+char* intToRoman(int num) 
+{
+	int k = 0;
+	static char out[16];
+	while (num >= 1000) {
+		out[k++] = 'M';
+		num -= 1000;
+	}
+	if(num >= 100) k += lt1000(out + k, num % 1000, 100, 'C', 'D', 'M');
+	if(num >= 10) k += lt1000(out + k, num % 100, 10, 'X', 'L', 'C');
+	if(num >= 1) k += lt1000(out + k, num % 10, 1, 'I', 'V', 'X');
+	out[k] = 0;
+	return out;
+}
+
+int main(int argc, char *argv[])
+{
+	//printf("%s\n", intToRoman(atoi(argv[1])));
+	printf("%s\n", intToRoman(1000));
+	return 0;
+}

13.Roman to Integer/shadowcoder/head.h

@@ -0,0 +1,5 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <math.h>

13.Roman to Integer/shadowcoder/roman2int.c

@@ -0,0 +1,33 @@
+#include "head.h"
+int romanToInt(char* s) 
+{
+	int ret = 0;
+	int alpha[26] = {0};
+	alpha['I' - 'A'] = 1;
+	alpha['V' - 'A'] = 5;
+	alpha['X' - 'A'] = 10;
+	alpha['L' - 'A'] = 50;
+	alpha['C' - 'A'] = 100;
+	alpha['D' - 'A'] = 500;
+	alpha['M' - 'A'] = 1000;
+	while (*s && *s == 'M') {
+		ret += 1000;
+		s++;
+	}
+	while (*s && s[1]) {
+		if (alpha[s[0] - 'A'] < alpha[s[1] - 'A']) {
+			ret += alpha[s[1] - 'A'] - alpha[s[0] - 'A'];
+			s += 2;
+		} else {
+			ret += alpha[s[0] - 'A'];
+			s ++;
+		}
+	}
+	if (*s) ret += alpha[s[0] - 'A'];
+	return ret;
+}
+
+int main(int argc, char *argv[])
+{
+	return printf("%d\n", romanToInt(argv[1]));
+}

14.Longest Common Prefix/shadowcoder/head.h

@@ -0,0 +1,5 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#include <math.h>