문자열에서 문자 수가 가장 적은 문자 삭제 - 화웨이 창사 스팟

/**
**
**   :                 ,     :
**
**       char *  delChar(char *s,int iLen)     
**	   
**		    s      ,iLen        。
**		 
**	            “abcdd”,   "dd"。
**		   
**		           ,               20。
**/

방법1:
#include <stdio.h>   
#include <string.h>   
#include <malloc.h>   
  
char * delChar(char *s,int iLen)  
{  
    if((s == NULL) || iLen <= 0)  
    {  
        return NULL;  
    }  
    int i;  
    /*       26   */  
    const int MAXLEN = 26;  
    /*min             */  
    /*  nCountTable                 ,     0*/  
    unsigned int min,nCountTable[MAXLEN];  
    /*    0*/  
    for(i = 0;i < MAXLEN;i ++)  
    {  
        nCountTable[i] = 0;  
    }  
    /*               */  
    for(i = 0;i < iLen;i ++)  
    {  
        nCountTable[*(s + i) - 'a'] ++;  
    }  
    /* nCountTable        0 ,      ,         */  
    while(nCountTable[i] == 0)  
    {  
        i ++;  
    }  
    min = nCountTable[i];  
    /*            ,         */  
    for(i = 0;i < MAXLEN;i ++)  
    {  
        if(nCountTable[i] != 0)  
        {  
            if(nCountTable[i] < min)  
            {  
                min = nCountTable[i];  
            }  
        }             
    }  
    /*           ,    */  
    char *pSlow = s;
	char *pFast = s;    
    while(*pFast != '\0')  
    {  
        if(nCountTable[*pFast - 'a'] != min)  
        {  
            *pSlow = *pFast;   
			pSlow ++;
        }         
		pFast ++;
    }  
	*pSlow = '\0';
  
    return s;  
}  
int main()  
{  
    char str[] = "abadccdehigiktk";  
    int iLen = strlen(str)/sizeof(char);  
    char *tmp = delChar(str,iLen);  
    printf("%s
",tmp); }

방법2:
#include <stdio.h>
#include <string.h>
#include <malloc.h>

char * delChar(char *s,int iLen)
{
	if((s == NULL) || iLen <= 0)
	{
		return NULL;
	}
	int i;
	/*       26   */
	const int MAXLEN = 26;
	/*min             */
	/*  nCountTable                 ,     0*/
	unsigned int min,nCountTable[MAXLEN];
	/*    0*/
	for(i = 0;i < MAXLEN;i ++)
	{
		nCountTable[i] = 0;
	}
	/*               */
	for(i = 0;i < iLen;i ++)
	{
		nCountTable[*(s + i) - 'a'] ++;
	}
	/* nCountTable        0 ,      ,         */
	while(nCountTable[i] == 0)
	{
		i ++;
	}
	min = nCountTable[i];
	/*            ,         */
	for(i = 0;i < MAXLEN;i ++)
	{
		if(nCountTable[i] != 0)
		{
			if(nCountTable[i] < min)
			{
				min = nCountTable[i];
			}
		}			
	}
	/*           ,    */
	char *tmp = (char *)malloc(sizeof(char)*iLen);	
    i = 0;
	while(*s != '\0')
	{
		if(nCountTable[*s - 'a'] != min)
		{
			*(tmp + i) = *s;
			i ++;
		}		
		s ++;		
	}
	*(tmp + i) = '\0';

	return tmp;
}
int main()
{
	char str[] = "abadccdehigiktk";
	int iLen = strlen(str)/sizeof(char);
	char *tmp = delChar(str,iLen);
	printf("%s
",tmp); }

좋은 웹페이지 즐겨찾기