題目

Rotate an array of?n?elements to the right by?k?steps.

For example, with?n?= 7 and?k?= 3, the array?[1,2,3,4,5,6,7]?is rotated to?[5,6,7,1,2,3,4].

Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

[show hint]

Related problem:?Reverse Words in a String II

Credits:
Special thanks to?@Freezen?for adding this problem and creating all test cases.

代碼

public class Solution {public void rotate(int[] nums, int k) {int len=nums.length;if(k==0 || k==len) return;if(k>len) k=k-len;int[] result=new int[len];int result_index=0;int j=0;for(int i=k;i>=1;i--){result[result_index]=nums[len-i];result_index++;}while(result_index<len){result[result_index]=nums[j];result_index++;j++;}for(int m=0;m<len;m++){nums[m]=result[m];}} }


代碼下載：https://github.com/jimenbian/GarvinLeetCode

/********************************

* 本文來自博客 ?“李博Garvin“

* 轉載請標明出處:http://blog.csdn.net/buptgshengod

******************************************/

《新程序員》：云原生和全面數字化實踐50位技術專家共同創作，文字、視頻、音頻交互閱讀

總結

以上是生活随笔為你收集整理的【LeetCode从零单排】No189.Rotate Array的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。