A Journey 2 Eternity

char* StrStr(const char *str, const char *target) 
{
	char *cp = (char *) str;
	char *s1, *s2;

	if ( !*target ) {
		return ((char *)str);
	}

	while (*cp)
	{
		s1 = cp;
		s2 = (char *) target;

		while ( *s1 && *s2 && (*s1 == *s2) ) {
			++s1;
			++s2;
		}

		if (!*s2) {
			return cp;
		}

		++cp;
	}

	return NULL;
}

Implement a method to perform basic string compression using the counts of repeated characters. For example string “aabcccccaaa” would become “a2b1c5a3“. If the compressed string would not become smaller then original string then return the original string.

 int CountCompression(string str)
{
	char last = str.at(0);
	int size = 0, count = 1;

	for (int i = 1; i < str.length(); i++)
	{
		if(str.at(i) == last) {
			count++;
		} else {
			last = str.at(i);
			size += 1 + to_string(count).length();
			count = 1;
		}
	}

	// we need to count the very last set of repeated character sets
	size += 1 + to_string(count).length();

	return size;
}

string Compress(string str)
{
	int size = CountCompression(str);
	if(size >= str.length())
		return str;

	string compressStr;
	char last = str.at(0);
	int count = 1;

	for (int i = 1; i < str.length(); i++)
	{
		if (str.at(i) == last) {
			count++;
		} else { // insert char count and update the last char
			compressStr += last;
			compressStr += to_string(count);
			last = str.at(i);
			count = 1;
		}
	}

	// we need to update the very last set of repeated character sets
	compressStr += last;
	compressStr += to_string(count);

	return compressStr;
}

We are going to write a method to replace all spaces in a string with “%20”. We assume that the string have sufficient space.

void ReplaceSpaces(char *str) 
{
	int length = strlen(str);
	int nSpaces = 0, newLength = 0;
	for (int i = 0; i < length; i++)
	{
		if(str[i] == ' ') ++nSpaces;
	}

	newLength = length + nSpaces * 2;
	str[newLength] = '\0';

	for (int i = length - 1 ; i >= 0; i--)
	{
		if (str[i] == ' ')
		{
			str[newLength - 1] = '0';
			str[newLength - 2] = '2';
			str[newLength - 3] = '%';
			newLength -= 3;
		} else {
			str[newLength - 1] = str[i];
			newLength -= 1;
		}
	}
}