zoukankan      html  css  js  c++  java
  • 1. 数组小挪移CyclicRotation Rotate an array to the right by a given number of steps.

    数组小挪移;

    package com.code;
    
    import java.util.Arrays;
    
    public class Test02_2 {
        
        public int[] solution(int[] A, int K) {
            int size = A.length;
            if(size < 2){
                return A;
            }
            int [] res = new int[size];
            for(int i=0;i<size;i++){
                res[(i+K)%size] = A[i];
            }
            return res;
        }
        public static void main(String[] args) {
            int [] a = {1,2,3,4,5};
            Test02_2 t02 = new Test02_2();
            int[] s01 = t02.solution(a, 3);
            System.out.println(Arrays.toString(s01));
        }
    }
    
    
    /**
    
    A zero-indexed array A consisting of N integers is given. Rotation of the array means that each element is shifted 
    right by one index, and the last element of the array is also moved to the first place.
    
    For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7]. The goal is to rotate array A K times; 
    that is, each element of A will be shifted to the right by K indexes.
    
    Write a function:
    
    class Solution { public int[] solution(int[] A, int K); }
    
    that, given a zero-indexed array A consisting of N integers and an integer K, returns the array A rotated K times.
    
    For example, given array A = [3, 8, 9, 7, 6] and K = 3, the function should return [9, 7, 6, 3, 8].
    
    Assume that:
    
    N and K are integers within the range [0..100];
    each element of array A is an integer within the range [−1,000..1,000].
    In your solution, focus on correctness. The performance of your solution will not be the focus of the assessment.
    */
  • 相关阅读:
    《软件需求模式》阅读笔记二
    《软件需求模式》阅读笔记一
    《编写有效用例》阅读笔记三
    《编写有效用例》阅读笔记二
    《编写有效用例》阅读笔记一
    《软件需求十步走》阅读笔记三
    英文一分钟自我介绍
    c语言面试常见题
    docker
    LLDP
  • 原文地址:https://www.cnblogs.com/stono/p/6418399.html
Copyright © 2011-2022 走看看