[编程珠玑]交换相邻的不同大小的内存块[上]

最新推荐文章于 2021-03-09 16:29:02 发布

liker12134

最新推荐文章于 2021-03-09 16:29:02 发布

阅读量420

点赞数

文章标签：编程珠玑

本文链接：https://blog.csdn.net/likerxu/article/details/44927223

版权

核心：

X [j] = X [(j+ratdist)%size]

greatestCommonDivision(SubSize,Size)按radist步伐遍历数组元素

package neu.pearls.acrobatics;

public class MemoryExchange {
	int block[];

	public MemoryExchange(int size) {
		block = new int[size];
	}

	public void setBlock(int block[]) {
		this.block = block;
	}

	public void frontToBack(int rotdist) {
		for (int i = 0; i < this
				.getGreatestCommonDivisor(rotdist, block.length); i++) {
			int t = block[i];
			int j = i;
			while (true) {
				int k = j + rotdist;
				if (k >= block.length) {
					k -= block.length;
				}
				if (k == i) {
					break;
				}
				block[j] = block[k];
				j = k;
			}
			block[j] = t;

		}
	}

	public void frontToBack2(int rotdist) {
		if (rotdist > block.length || rotdist < 1) {
			System.out.println("Error parameter:"+rotdist);
			return;
		}
		for (int i = 0; i < this
				.getGreatestCommonDivisor(rotdist, block.length); i++) {
			int t = block[i];
			int j = i;
			while (true) {
				int k = (j + rotdist) % block.length;
				if (k == i) {
					break;
				}
				block[j] = block[k];
				j = k;
			}
			block[j] = t;

		}
	}

	public int getGreatestCommonDivisor(int a, int b) {
		while (a != b) {
			if (a > b) {
				a -= b;
			} else {
				b -= a;
			}
		}
		return a;
	}

	public void show() {
		for (int i : block) {
			System.out.print(i + " ");
		}
		System.out.print("\n");
	}

	public static void main(String[] args) {
		MemoryExchange me = new MemoryExchange(10);
		int block[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
		me.setBlock(block);
		me.show();
		// me.frontToBack(5);
		me.frontToBack2(4);
		me.show();
	}

}