<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>

                ThinkChat2.0新版上線,更智能更精彩,支持會話、畫圖、視頻、閱讀、搜索等,送10W Token,即刻開啟你的AI之旅 廣告
                # 在`O(n)`時間和`O(1)`空間中打印數組的左旋轉 > 原文: [https://www.geeksforgeeks.org/print-left-rotation-array/](https://www.geeksforgeeks.org/print-left-rotation-array/) 給定大小為 n 的數組和多個值,我們需要圍繞該值左旋轉數組。 如何快速打印多個左旋? **示例**: ``` Input : arr[] = {1, 3, 5, 7, 9} k1 = 1 k2 = 3 k3 = 4 k4 = 6 Output : 3 5 7 9 1 7 9 1 3 5 9 1 3 5 7 3 5 7 9 1 Input : arr[] = {1, 3, 5, 7, 9} k1 = 14 Output : 9 1 3 5 7 ``` 我們在下面的文章中討論了一個解決方案。 [快速找到數組的多個左旋轉| 系列 1](https://www.geeksforgeeks.org/quickly-find-multiple-left-rotations-of-an-array/) 上面討論的解決方案需要額外的空間。 在本文中,我們討論了不需要額外空間的優化解決方案。 ## C++ ```cpp // CPP implementation of left rotation of // an array K number of times #include <bits/stdc++.h> using namespace std; // Function to leftRotate array multiple times void leftRotate(int arr[], int n, int k) { ????/* To get the starting point of rotated array */ ????int mod = k % n; ????// Prints the rotated array from start position ????for (int i = 0; i < n; i++) ????????cout << (arr[(mod + i) % n]) << " "; ????cout << "\n"; } // Driver program int main() { ????int arr[] = { 1, 3, 5, 7, 9 }; ????int n = sizeof(arr) / sizeof(arr[0]); ????int k = 2; ????leftRotate(arr, n, k); ????k = 3; ????leftRotate(arr, n, k); ????k = 4; ????leftRotate(arr, n, k); ????return 0; } ``` ## Java ```java // JAVA implementation of left rotation // of an array K number of times import java.util.*; import java.lang.*; import java.io.*; class arr_rot {??? ????// Function to leftRotate array multiple ????// times ????static void leftRotate(int arr[], int n, ?????????????????????????????????????int k) ????{ ????????/* To get the starting point of? ????????rotated array */ ????????int mod = k % n; ????????// Prints the rotated array from? ????????// start position ????????for(int i = 0; i < n; ++i) ????????System.out.print(arr[(i + mod) % n] ??????????????????????????+ " ");? ????????System.out.println(); ????} ????// Driver program ????public static void main (String[] args)? ????{ ????????????int arr[] = { 1, 3, 5, 7, 9 }; ????????????int n = arr.length;? ????????????int k = 2; ????????????leftRotate(arr, n, k); ????????????k = 3; ????????????leftRotate(arr, n, k); ????????????k = 4; ????????????leftRotate(arr, n, k); ????} } // This code is contributed by Sanjal ``` ## Python ``` # Python implementation of left rotation of # an array K number of times # Function to leftRotate array multiple times def leftRotate(arr, n, k): ????# To get the starting point of rotated array ????mod = k % n ????s = "" ????# Prints the rotated array from start position ????for i in range(n): ????????print str(arr[(mod + i) % n]), ????print ????return # Driver program arr = [ 1, 3, 5, 7, 9 ] n = len(arr) k = 2 leftRotate(arr, n, k) k = 3 leftRotate(arr, n, k) k = 4 leftRotate(arr, n, k) #This code is contributed by Sachin Bisht ``` ## C# ```cs // C# implementation of left // rotation of an array K // number of times using System; class GFG { ????// Function to leftRotate? ????// array multiple times ????static void leftRotate(int []arr,? ???????????????????????????int n, int k) ????{ ????????// To get the starting?? ????????// point of rotated array? ????????int mod = k % n; ????????// Prints the rotated array?? ????????// from start position ????????for(int i = 0; i < n; ++i) ????????Console.Write(arr[(i + mod) %? ???????????????????????????n] + " ");? ????????Console.WriteLine(); ????} ????// Driver Code ????static public void Main () ????{ ????????int []arr = {1, 3, 5, 7, 9}; ????????int n = arr.Length;? ????????int k = 2; ????????leftRotate(arr, n, k); ????????k = 3; ????????leftRotate(arr, n, k); ????????k = 4; ????????leftRotate(arr, n, k); ????} } // This code is contributed by m_kit ``` ## PHP ```php <?php // PHP implementation of? // left rotation of an // array K number of times // Function to leftRotate // array multiple times function leftRotate($arr, $n, $k) { ????// To get the starting ????// point of rotated array ????$mod = $k % $n; ????// Prints the rotated array ????// from start position ????for ($i = 0; $i < $n; $i++) ????????echo ($arr[($mod +? ????????????????????$i) % $n]) , " "; ????echo "\n"; } // Driver Code $arr = array(1, 3, 5, 7, 9); $n = sizeof($arr); $k = 2; leftRotate($arr, $n, $k); $k = 3; leftRotate($arr, $n, $k); $k = 4; leftRotate($arr, $n, $k); // This code is contributed by m_kit ?> ``` **輸出**: ``` 5 7 9 1 3 7 9 1 3 5 9 1 3 5 7 ```
                  <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>

                              哎呀哎呀视频在线观看