给定大小为N (由重复项组成)的数组arr [] ，任务是检查是否可以通过旋转给定数组将其转换为非递减数组。如果无法这样做，请打印“ No ”。否则，打印“是”。
例子：
Input: arr[] = {3, 4, 5, 1, 2}
Output: Yes
Explanation: After 2 right rotations, the array arr[] modifies to {1, 2, 3, 4, 5}
Input: arr[] = {1, 2, 4, 3}
Output: No
方法：这个想法基于这样一个事实，即通过旋转给定的数组并检查每个旋转的数组(是否非递减)，最多可以获得N个不同的数组。请按照以下步骤解决问题：
- 初始化一个向量，例如v，然后将原始数组的所有元素复制到其中。
- 对向量v排序。
- 遍历原始数组并执行以下步骤：
- 在每次迭代中旋转1。
- 如果数组等于向量v ，则打印“是”。否则，打印“ No ”。
下面是上述方法的实现：
C++
// C++ program for the above approach
#include
using namespace std;
// Function to check if a
// non-decreasing array can be obtained
// by rotating the original array
void rotateArray(vector& arr, int N)
{
// Stores copy of original array
vector v = arr;
// Sort the given vector
sort(v.begin(), v.end());
// Traverse the array
for (int i = 1; i <= N; ++i) {
// Rotate the array by 1
rotate(arr.begin(),
arr.begin() + 1, arr.end());
// If array is sorted
if (arr == v) {
cout << "YES" << endl;
return;
}
}
// If it is not possible to
// sort the array
cout << "NO" << endl;
}
// Driver Code
int main()
{
// Given array
vector arr = { 3, 4, 5, 1, 2 };
// Size of the array
int N = arr.size();
// Function call to check if it is possible
// to make array non-decreasing by rotating
rotateArray(arr, N);
} Java
// Java program for the above approach
import java.util.*;
class GFG{
// Function to check if a
// non-decreasing array can be obtained
// by rotating the original array
static void rotateArray(int[] arr, int N)
{
// Stores copy of original array
int[] v = arr;
// Sort the given vector
Arrays.sort(v);
// Traverse the array
for (int i = 1; i <= N; ++i) {
// Rotate the array by 1
int x = arr[N - 1];
i = N - 1;
while(i > 0){
arr[i] = arr[i - 1];
arr[0] = x;
i -= 1;
}
// If array is sorted
if (arr == v) {
System.out.print("YES");
return;
}
}
// If it is not possible to
// sort the array
System.out.print("NO");
}
// Driver Code
public static void main(String[] args)
{
// Given array
int[] arr = { 3, 4, 5, 1, 2 };
// Size of the array
int N = arr.length;
// Function call to check if it is possible
// to make array non-decreasing by rotating
rotateArray(arr, N);
}
}
// This code is contributed by splevel62.Python3
# Python 3 program for the above approach
# Function to check if a
# non-decreasing array can be obtained
# by rotating the original array
def rotateArray(arr, N):
# Stores copy of original array
v = arr
# Sort the given vector
v.sort(reverse = False)
# Traverse the array
for i in range(1, N + 1, 1):
# Rotate the array by 1
x = arr[N - 1]
i = N - 1
while(i > 0):
arr[i] = arr[i - 1]
arr[0] = x
i -= 1
# If array is sorted
if (arr == v):
print("YES")
return
# If it is not possible to
# sort the array
print("NO")
# Driver Code
if __name__ == '__main__':
# Given array
arr = [3, 4, 5, 1, 2]
# Size of the array
N = len(arr)
# Function call to check if it is possible
# to make array non-decreasing by rotating
rotateArray(arr, N)
# This code is contributed by ipg2016107.C#
// C# program to implement
// the above approach
using System;
class GFG
{
// Function to check if a
// non-decreasing array can be obtained
// by rotating the original array
static void rotateArray(int[] arr, int N)
{
// Stores copy of original array
int[] v = arr;
// Sort the given vector
Array.Sort(v);
// Traverse the array
for (int i = 1; i <= N; ++i) {
// Rotate the array by 1
int x = arr[N - 1];
i = N - 1;
while(i > 0){
arr[i] = arr[i - 1];
arr[0] = x;
i -= 1;
}
// If array is sorted
if (arr == v) {
Console.Write("YES");
return;
}
}
// If it is not possible to
// sort the array
Console.Write("NO");
}
// Driver code
public static void Main()
{
// Given array
int[] arr = { 3, 4, 5, 1, 2 };
// Size of the array
int N = arr.Length;
// Function call to check if it is possible
// to make array non-decreasing by rotating
rotateArray(arr, N);
}
}
// This code is contributed by susmitakundugoaldanga.输出
YES
时间复杂度： O(N 2 )
辅助空间： O(N)