[005] unique_sub_string

[Description] Given a string, find the largest unique substring.

e.g.　　str[] = "asdfghjkkjhgf";

　　　  sub[] = "asd";

[Thought] create an auxiliary space 'record[256]' to record the appearence of characters. O(n)

[Implementation] C code:

 #include<stdio.h>

 int uniqueSubStr(const char str[], char unique[])
 {
         int record[]={};
         int i,len=;
         for(i=;str[i]!='\0';i++)
         {
                 if(==record[str[i]])
                 {
                         record[str[i]]=;
                         len++;
                         unique[len-]=str[i];
                 }
                 else
                 {
                         continue;
                 }
         }
         unique[len]='\0';
         return len;
 }

 int main()
 {
         char str[]="asdfjlkdfghjc";
         int size=sizeof(str);
         char unique[size];
         int i;

         printf("Initial string:\n");
         for(i=;str[i]!='\0';i++)
         {
                 printf("%c",str[i]);
         }
         printf("\nThe lagest length of unique substring is: %d\n", uniqueSubStr(str,unique));
         printf("The unique substring is:\n");
         for(i=;unique[i]!='\0';i++)
         {
                 printf("%c",unique[i]);
         }
         printf("\n");
         return ;
 }