将一个无空格的句子分词

给定一个无空格的句子，如“thereisastoneontheroad”，和一个能判断一个字符串是否是合法单词的函数isWord(char*start, char*end)。要求把这个句子分词，即，输出结果是"there is a stone on the road"。

思路：用递归/回溯的方法进行解决。

代码如下：

#include "stdlib.h"
#include "stdio.h"

char* str1 = "thereisastoneontheroad";
char* str2;
// str2 ="there is a stone on the road";

void partition(char* str1, char* str2, int n)
{// str1: the start point of string to be partitioned
 // str2: the start point of the resulting string
 // n: the current length of the string starting at str2

	if(*str1=='\0')
	{
		*(str2+n)='\0';
		printf("%s",str2);
	}

	for(char* i=str1; *i!='\0'; i++)
		if(isWord(str1, i))// is the string (starting at str1) and (ending at i) is a valid word?
		{
			*(str2+n+i-str1) = *i;   // copy letter
			*(str2+n+i-str1+1) = ' ';   // separate words by white space
			partition(i+1, str2, n+i-str1+2);   // recursively go from the next letter
		}
		else
			*(str2+n+i-str1) = *i;   // copy letter
}

int main()
{
	partition(str1, str2, 0);
}