void RemoveDuplicate(char *str)
{
    int i, j, k;
    unsigned long len = strlen(str);
    for(i = k = 0; i < len; i++) {
        if(str[i]) {
            str[k++] = str[i];
            for(j = i + 1; j < len; j++)
                if(str[j] == str[i])
                    str[j] = '\0';
        }
    }
    str[k] = '\0';
}


void RemoveDuplicate1(char *s) {
    char check[256] = { 0 };
    int j = 0;
    unsigned long len = strlen(s);
    for(int i = 0; i < len; i++)  {
        if(check[s[i]] == 0) {
            s[j++] = s[i];
            check[s[i]] = 1;
        }
    }
    s[j] = '\0';
}

void RemoveDuplicate3(char *s) {
    int remainder;
    int check[8] = {0}; //4個(gè)字節(jié) * 8 * 8bit = 256bit
    int j = 0;
    unsigned long len = strlen(s);
    for(int i = 0; i < len; i++)  {
        remainder = s[i] % 32; //remainder 范圍0-31
        //s[i] >> 5是確定在數(shù)組中哪個(gè)位置

        printf("%d -- %d--%d", s[i] >> 5, check[s[i] >> 5], remainder);
        printf("\n");
        if((check[s[i] >> 5] & (1 << remainder)) == 0) {
            s[j++] = s[i];
            check[s[i] >> 5] |= (1 << remainder);
        }
    }
    s[j] = '\0';
}

void RemoveDuplicate2(char *s)
{
    int i, j, val, check;
    j = check = 0;
    for(i = 0; s[i]; i++)
    {
        val = s[i] - 'a';
        if((check & (1 << val)) == 0)
        {
            s[j++] = s[i];
            check |= 1 << val;
        }
    }
    s[j] = '\0';
}