[GeeksforGeeks]Remove all adjacent duplicates

Given a string, recursively remove adjacent duplicate characters from string. The output string should not have any adjacent duplicates.

Input:  azxxzy
Output: ay
First "azxxzy" is reduced to "azzy". The string "azzy" contains duplicates, 
so it is further reduced to "ay".

Input: geeksforgeeg
Output: gksfor
First "geeksforgeeg" is reduced to "gksforgg". The string "gksforgg" contains 
duplicates, so it is further reduced to "gksfor".

Input: caaabbbaacdddd
Output: Empty String

Input: acaaabbbacdddd
Output: acac

非递归O(n)解：

char *remove2(char *s)
{
	char t;
	int i = 0, j = 0, l = strlen(s);
	if (l < 2) return s;
	while (s[j]) {
		t = s[j];
		if (t == s[j + 1]) {
			while (s[j] == t) j++;
		} else {
			if (i && s[i - 1] == s[j]) i--, j++;
			else s[i++] = s[j++];
		}
	}
	s[i] = 0;
	return s;
}