解题思路:
1,从输入的字符串中解出整数并存入数组
2,用单向栈的思路
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stddef.h>
#include <ctype.h>
#define INPUT_STR_LEN 1001
#define MAX_INT_NUMBER 50
void transStrToInt(char *inputNumStr, int inputNumStrLen, int *numArr, int *ptNumArrLen)
{
if(inputNumStr == NULL || numArr == NULL || ptNumArrLen == NULL || inputNumStrLen <=0)
{
return;
}
int index = 0;
char *ptStart = inputNumStr;
int numArrLen = 0;
for(index=0; index<inputNumStrLen; index++)
{
if(inputNumStr[index] == ' ')
{
inputNumStr[index] = '\0';
numArr[numArrLen++] = atoi(ptStart);
ptStart = &inputNumStr[index+1];
}
}
numArr[numArrLen++] = atoi(ptStart);
*ptNumArrLen = numArrLen;
return;
}
void delDuplicateNumAndKeepDictOrderProc(int *numArr, int *recordHash, int numArrLen, int *ptNewNumArrLen)
{
if(numArr == NULL || recordHash == NULL || numArrLen <= 0)
{
return;
}
int index = 0;
int jndex = 0;
int stackTop = -1;
char isNumInStack = 0;
for(index=0; index<numArrLen; index++)
{
int element = numArr[index];
for(jndex=0; jndex<=stackTop; jndex++)
{
if(numArr[jndex] == element)
{
isNumInStack = 1;
break;
}
}
if(isNumInStack == 0)
{
numArr[++stackTop] = element;
}
recordHash[element]--;
while(stackTop-1 >=0 && numArr[stackTop-1] > numArr[stackTop] && recordHash[numArr[stackTop-1]] >0 )
{
numArr[stackTop-1] = numArr[stackTop];
stackTop--;
}
isNumInStack = 0;
}
*ptNewNumArrLen = stackTop;
}
int main()
{
// please write your code here
char inputNumStr[INPUT_STR_LEN] = {0};
scanf("%[^\n]%*c",inputNumStr);
int numArr[50] = {0};
int numArrLen = 0;
int newNumArrLen = 0;
int *recordHash = (int*)malloc(INPUT_STR_LEN*sizeof(int));
if(recordHash == NULL)
{
return 0;
}
memset(recordHash,0,INPUT_STR_LEN);
int index = 0;
transStrToInt(inputNumStr,strlen(inputNumStr),numArr,&numArrLen);
if(numArrLen > MAX_INT_NUMBER)
{
return 0;
}
for(index=0; index<numArrLen; index++)
{
recordHash[numArr[index]]++;
}
delDuplicateNumAndKeepDictOrderProc(numArr,recordHash,numArrLen,&newNumArrLen);
for(index=0; index<=newNumArrLen; index++)
{
printf("%d ",numArr[index]);
}
free(recordHash);
return 0;
}