zoukankan      html  css  js  c++  java
  • Codility------CyclicRotation

    Task description

    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.

    Solution
     
    Programming language used: Java
    Code: 09:43:49 UTC, java, final, score:  100
    // you can also use imports, for example:
    // import java.util.*;
    
    // you can write to stdout for debugging purposes, e.g.
    // System.out.println("this is a debug message");
    
    class Solution {
        public int[] solution(int[] A, int K) {
            // write your code in Java SE 8
            int length  = A.length;
            int temp[]  = new int[length];
            if(K<0 || K>100 || length == 0)
                return temp;
            if(length == 1)
                return A;
            for(int i=0; i< length; i++) {
                temp[(i+K)%length] = A[i];
            }
            return temp;
        }
    }
  • 相关阅读:
    Java中的访问修饰符详细解析
    Java继承 练习题
    (转)Java 内存整理——堆、栈、常量池
    关于Char思考题
    如何使用帮助文档
    工具类的来由与静态方法
    题解 【NOIP2011】计算系数
    题解 【Uva】硬币问题
    题解 【NOIP2006】作业调度方案
    题解 【NOIP2003】神经网络
  • 原文地址:https://www.cnblogs.com/samo/p/6775395.html
Copyright © 2011-2022 走看看