-
Notifications
You must be signed in to change notification settings - Fork 0
/
Array
69 lines (62 loc) · 1.44 KB
/
Array
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
// Second largest
#include <bits/stdc++.h>
int findSecondLargest(int n, vector<int> &arr)
{
int max = arr[0] , secmax = INT_MIN;
for( int i=1 ; i<n ; i++ ){
if ( arr[i] > max ){
secmax = max;
max = arr[i];
}
else if( arr[i] < max && arr[i] > secmax)
secmax = arr[i];
}
if ( secmax == INT_MIN)
secmax = -1;
return secmax;
}
------------------------------------------------------------------------------
//Rotate by k
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
void rotateleft(int arr[],int n,int k){
reverse(arr,arr+k);
reverse(arr+k,arr+n);
reverse(arr,arr+n);
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}
}
int main() {
//Write your code here
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[i];
}
int k;
cin>>k;
rotateleft(arr,n,k);
return 0;
}
-------------------------------------------------------------------------------
// Non decreasing array
#include <bits/stdc++.h>
bool isPossible(int *arr, int n)
{
if(n<=2) return 1;
int count=0;
for(int i=1;i<n;i++){
if(arr[i]<arr[i-1]){
count++;
if (i-2>=0 && arr[i-2]>arr[i])
arr[i] = arr[i-1];
else
arr[i-1] = arr[i];
}
}
return count<=1;
}
-------------------------------------------------------------------------------