-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathcode_1.cpp
42 lines (38 loc) · 869 Bytes
/
code_1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
//
// code_1.cpp
// Algorithm
//
// Created by Mohd Shoaib Rayeen on 23/11/18.
// Copyright © 2018 Shoaib Rayeen. All rights reserved.
//
#include <iostream>
using namespace std;
void occurredOnce(int arr[], int n) {
sort(arr, arr + n);
if (arr[0] != arr[1]) {
cout << arr[0] << " ";
}
for (int i = 1; i < n - 1; i++) {
if (arr[i] != arr[i + 1] && arr[i] != arr[i - 1]) {
cout << arr[i] << " ";
}
}
if (arr[n - 2] != arr[n - 1]) {
cout << arr[n - 1] << " ";
}
}
int main() {
int n;
cout << "\nEnter Size\t:\t";
cin >> n;
int *a = new int[n];
cout << "\nEnter Array Elements\n";
for ( int i = 0; i < n; i++ ) {
cin >> a[i];
}
cout << "\nElements that Occurred Once\t:\t";
occurredOnce( a , n);
delete[] a;
cout << endl;
return 0;
}