-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconvert_array_into_a_zigzag_fashion.cpp
101 lines (86 loc) · 1.96 KB
/
convert_array_into_a_zigzag_fashion.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
class Array {
public:
template <class T>
static void input(vector<T> &A, int n) {
for (int i = 0; i < n; i++) {
scanf("%d ", &A[i]);
}
}
template <class T>
static void print(vector<T> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i] << " ";
}
cout << endl;
}
};
// } Driver Code Ends
class Solution {
public:
void zigZag(int n, vector<int> &arr) {
for(int i = 0; i < n-1; i++)
{
if(i % 2 == 0)
{
if(arr[i] > arr[i+1])
swap(arr[i], arr[i+1]);
}
else
{
if(arr[i] < arr[i+1])
swap(arr[i], arr[i+1]);
}
}
}
};
//{ Driver Code Starts.
bool isZigzag(int n, vector<int> &arr) {
int f = 1;
for (int i = 1; i < n; i++) {
if (f) {
if (arr[i - 1] > arr[i])
return 0;
} else {
if (arr[i - 1] < arr[i])
return 0;
}
f = f ^ 1;
}
return 1;
}
int main() {
int t;
scanf("%d ", &t);
while (t--) {
int n;
scanf("%d", &n);
vector<int> arr(n);
Array::input(arr, n);
Solution obj;
//
obj.zigZag(n, arr);
bool flag = 0;
for (int i = 0; i < n; i++) {
if (arr[i] == i % 2) {
flag = 0;
} else {
flag = 1;
break;
}
}
if (flag == 0) {
cout << "0\n";
} else {
bool check = 1;
check = isZigzag(n, arr);
if (check)
cout << "1\n";
else
cout << "0\n";
}
}
}
// } Driver Code Ends