Puzzle项目实现

题目：

从最左边0下标进，最右边9下标出，数组里的数字是下标位置变化值，查找从头到尾的跳动路径。 注意标记可以沿着该行向左或向右移动，但不可以移动超过任一端。

思路

用栈保存已走的结点，若不通，回退，从上个结点未跳的方向跳找新路

测试数据

1. 4 8 5 2 3 5 1 6 4 0
   

2. 4 8 5 2 3 5 1 3 4 0
   

3. 4 3 5 2 3 5 1 3 4 0
   

代码：

Puzzle.java

import java.util.Scanner;
import java.util.Stack;

public class Puzzle {
	private PuzzleNode[] puzzleNodes;
	private Stack<PuzzleNode> stack;
	
	Puzzle() {
		puzzleNodes=new PuzzleNode[10];
		stack=new Stack<PuzzleNode>();
	}
	
	private void initValue() {
		System.out.println("请输入长为10的puzzle序列：");
		Scanner sc=new Scanner(System.in);
		for(int i=0;i<puzzleNodes.length;i++) {
			puzzleNodes[i]=new PuzzleNode(sc.nextInt(),i);
		}
	}
	
	//初始左右状态(越界 或重复)
	private void innitState() {
		for(int i=0;i<puzzleNodes.length;i++) {
			if(puzzleNodes[i].getIndex()+puzzleNodes[i].getValue() < puzzleNodes.length) {
				puzzleNodes[i].setRight(true);
			}
			if(puzzleNodes[i].getIndex()-puzzleNodes[i].getValue() >=0) {
				puzzleNodes[i].setLeft(true);
			}
		}
	}
	
	//从首位置走到末位置
	//默认先找右边；不通则找另一边，还不行，则回退
	public void goPuzzle(){
		initValue();
		innitState();
		
		stack.push(puzzleNodes[0]);
		while(!stack.isEmpty()) {
			PuzzleNode top=stack.peek();
			
			//已走到
			if(top.getIndex()==puzzleNodes.length-1) {
				break;
			}
			
			//避免成环和重复
			if(top.getRight()==true ) {
				stack.push( puzzleNodes[top.getIndex()+top.getValue()] );
				//将当前结点的走过方向（右）封掉，因为若不通，下次肯定不会走该方向了
				top.setRight(false);
				//下一结点的往回来方向（左）不一定会跳到当前结点
				
			}else if(top.getLeft()==true) {
				stack.push( puzzleNodes[top.getIndex()-top.getValue()] );
				
				top.setLeft(false);

			}else if(!top.getRight()&&!top.getLeft()) {
				//左右都不通，不修改他的左右状态，直接压栈又出栈
				stack.pop();
			}
		}
		show();
	}

	private void show() {
		// TODO Auto-generated method stub
		// TODO Auto-generated method stub
		if(stack.isEmpty()) {
			System.out.println("没有迷宫路径");
			return;//退出
		}
		
		//调整顺序
		Stack<PuzzleNode> temp=new Stack<PuzzleNode>();
		while(!stack.isEmpty()) {
			temp.push(stack.peek());
			stack.pop();
		}
		System.out.println("路径已找到，如下：");
		while(!temp.isEmpty()) {
			System.out.print(temp.peek().getValue()+" ");
			temp.pop();
		}
	}
}

PuzzleNode.java

public class PuzzleNode {
	
	private int value;
	private boolean left;
	private boolean right;
	private int index;//在数组中的下标

	public PuzzleNode(int value,int index) {
		// TODO Auto-generated constructor stub
		this.setValue(value);
		this.setIndex(index);
		
	}

	public int getIndex() {
		return index;
	}

	public void setIndex(int index) {
		this.index = index;
	}

	public int getValue() {
		return value;
	}

	public void setValue(int value) {
		this.value = value;
	}
	

	public boolean getRight() {
		return right;
	}
	
	
	public void setRight(boolean flag) {
		this.right = flag;
	}

	public boolean getLeft() {
		return left;
	}

	public void setLeft(boolean flag) {
		this.left = flag;
	}
}

PuzzleTest.java

public class PuzzleTest {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Puzzle puzzle=new Puzzle();
		puzzle.goPuzzle();

	}

}

相关链接

迷宫（Maze）项目实现