<ruby id="bdb3f"></ruby>

    <p id="bdb3f"><cite id="bdb3f"></cite></p>

      <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
        <p id="bdb3f"><cite id="bdb3f"></cite></p>

          <pre id="bdb3f"></pre>
          <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

          <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
          <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

          <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                <ruby id="bdb3f"></ruby>

                ??碼云GVP開源項目 12k star Uniapp+ElementUI 功能強大 支持多語言、二開方便! 廣告
                # 程序循環旋轉一個數組 > 原文: [https://www.geeksforgeeks.org/c-program-cyclically-rotate-array-one/](https://www.geeksforgeeks.org/c-program-cyclically-rotate-array-one/) 給定一個數組,將數組順時針方向順時針旋轉一個。 **示例**: ``` Input: arr[] = {1, 2, 3, 4, 5} Output: arr[] = {5, 1, 2, 3, 4} ``` 以下是步驟。 1)將最后一個元素存儲在變量`x`中。 2)將所有元素向前移動一個位置。 3)將數組的第一個元素替換為`x`。 ## C++ ```cpp // C++ code for program? // to cyclically rotate // an array by one # include <iostream> using namespace std; void rotate(int arr[], int n) { ????int x = arr[n - 1], i; ????for (i = n - 1; i > 0; i--) ????arr[i] = arr[i - 1];? ????arr[0] = x; } // Driver code int main()? { ????int arr[] = {1, 2, 3, 4, 5}, i; ????int n = sizeof(arr) /? ????????????sizeof(arr[0]); ????cout << "Given array is \n"; ????for (i = 0; i < n; i++) ????????cout << arr[i]; ????rotate(arr, n); ????cout << "\nRotated array is\n"; ????for (i = 0; i < n; i++) ????????cout << arr[i]; ????return 0; } // This code is contributed by jit_t ``` ## C ``` #include <stdio.h> void rotate(int arr[], int n) { ???int x = arr[n-1], i; ???for (i = n-1; i > 0; i--) ??????arr[i] = arr[i-1]; ???arr[0] = x; } int main() { ????int arr[] = {1, 2, 3, 4, 5}, i; ????int n = sizeof(arr)/sizeof(arr[0]); ????printf("Given array is\n"); ????for (i = 0; i < n; i++) ????????printf("%d ", arr[i]); ????rotate(arr, n); ????printf("\nRotated array is\n"); ????for (i = 0; i < n; i++) ????????printf("%d ", arr[i]); ????return 0; } ``` ## Java ```java import java.util.Arrays; public class Test { ????static int arr[] = new int[]{1, 2, 3, 4, 5}; ????// Method for rotation ????static void rotate() ????{ ???????int x = arr[arr.length-1], i; ???????for (i = arr.length-1; i > 0; i--) ??????????arr[i] = arr[i-1]; ???????arr[0] = x; ????} ????/* Driver program */ ????public static void main(String[] args)? ????{ ????????System.out.println("Given Array is"); ????????System.out.println(Arrays.toString(arr)); ????????rotate(); ????????System.out.println("Rotated Array is"); ????????System.out.println(Arrays.toString(arr)); ????} } ``` ## Python3 ```py # Python3 code for program to? # cyclically rotate an array by one # Method for rotation def rotate(arr, n): ????x = arr[n - 1] ????for i in range(n - 1, 0, -1): ????????arr[i] = arr[i - 1]; ????arr[0] = x; # Driver function arr= [1, 2, 3, 4, 5] n = len(arr) print ("Given array is") for i in range(0, n): ????print (arr[i], end = ' ') rotate(arr, n) print ("\nRotated array is") for i in range(0, n): ????print (arr[i], end = ' ') # This article is contributed? # by saloni1297 ``` ## C# ```cs // C# code for program to cyclically // rotate an array by one using System; public class Test { ????static int []arr = new int[]{1, 2, 3, 4, 5}; ????// Method for rotation ????static void rotate() ????{ ????int x = arr[arr.Length - 1], i; ????for (i = arr.Length - 1; i > 0; i--) ????????arr[i] = arr[i-1]; ????arr[0] = x; ????} ????// Driver Code ????public static void Main()? ????{ ????????Console.WriteLine("Given Array is"); ????????string Original_array = string.Join(" ", arr); ????????Console.WriteLine(Original_array); ????????rotate(); ????????Console.WriteLine("Rotated Array is"); ????????string Rotated_array = string.Join(" ", arr); ????????Console.WriteLine(Rotated_array); ????} } // This code is contributed by vt_m. ``` ## PHP ```php <?php // PHP code for program? // to cyclically rotate // an array by one function rotate(&$arr, $n) { ????$x = $arr[$n - 1]; ????for ($i = $n - 1; ?????????$i > 0; $i--) ????$arr[$i] = $arr[$i - 1];? ????$arr[0] = $x; } // Driver code $arr = array(1, 2, 3, 4, 5); $n = sizeof($arr); echo "Given array is \n"; for ($i = 0; $i < $n; $i++) ????echo $arr[$i] . " "; rotate($arr, $n); echo "\nRotated array is\n"; for ($i = 0; $i < $n; $i++) ????echo $arr[$i] . " "; // This code is contributed // by ChitraNayal ?> ``` **輸出**: ``` Given array is 1 2 3 4 5 Rotated array is 5 1 2 3 4 ``` 時間復雜度:`O(n)`當我們需要遍歷所有元素時 輔助空間:`O(1)` 通過使用[逆轉算法](https://www.geeksforgeeks.org/program-for-array-rotation-continued-reversal-algorithm/)也可以解決上述問題 如果您在上述代碼/算法中發現任何錯誤,或者找到其他解決同一問題的方法,請發表評論
                  <ruby id="bdb3f"></ruby>

                  <p id="bdb3f"><cite id="bdb3f"></cite></p>

                    <p id="bdb3f"><cite id="bdb3f"><th id="bdb3f"></th></cite></p><p id="bdb3f"></p>
                      <p id="bdb3f"><cite id="bdb3f"></cite></p>

                        <pre id="bdb3f"></pre>
                        <pre id="bdb3f"><del id="bdb3f"><thead id="bdb3f"></thead></del></pre>

                        <ruby id="bdb3f"><mark id="bdb3f"></mark></ruby><ruby id="bdb3f"></ruby>
                        <pre id="bdb3f"><pre id="bdb3f"><mark id="bdb3f"></mark></pre></pre><output id="bdb3f"></output><p id="bdb3f"></p><p id="bdb3f"></p>

                        <pre id="bdb3f"><del id="bdb3f"><progress id="bdb3f"></progress></del></pre>

                              <ruby id="bdb3f"></ruby>

                              哎呀哎呀视频在线观看