迷宫未完

    package test;
    
    import java.beans.Visibility;
import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
    import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
    import java.util.Set;


    public class TestMain {
    	
    	static String ans=new String();
    	static int x[]= {-1,0,1,0};
    	static int y[]= {0,1,0,-1};
    	static boolean mark[][]=new boolean[35][55];
    	static String direction[]= {"L","D","R","U"};
    	public static void main(String[] args) {
    		mark[1][1]=true;
        	Scanner input=new Scanner(System.in);
        	for(int i=1;i<=30;i++)
        	{
        		String string=input.nextLine();
        		int n=0;
        		while(string.indexOf("1")!=-1)
        		{
        			mark[i][string.indexOf("1")+1]=true;
        			string.replace('1', '0');
        			
        		}
        	}
        	TestMain testMain =new TestMain();
        	testMain.dfs(x, y, direction, ans, "", 1, 1);
        	System.out.println(true);
		}
    	public boolean check(int x,int y) {
			if(x<=0||x>30||y<=0||y>50)
				return false;
			return true;
		}
    	public void dfs(int x[],int y[],String direction[],String ans,String ans1,int xx,int yy) {
			if(mark[30][50])
			{	if(ans.isEmpty())
					{
					ans=ans1;
					}
				else if (ans.length()>=ans1.length()&&ans.compareTo(ans1)>0) {
					
					ans=ans1;	
				}
				
				
			}
			
			for(int i=0;i<4;i++)
			{
				int newX=xx+x[i];
				int newY=yy+y[i];
				if(check(newX, newY)&&!mark[newX][newY])
				{
					ans1+=direction[i];
					mark[newX][newY]=true;
					dfs(x, y, direction, ans, ans1, newX, newY);
					mark[newX][newX]=false;
				}
			}
		}
    	
    }