Huawei machine Test and recall--the first question

Before writing the first question wrong, the last toilet came hurriedly to delete, afraid to mislead everyone. The topics are as follows:

Title: Repeating numbers in an output integer sequence

Description: Write a program where the user enters an integer sequence of any length (less than or equal to 10), the integer value is greater than 0, all the duplicated arrays in the program output sequence, and the order and input of the array remain consistent

Input: A number sequence, a line number, a length of less than 1000, two digits separated by commas, all numbers are integers and greater than 0.

Output: Repeating number, separated by a space between two digits, and the order of the numbers is consistent with the input

Sample input: 3,2,2,3,4,5,6

Sample output: 3,2

Problem Solving steps:

1. Apply for a inputarray and helparray with a size of 1000, initialized to 0

2. Save the input string to Inputarray and calculate the actual size

3. Iterate through the input array in a double loop, and if you have the same element, then determine if the element exists in the Helparray array.

4. If the Helparray is not saved, continue traversing

5. The non-0 elements in the final sequential Helparray can be

  1 #include <iostream> 2 #include <string> 3 using namespace std;
 4 5 #define MAXSIZE 6 7 int main () 8 {9 int *inputarray=new int[maxsize];
 Ten int *helparray=new int[maxsize];
 one for (int i=0;i<maxsize;i++), {inputarray[i]=0;
 helparray[i]=0;
 (+)---string s;
 cin>>s;
 the int count=0;
 sum=0 int;
 i=0;
 int temp; + while (true) {s[i+1]!= ', ' && (i+1)!=s.length ()) {sum=sum*
 (s[i]-' 0 ') *10;
 (s[i]-' 0 ') (sum=sum+);
 Temp=sum;
 Inputarray[count++]=sum;
 PNS if (I==s.length ()-1).
 sum=0;
 i=i+2;
 Continue;
 i++; 47 48     } Reallen=count int;
 i=0;i<count;i++ (inputarray[i]<=0) (+ 0) (+)
 +/-(+) (+) (+)-countnew=0 i=0;i<reallen;i++ for (int j=0;j<reallen;j++) $ {(int.) (I!=j
 ) (flag=true); if (Inputarray[i]==inputarray[j]) (int k=0;k<maxsize
 ; k++) (inputarray[i]==helparray[k) 75 {
 Flag=false;                     77} 78} 79 80 81
 if (flag) [helparray[countnew++]=inputarray[i];
84} 85} 86} 87} 88} i=0;i<maxsize;i++ for (a) helparray[i]==0 (a) (94);
 98 cout< 
 Run Screenshots: