Java for LeetCode 189 Rotate Array

來源:互聯網
上載者:User

標籤:

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

解題思路:

JAVA實現如下:

    public void rotate(int[] nums, int k) {        k%=nums.length;        k=nums.length-k;        int[] nums2=new int[k];        for(int i=0;i<k;i++)        nums2[i]=nums[i];        for(int i=0;i<nums.length-k;i++)        nums[i]=nums[i+k];        for(int i=0;i<k;i++)        nums[nums.length-k+i]=nums2[i];    }

 

Java for LeetCode 189 Rotate Array

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.