//////////////////////////////////////////////////////////////////////////華為第一題 19:19-19:36 17分鐘 
#include <iostream> 
#include <cassert> 
 
using namespace std; 
 
bool g_flag[26]; 
void stringFilter(const char *pInputStr, long lInputLen, char *pOutputStr) 
{ 
 assert(pInputStr != NULL); 
 int i = 0; 
 if (pInputStr == NULL || lInputLen <= 1) 
 { 
  return; 
 } 
 const char *p = pInputStr; 
 while(*p != '\0') 
 { 
  if (g_flag[(*p - 'a')]) 
  { 
   p++; 
  }else{ 
   pOutputStr[i++] = *p; 
   g_flag[*p - 'a'] = 1; 
   p++; 
  } 
 } 
 pOutputStr[i] = '\0'; 
} 
int main() 
{ 
 memset(g_flag,0,sizeof(g_flag)); 
 char input[] = "abacacde"; 
 char *output = new char[strlen(input) + 1]; 
 stringFilter(input,strlen(input),output); 
 cout<<output<<endl; 
 delete output; 
 return 0; 
} 

//////////////////////////////////////////////////////////////////////////華為第二題 19:40 - 20:10 中間耽誤3分鐘 
#include <iostream> 
#include <cassert> 
 
using namespace std; 
 
void stringZip(const char *pInputStr, long lInputLen, char *pOutputStr) 
{ 
 const char *p = pInputStr; 
 int num = 1; 
 int i = 0; 
 p++; 
 while(*p != NULL) 
 { 
  while(*p == *(p-1)&& *p != NULL) 
  { 
  num++; 
  p++; 
  } 
  if (num > 1) 
  { 
   int size = 0; 
   int temp = num; 
   while(num)    //計(jì)算位數(shù) 
   { 
    size++; 
    num /= 10; 
   } 
   num = 1; 
 
   for (int j = size; j > 0; j--) 
   { 
    pOutputStr[i+j-1] = '0'+ temp%10; 
    temp /= 10; 
   } 
   i +=size; 
   pOutputStr[i++] = *(p-1); 
   p++; 
  }else{ 
   pOutputStr[i++] = *(p-1); 
   p++; 
  } 
 } 
 pOutputStr[i] = '\0'; 
} 
 
int main() 
{ 
 char input[] = "cccddecc"; 
 char *output = new char[strlen(input) + 1]; 
 stringZip(input,strlen(input),output); 
 cout<<output<<endl; 
 return 0; 
} 

//////////////////////////////////////////////////////////////////////////華為第三題 20:29 - 20:40 
#include <iostream> 
 
using namespace std; 
 
void arithmetic(const char *pInputStr, long lInputLen, char *pOutputStr) 
{ 
 const char *input = pInputStr; 
  char *output = pOutputStr; 
 int sum = 0; 
 int operator1 = 0; 
 int operator2 = 0; 
 char *temp = new char[5]; 
 char *ope = temp; 
 while(*input != ' ') //獲得操作數(shù)1 
 { 
  sum = sum*10 + (*input++ - '0'); 
 } 
 input++; 
 operator1 = sum; 
 sum = 0; 
 
 while(*input != ' ') 
 { 
  *temp++ = *input++; 
 } 
 
 input++; 
 *temp = '\0'; 
 
 if (strlen(ope) > 1 ) 
 { 
  *output++ = '0'; 
  *output = '\0'; 
  return; 
 } 
 
 while(*input != '\0') //獲得操作數(shù)2 
 { 
  sum = sum*10 + (*input++ - '0'); 
 } 
 operator2 = sum; 
 sum = 0; 
 
 switch (*ope) 
 { 
 case '+':itoa(operator1+operator2,pOutputStr,10); 
  break; 
 case '-':itoa(operator1-operator2,pOutputStr,10); 
 break; 
 default: 
  *output++ = '0'; 
  *output = '\0'; 
  return; 
 } 
} 
 
int main() 
{ 
 char input[] = "4 - 7"; 
 char output[] = " "; 
 arithmetic(input,strlen(input),output); 
 cout<<output<<endl; 
 return 0; 
} 

//華為2014年機(jī)試題1：輸入1--50個(gè)數(shù)字，求出最小數(shù)和最大數(shù)的和 
//輸入以逗號(hào)隔開 
#include<stdio.h> 
#define N 50 
void sort(int a[],int n); 
int main(void) 
{ 
 
 
 char str[100]; 
 int a[N]={0}; 
 gets(str);  //要點(diǎn)1：動(dòng)態(tài)的輸入1--50個(gè)整數(shù)，不能確定個(gè)數(shù)，只能用字符串輸入，然后分離出來 
 int i=0; 
 int j=0; 
 int sign=1; 
 while(str[i]!='\0') 
 { 
  if(str[i]!=',') //輸入時(shí)要在半角輸入 
  { 
 
   if(str[i] == '-') //要點(diǎn):2：有負(fù)整數(shù)的輸入 
   { 
    // i++; //易錯(cuò)點(diǎn)1 
    sign=-1; 
   } 
   else if(str[i]!='\0') //不用else的話，負(fù)號(hào)也會(huì)減去‘0' 
   { 
    a[j]=a[j]*10 + str[i]-'0'; //要點(diǎn)3：輸入的可以是多位數(shù) 
 
   } 
  } 
  i++; 
  if(str[i]==',' || str[i]=='\0') //這個(gè)判斷是在i自加以后 
  { 
    a[j]=a[j]*sign; //易錯(cuò)點(diǎn)2 
    sign=1; ////易錯(cuò)點(diǎn)3 
    j++; //j就是a數(shù)組的個(gè)數(shù) 范圍0到j(luò)-1 
  } 
 
 
 } 
 
 sort(a,j); 
 printf("Max number + Min number = %d",a[0]+a[j-1]); 
 
 return 0; 
} 
void sort(int a[],int n) //選擇排序 
{ 
 int i,j; 
 int k; 
 int temp; 
 for(i=0;i<n-1;i++) 
 { 
  k=i; 
  for(j=i+1;j<n;j++) 
  { 
   if(a[k]>a[j]) 
    k=j; 
  } 
  if(i!=k) 
  { 
   temp = a[k]; 
   a[k] = a[i]; 
   a[i] = temp; 
  } 
 } 
 for(i=0;i<n;i++) 
  printf("%-5d",a[i]); 
 puts(""); 
}