k % n to store the leftmost k % n elements. Then, shift the original array to the left by k % n positions, and finally copy the saved elements from the temporary array to the right side of the original array.
Code

[{"language":"Java","code":"class Solution {\n    public void rotateLeft(int[] nums, int k) {\n        int n = nums.length;\n        k = k % n; // Ensure k is within the bounds of the array size\n    \n        int[] result = new int[nums.length];\n    \n        for (int i = 0; i < n - k; i++) {\n            result[i] = nums[k + i];\n        }\n    \n        for (int i = 0; i < k; i++) {\n            result[n - k + i] = nums[i];\n        }\n    \n        System.arraycopy(result, 0, nums, 0, nums.length);\n    }\n    \n    public static void main(String[] args) {\n        Solution sol = new Solution();\n        int[] arr = {1, 2, 3, 4, 5};\n        int k = 2;\n        sol.rotateLeft(arr, k);\n        for (int num : arr) {\n            System.out.print(num + \" \");\n        }\n        // Expected output: [3, 4, 5, 1, 2]\n    }\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> void</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> rotateLeft</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">[] </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">nums</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">int</span><span style=\"color:#E36209;--shiki-dark:#FFAB70\"> k</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">        int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> n </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> nums.length;</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">        k </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> k </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">%</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> n; </span><span style=\"color:#6A737D;--shiki-dark:#6A737D\">// Ensure k is within the bounds of the array size</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">    </span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">        int</span><span style=\"color:#24292E;--shiki
Related Tags
