问：数组左旋元素的程序。

17 Mar 2025 | 4 分钟阅读

说明

在这个程序中，我们需要将数组的元素向左旋转指定的次数。在左旋中，数组的每个元素将向左移动一个位置，并且数组的第一个元素将添加到列表的末尾。此过程将重复指定的次数。

Program to left rotate the elements of an array

考虑上面的数组，如果 n 为 1，那么数组的所有元素将向左移动一个位置，使得数组的第二个元素占据第一个位置，第三个元素移动到第二个位置，依此类推。数组的第一个元素将添加到数组的末尾。

算法

声明并初始化一个数组。
变量 n 表示数组需要向左旋转的次数。
可以通过循环遍历数组并执行 arr[j] = arr[j+1] 操作来左旋数组，将元素移到它们的前一个位置。
数组的第一个元素将被添加到旋转后数组的末尾。

解决方案

Python

#Initialize array 
arr = [1, 2, 3, 4, 5]; 
#n determine the number of times an array should be rotated
n = 3;
 
#Displays original array
print("Original array: ");
for i in range(0, len(arr)):
    print(arr[i]), 
 
#Rotate the given array by n times toward left
for i in range(0, n):
    #Stores the first element of the array
    first = arr[0];
    
    for j in range(0, len(arr)-1):
        #Shift element of array by one
        arr[j] = arr[j+1];
        
    #First element of array will be added to the end
    arr[len(arr)-1] = first;
 
print();
 
#Displays resulting array after rotation
print("Array after left rotation: ");
for i in range(0, len(arr)):
    print(arr[i]),

输出

Original array: 
1 2 3 4 5 
Array after left rotation: 
4 5 1 2 3

C

#include <stdio.h>
 
int main()
{
    //Initialize array 
    int arr[] = {1, 2, 3, 4, 5}; 
    //Calculate length of array arr
    int length = sizeof(arr)/sizeof(arr[0]);
    //n determine the number of times an array should be rotated
    int n = 3;
    
    //Displays original array
    printf("Original array: \n");
    for (int i = 0; i < length; i++) { 
        printf("%d ", arr[i]); 
    }  
    
    //Rotate the given array by n times toward left
    for(int i = 0; i < n; i++){
        int j, first;
        //Stores the first element of the array
        first = arr[0];
    
        for(j = 0; j < length-1; j++){
            //Shift element of array by one
            arr[j] = arr[j+1];
        }
        //First element of array will be added to the end
        arr[j] = first;
    }
    
    printf("\n");
    
    //Displays resulting array after rotation
    printf("Array after left rotation: \n");
    for(int i = 0; i < length; i++){
        printf("%d ", arr[i]);
    }
    return 0;
}

输出

Original array: 
1 2 3 4 5 
Array after left rotation: 
4 5 1 2 3

JAVA

class RotateLeft {
  
    public static void main(String[] args) {
    
        //Initialize array 
        int [] arr = new int [] {1, 2, 3, 4, 5}; 
        //n determine the number of times an array should be rotated
        int n = 3;
        
        //Displays original array
        System.out.println("Original array: ");
        for (int i = 0; i < arr.length; i++) { 
            System.out.print(arr[i] + " "); 
        }  
        
        //Rotate the given array by n times toward left
        for(int i = 0; i < n; i++){
            int j, first;
            //Stores the first element of the array
            first = arr[0];
        
            for(j = 0; j < arr.length-1; j++){
                //Shift element of array by one
                arr[j] = arr[j+1];
            }
            //First element of array will be added to the end
            arr[j] = first;
        }
        
        System.out.println();
        
        //Displays resulting array after rotation
        System.out.println("Array after left rotation: ");
        for(int i = 0; i< arr.length; i++){
            System.out.print(arr[i] + " ");
        }
    }
}

输出

Original array: 
1 2 3 4 5 
Array after left rotation: 
4 5 1 2 3

C#

using System;
                    
public class RotateLeft
{
    public static void Main()
    {
        //Initialize array 
        int [] arr = new int [] {1, 2, 3, 4, 5}; 
        //n determine the number of times an array should be rotated
        int n = 3;
        
        //Displays original array
        Console.WriteLine("Original array: ");
        for (int i = 0; i < arr.Length; i++) { 
            Console.Write(arr[i] + " "); 
        }  
        
        //Rotate the given array by n times toward left
        for(int i = 0; i < n; i++){
            int j, first;
            //Stores the first element of the array
            first = arr[0];
        
            for(j = 0; j < arr.Length-1; j++){
                //Shift element of array by one
                arr[j] = arr[j+1];
            }
            //First element of array will be added to the end
            arr[j] = first;
        }
        
        Console.WriteLine();
        
        //Displays resulting array after rotation
        Console.WriteLine("Array after left rotation: ");
        for(int i = 0; i< arr.Length; i++){
            Console.Write(arr[i] + " ");
        }
    }
}

输出

Original array: 
1 2 3 4 5 
Array after left rotation: 
4 5 1 2 3

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//Initialize array 
$arr = array(1, 2, 3, 4, 5); 
//n determine the number of times an array should be rotated
$n = 3;
 
//Displays original array
print("Original array: <br>");
for ($i = 0; $i < count($arr); $i++) { 
    print($arr[$i] . " "); 
}  
    
//Rotate the given array by n times toward left
for ($i = 0; $i < $n; $i++){
    //Stores the first element of the array
    $first = $arr[0];
    
    for($j = 0; $j < count($arr)-1; $j++){
        //Shift element of array by one
        $arr[$j] = $arr[$j+1];
    }
    //First element of array will be added to the end
    $arr[$j] = $first;
}
 
print("<br>");
 
//Displays resulting array after rotation
print("Array after left rotation: <br>");
for ($i = 0; $i < count($arr); $i++) { 
    print($arr[$i] . " "); 
}    
?>
</body>
</html>

输出

Original array: 
1 2 3 4 5 
Array after left rotation: 
4 5 1 2 3

下一主题#

问：数组左旋元素的程序。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

问：数组左旋元素的程序。

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

从三元树创建双向链表的程序

根据给定坐标查找三角形类型的程序

从循环链表中删除重复元素的程序

查找字符串中出现次数最多和最少的字符的程序

查找字符频率的程序

查找二叉树中距离最远的节点的程序

编写查找四面体（Tetrahedron）面积的程序

计算字符串中所有标点符号字符数量的程序

查找二叉树中最大元素的程序

计算矩形面积的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器