【算法】程序猿不写代码是不对的44

最新推荐文章于 2017-06-29 16:59:51 发布

kingdz618

最新推荐文章于 2017-06-29 16:59:51 发布

阅读量294

点赞数

分类专栏：算法程序算法练习课堂文章标签：算法栈

本文链接：https://blog.csdn.net/kingdz618/article/details/70624713

版权

算法同时被 2 个专栏收录

81 篇文章 0 订阅

订阅专栏

程序算法练习课堂

81 篇文章 2 订阅

订阅专栏

package com.kingdz.algorithm.time201704;

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;

/**
 * 马踏棋盘，使用栈来实现，不确定是不是对的
 * 
 * @author kingdz
 * 
 */
public class Algo24 {

	private static List<ChessPoint> move;

	static {
		move = new ArrayList<ChessPoint>();
		move.add(new ChessPoint(-1, -2));
		move.add(new ChessPoint(-2, -1));
		move.add(new ChessPoint(-2, 1));
		move.add(new ChessPoint(-1, 2));
		move.add(new ChessPoint(1, 2));
		move.add(new ChessPoint(2, 1));
		move.add(new ChessPoint(2, -1));
		move.add(new ChessPoint(1, -2));
	}

	public static void main(String[] args) {
		Stack<ChessPoint> travel = new Stack<ChessPoint>();

		int[][] chess = new int[8][8];
		for (int i = 0; i < 8; i++) {
			for (int j = 0; j < 8; j++) {
				chess[i][j] = 0;
			}
		}

		travel(travel, chess, new ChessPoint(0, 0));
	}

	private static void travel(Stack<ChessPoint> travel, int[][] chess, ChessPoint start) {
		// 记录每个点访问过的方向
		Stack<Integer> direct = new Stack<Integer>();
		// 记录步骤
		int curstep = 1;

		travel.push(start);
		direct.push(0);
		chess[start.getX()][start.getY()] = curstep;
		while (travel.size() != 64) {
			ChessPoint cp = travel.peek();
			int i = direct.peek();

			int x = 0;
			int y = 0;
			for (; i < move.size(); i++) {
				x = cp.getX() + move.get(i).getX();
				y = cp.getY() + move.get(i).getY();

				if (x < 0 || x > 7) {
					continue;
				} else if (y < 0 || y > 7) {
					continue;
				} else if (chess[x][y] != 0) {
					continue;
				}
				break;
			}

			if (i < move.size()) {
				// 如果有可以走的方向
				direct.pop();
				direct.push(i + 1);
				direct.push(0);
				travel.push(new ChessPoint(x, y));
				curstep++;
				chess[x][y] = curstep;
			} else {
				// 没有可以走的方向
				direct.pop();
				ChessPoint oldcp = travel.pop();
				chess[oldcp.getX()][oldcp.getY()] = 0;
				curstep--;
			}
		}
	}
}