Rotate Array

来源:互联网 发布:淘宝优惠券在哪里看 编辑:程序博客网 时间:2024/06/14 06:20
public class Solution {    public void rotate(int[] nums, int k) {        if (nums == null || nums.length == 0) {            return;        }        k = k % nums.length;        reverse(nums, 0, nums.length - 1);        reverse(nums, 0, k - 1);        reverse(nums, k, nums.length - 1);    }    private void reverse (int[] nums, int start, int end) {        while (start < end) {            int temp = nums[start];            nums[start] = nums[end];            nums[end] = temp;            start++;            end--;        }    }}

0 0
原创粉丝点击