文档章节

Codewar-010 Rotate Array

圣洁之子
 圣洁之子
发布于 2016/11/24 07:39
字数 639
阅读 8
收藏 0

Create a method named "rotate" that returns a given array with the elements inside the array rotated n spaces.

If n is greater than 0 it should rotate the array to the right. If n is less than 0 it should rotate the array to the left. If n is 0, then it should return the array unchanged.

Example:

Object[] data = new Object[]{1, 2, 3, 4, 5};

rotate(data, 1)    =>    {5, 1, 2, 3, 4}
rotate(data, 2)    =>    {4, 5, 1, 2, 3}
rotate(data, 3)    =>    {3, 4, 5, 1, 2}
rotate(data, 4)    =>    {2, 3, 4, 5, 1}
rotate(data, 5)    =>    {1, 2, 3, 4, 5}

rotate(data, 0)    =>    {1, 2, 3, 4, 5}

rotate(data, -1)    =>    {2, 3, 4, 5, 1}
rotate(data, -2)    =>    {3, 4, 5, 1, 2}
rotate(data, -3)    =>    {4, 5, 1, 2, 3}
rotate(data, -4)    =>    {5, 1, 2, 3, 4}
rotate(data, -5)    =>    {1, 2, 3, 4, 5}

Furthermore the method should take ANY array of objects and perform this operation on them:

rotate(new Object[]{'a', 'b', 'c'}, 1)        =>    {'c', 'a', 'b'}
rotate(new Object[]{1.0, 2.0, 3.0}, 1)        =>    {3.0, 1.0, 2.0}
rotate(new Object[]{true, true, false}, 1)    =>    {false, true, true}

Finally the rotation shouldn't be limited by the indices available in the array. Meaning that if we exceed the indices of the array it keeps rotating.

Example:

Object[] data = new Object[]{1, 2, 3, 4, 5}

rotate(data, 7)        =>    {4, 5, 1, 2, 3}
rotate(data, 11)       =>    {5, 1, 2, 3, 4}
rotate(data, 12478)    =>    {3, 4, 5, 1, 2}
package codewars;

public class Rotator {

	public Object[] rotate(Object[] data, int n) {

		if (n == 0) {
			return data;
		} else {
			Object[] result = new Object[data.length];
			int steps = n % data.length;
			for (int i = 0; i < data.length; i++) {

				result[i] = data[(i - steps >= 0 ? (i - steps) % data.length
						: i - steps + data.length)];
			}

			return result;
		}
	}
}
package codewars;
import static org.junit.Assert.*;
import org.junit.*;

public class RotatorTest {
	private Rotator rotator;
  
  @Before
  public void setUp() {
  	this.rotator = new Rotator();
  }
  
  @After
  public void tearDown() {
  	this.rotator = null;
  }
  
  @Test
  public void testRotateOne_ArrayOfFive() {
  	assertArrayEquals(new Object[]{5, 1, 2, 3, 4},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, 1));
  }
 
 	@Test
  public void testRotateTwo_ArrayOfFive() {
  	assertArrayEquals(new Object[]{4, 5, 1, 2, 3},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, 2));
  }
  
  @Test
  public void testRotateThree_ArrayOfFive() {
  	assertArrayEquals(new Object[]{3, 4, 5, 1, 2},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, 3));
  }
  
  @Test
  public void testRotateFour_ArrayOfFive() {
  	assertArrayEquals(new Object[]{2, 3, 4, 5, 1},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, 4));
  }
 	
  @Test
  public void testRotateFive_ArrayOfFive() {
  	assertArrayEquals(new Object[]{1, 2, 3, 4, 5},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, 5));
  }
  
  @Test
  public void testRotateSix_ArrayOfFive() {
  	assertArrayEquals(new Object[]{5, 1, 2, 3, 4},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, 6));
  }
  
  @Test
  public void testRotateNegOne_ArrayOfFive() {
  	assertArrayEquals(new Object[]{2, 3, 4, 5, 1},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, -1));
  }
  
  @Test
  public void testRotateNegTwo_ArrayOfFive() {
  	assertArrayEquals(new Object[]{3, 4, 5, 1, 2},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, -2));
  }
  
  @Test
  public void testRotateNegThree_ArrayOfFive() {
  	assertArrayEquals(new Object[]{4, 5, 1, 2, 3},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, -3));
  }
  
  @Test
  public void testRotateNegFour_ArrayOfFive() {
  	assertArrayEquals(new Object[]{5, 1, 2, 3, 4},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, -4));
  }
  
  @Test
  public void testRotateNegFive_ArrayOfFive() {
  	assertArrayEquals(new Object[]{1, 2, 3, 4, 5},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, -5));
  }
  
  @Test
  public void testRotateNegSix_ArrayOfFive() {
  	assertArrayEquals(new Object[]{2, 3, 4, 5, 1},
    	rotator.rotate(new Object[]{1, 2, 3, 4, 5}, -6));
  }
}

https://www.codewars.com/kata/5469e0798a3502f4a90005c9/train/java

 

Jake from Codewars

Active in the last 15m

 

7 kyu - Rank earned!

 

A whole world awaits. You’re making coding moves – keep it up. With weekly practice, persistent focus and a kata a day, comes Mastery.

Why don't you share your awesomeness?

© 著作权归作者所有

共有 人打赏支持
上一篇: Codewar-011 How Much?
下一篇: POJ 1010
圣洁之子
粉丝 6
博文 313
码字总数 92996
作品 0
深圳
后端工程师
私信 提问
codewar-010: Directions Reduction

https://www.codewars.com/kata/550f22f4d758534c1100025a/train/java

圣洁之子
2016/12/08
62
0
189. Rotate Array - LeetCode

Question 189. Rotate Array Solution 题目大意:数组中最后一个元素移到第一个,称动k次 思路:用笨方法,再复制一个数组 Java实现: 别人的实现:...

yysue
08/09
0
0
Leetcode 189. Rotate Array

文章作者:Tyan 博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution Version 1 Version 2 Version 3 Reference https://leetcode.com/problems/rotate-array/description/......

SnailTyan
10/13
0
0
每天一个js小算法(日更 21天)

今天写代码的时候 处理定时器相关代码的时候遇到一个很基本的算法 卡住了很久 很气 相当气 然后开始思考为什么自己这么傻? 为什么自己写不出来然后意象不到的焦虑感油然而生 我怎么连这么简...

zz77zz
07/23
0
0
LeetCode:Rotate Array - 循环平移数组

1、题目名称 Rotate Array(循环平移数组) 2、题目地址 https://leetcode.com/problems/rotate-array/ 3、题目内容 英文:Rotate an array of n elements to the right by k steps. 中文:将......

北风其凉
2015/08/09
0
0

没有更多内容

加载失败,请刷新页面

加载更多

Spring应用学习——AOP

1. AOP 1. AOP:即面向切面编程,采用横向抽取机制,取代了传统的继承体系的重复代码问题,如下图所示,性能监控、日志记录等代码围绕业务逻辑代码,而这部分代码是一个高度重复的代码,也就...

江左煤郎
今天
4
0
eclipse的版本

Eclipse各版本代号一览表 Eclipse的设计思想是:一切皆插件。Eclipse核心很小,其它所有功能都以插件的形式附加于Eclipse核心之上。 Eclipse基本内核包括:图形API(SWT/Jface),Java开发环...

mdoo
今天
3
0
SpringBoot源码:启动过程分析(一)

本文主要分析 SpringBoot 的启动过程。 SpringBoot的版本为:2.1.0 release,最新版本。 一.时序图 还是老套路,先把分析过程的时序图摆出来:时序图-SpringBoot2.10启动分析 二.源码分析 首...

Jacktanger
今天
4
0
小白带你认识netty(二)之netty服务端启动(上)

上一章 中的标准netty启动代码中,ServerBootstrap到底是如何启动的呢?这一章我们来瞅下。 server.group(bossGroup, workGroup);server.channel(NioServerSocketChannel.class).optio...

天空小小
今天
3
0
聊聊storm trident batch的分流与聚合

序 本文主要研究一下storm trident batch的分流与聚合 实例 TridentTopology topology = new TridentTopology(); topology.newStream("spout1", spout) .p......

go4it
昨天
5
0

没有更多内容

加载失败,请刷新页面

加载更多

返回顶部
顶部