📌  相关文章
📜  反转给定大小的组中的数组|第3组(单次遍历)

📅  最后修改于: 2021-05-17 05:45:44             🧑  作者: Mango

给定一个数组,反转由连续的k个元素形成的每个子数组。
例子:

方法:

  1. 我们将使用两个指针技术来解决此问题。
  2. 首先,我们将使用值k-1( d = k-1 )和值2( m = 2 )初始化变量m的第一个指针d。
  3. 现在,我们将使用第二个指针i迭代数组并检查
    • 如果i ,交换(arr [i],arr [d])并将d减1。否则,
    • d = k * m – 1i = k *(m – 1)– 1m = m + 1。

下面是上述方法的实现。

C++
// C++ program to reverse every sub-array
// formed by consecutive k elements
#include
using namespace std;
 
// Function to reverse every sub-array
// formed by consecutive k elements
void ReverseInGroup(int arr[], int n, int k)
{
    if(n < k)
    {
        k = n;
    }
 
    // Initialize variables
    int d = k - 1, m = 2;
    int i = 0;
         
    for(i = 0; i < n; i++)
    {
        
       if (i >= d)
       {
           // Update the variables
           d = k * (m);
           if(d >= n)
           {
               d = n;        
           }    
           i = k * (m - 1) - 1;
           m++;
       }
       else
       {
           int t = arr[i];
           arr[i] = arr[d];
           arr[d] = t;
       }
       d = d - 1;
    }
    return;
}
 
// Driver code
int main()
{
    int arr[] = { 1, 2, 3, 4, 5, 6, 7 };
    int k = 3;
    int n = sizeof(arr) / sizeof(arr[0]);
 
    ReverseInGroup(arr, n, k);
 
    for(int i = 0; i < n; i++)
       cout << arr[i] << " ";
 
    return 0;
}
 
// This code is contributed by Code_Mech


C
// C program to reverse every sub-array
// formed by consecutive k elements
#include
 
// Function to reverse every sub-array
// formed by consecutive k elements
void ReverseInGroup(int arr[], int n, int k)
{
    if(n= d)
        {  
            // Update the variables
            d = k * (m);
            if(d>=n)
            {
                d = n;            
            }          
            i = k * (m - 1)-1;
            m++;
             
        }
        else
        {
            int t = arr[i];
            arr[i] = arr[d];
            arr[d] = t;
        }
 
     d = d - 1;     
        
    }
    return;
         
}
 
// Driver code
int main()
{
    int arr[] = {1, 2, 3, 4, 5, 6, 7};
    int k = 3;
   
    int n = sizeof(arr) / sizeof(arr[0]);
   
    ReverseInGroup(arr, n, k);
   
    for (int i = 0; i < n; i++)
        printf("%d ", arr[i]);
   
    return 0;
}


Java
// Java program to reverse every sub-array
// formed by consecutive k elements
class GFG{
     
// Function to reverse every sub-array
// formed by consecutive k elements
static void ReverseInGroup(int arr[],
                           int n, int k)
{
    if(n < k)
    {
        k = n;
    }
 
    // Initialize variables
    int d = k - 1, m = 2;
    int i = 0;
         
    for(i = 0; i < n; i++)
    {
       if (i >= d)
       {
            
           // Update the variables
           d = k * (m);
           if(d >= n)
           {
               d = n;            
           }        
           i = k * (m - 1) - 1;
           m++;
       }
       else
       {
           int t = arr[i];
           arr[i] = arr[d];
           arr[d] = t;
       }
       d = d - 1;    
    }
    return;
}
 
// Driver code
public static void main(String[] args)
{
    int arr[] = { 1, 2, 3, 4, 5, 6, 7 };
    int k = 3;
    int n = arr.length;
     
    ReverseInGroup(arr, n, k);
     
    for(int i = 0; i < n; i++)
       System.out.printf("%d ", arr[i]);
}
}
 
// This code is contributed by sapnasingh4991


Python3
# Python3 program to reverse
# every sub-array formed by
# consecutive k elements
 
# Function to reverse every
# sub-array formed by consecutive
# k elements
def ReverseInGroup(arr, n, k):
 
    if(n < k):
        k = n
 
    # Initialize variables
    d = k - 1
    m = 2
    i = 0
 
    while i < n:
        if (i >= d):
 
            # Update the
            # variables
            d = k * (m)
             
            if(d >= n):
                d = n
 
            i = k * (m - 1) - 1
            m += 1
 
        else:
            arr[i], arr[d] = (arr[d],
                              arr[i])
        d = d - 1
        i += 1
 
    return
 
# Driver code
if __name__ == "__main__":
 
    arr = [1, 2, 3,
           4, 5, 6, 7]
    k = 3
    n = len(arr)
    ReverseInGroup(arr, n, k)
 
    for i in range(n):
        print(arr[i],
              end = " ")
 
# This code is contributed by Chitranayal


C#
// C# program to reverse every sub-array
// formed by consecutive k elements
using System;
class GFG{
     
// Function to reverse every sub-array
// formed by consecutive k elements
static void ReverseInGroup(int []arr,
                           int n, int k)
{
    if(n < k)
    {
        k = n;
    }
 
    // Initialize variables
    int d = k - 1, m = 2;
    int i = 0;
         
    for(i = 0; i < n; i++)
    {
        if (i >= d)
        {
                 
            // Update the variables
            d = k * (m);
            if(d >= n)
            {
                d = n;            
            }        
            i = k * (m - 1) - 1;
            m++;
        }
        else
        {
            int t = arr[i];
            arr[i] = arr[d];
            arr[d] = t;
        }
        d = d - 1;    
    }
    return;
}
 
// Driver code
public static void Main()
{
    int []arr = { 1, 2, 3, 4, 5, 6, 7 };
    int k = 3;
    int n = arr.Length;
     
    ReverseInGroup(arr, n, k);
     
    for(int i = 0; i < n; i++)
        Console.Write(arr[i] + " ");
}
}
 
// This code is contributed by Code_Mech


输出:
3 2 1 6 5 4 7