我将尝试简明清晰地说明我的现有情况和需求。
我有一个由字符元素组成的二维数组,形成一个棋盘。我需要从底部进行一次射击,并用“·”来表示它。射击从底部(a.length-1)到顶部(0),在墙壁上反弹,这取决于射击的方向。
if (dirDisp == 3){
for(int x = 3, y = 0; x < 5 & y < 2; x++, y++) {
if(a[(a.length-1) - y][(a[x].length-1) / 2 + x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 + x] = '·';
}
for(int x = 0, y = 1; x < 9 & y < 11; x++, y++) {
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
for(int x = 0, y = 9; x < 5 & y < 14; x++, y++) {
if(a[(a.length-1) - y][x] == EMPTY)
a[(a.length-1) - y][x] = '·';
}
}
我将提供shot direction = 3的代码。 EMPTY常量为' '。事实上,数组中还有其他字符,例如'a','b'等。
我的意图是,如果没有EMPTY,则停止循环。实际上它所做的是:
g g b g g y y r r
y o y a r y g o b
g o r a b r a a b
g y o a y a g o b
g a b b b o o b g
·
·
r r r r r r r r r
·
·
·
·
·
·
当射击到第一个与EMPTY不同的字符时,射击必须停止。我试过使用break和continue。还尝试了使用firstLoop:{},在循环的每个部分中使用布尔值,但都没有成功。我需要一点帮助。
如果有不清楚的地方,请问。
注:shot有三个'for'循环,第一个是从底部到第一堵墙填充数组,第二个是用于墙之间的空间,第三个是用于相反的墙到顶部。 注2:'r'行是为了让您看到实际发生的情况。
使用布尔值后:
a b a b y a r y y
y a o y g r o g g
g o y o a y y a y
y o a a g o o b a
o o r a o r g y y
r r r r r r r r r
·
·
主类
import java.util.Scanner;
import java.util.ArrayList;
import java.util.Stack;
public class BobbleTexto {
public static Scanner sc = new Scanner(System.in);
public static char RED = 'r';
public static char GREEN = 'g';
public static char BLUE = 'b';
public static char ORANGE = 'o';
public static char YELLOW = 'y';
public static char GRAY = 'a';
public static char PURPLE = 'p';
public static char EMPTY = ' ';
public static char IZQUIERDA = 'A';
public static char DERECHA = 'D';
public static char DISPARO = 'S';
public static char SALIR = 'Q';
public static char [][] generarTablero (){
char [][] a = new char [14][9];
for (int x = 0; x < a.length; x++){
for (int y = 0; y < a[x].length;y++){
a [x][y] = EMPTY;
}
}
for(int x = 0; x < 5; x++){
for(int y = 0; y < a[y].length; y++){
a[x][y] = generarBurbuja();
a[7][y] = RED;
}
}
return a;
}
public static char [][] limpiarTablero (char [][] a){
for (int x = 0; x < a.length; x++){
for (int y = 0; y < a[x].length;y++){
if (a [x][y] == '·')
a[x][y] = EMPTY;
}
}
return a;
}
public static void imprimirDisparo (char [][] a,int dirDisp,char Burbuja){
if (dirDisp == 1){
for(int x = 1, y = 0; x < 5 & y < 4; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 + x] == EMPTY){
a[(a.length-1) - y][(a[x].length-1) / 2 + x] = '·';
}
else{
break;
}
}
for(int x = 0, y = 3; x < 9 & y < 11; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY){
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
else{
}
}
for(int x = 0, y = 11; x < 4 & y < 14; x++, y++){
if(a[(a.length-1) - y][x] == EMPTY){
a[(a.length-1) - y][x] = '·';
}
else{
break;
}
}
}
if (dirDisp == 2){
for(int x = 2, y = 0; x < 5 & y < 3; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 + x] == EMPTY){
a[(a.length-1) - y][(a[x].length-1) / 2 + x] = '·';
}
else {
}
}
for(int x = 0, y = 2; x < 9 & y < 11; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY){
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
else {
}
}
for(int x = 0, y = 10; x < 4 & y < 14; x++, y++){
if(a[(a.length-1) - y][x] == EMPTY){
a[(a.length-1) - y][x] = '·';
}
else {
}
}
}
if (dirDisp == 3){
boolean foundObstacle = false;
for(int x = 3, y = 0; x < 5 & y < 2 && !foundObstacle; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 + x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 + x] = '·';
else {
foundObstacle = true;
break;
}
}
if(!foundObstacle) {
for(int x = 0, y = 1; x < 9 & y < 11 && !foundObstacle; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
else {
foundObstacle = true;
break;
}
}
}
if(!foundObstacle) {
for(int x = 0, y = 9; x < 5 & y < 14 && !foundObstacle; x++, y++){
if(a[(a.length-1) - y][x] == EMPTY)
a[(a.length-1) - y][x] = '·';
else break;
}
}
}
if (dirDisp == 4){
for(int x = 4, y = 0; x < 5 & y < 1; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 + x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 + x] = '·';
}
for(int x = 0, y = 0; x < 9 & y < 11; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
for(int x = 0, y = 8; x < 6 & y < 14; x++, y++){
if(a[(a.length-1) - y][x] == EMPTY)
a[(a.length-1) - y][x] = '·';
}
}
if (dirDisp == 0) {
for (int x = 0; x < a.length; x++)
if(a[x][(a[x].length - 1) / 2] == EMPTY)
a[x][(a[x].length - 1) / 2] = '·';
}
if (dirDisp == -1){
for(int x = 1, y = 0; x < 5 & y < 4; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 - x] = '·';
}
for(int x = 1, y = 3; x < 11 & y < 12; x++, y++){
if(a[(a.length-1) - y][x-1] == EMPTY)
a[(a.length-1) - y][x-1] = '·';
}
for(int x = 0, y = 11; x < 4 & y < 14; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
}
if (dirDisp == -2){
for(int x = 2, y = 0; x < 5 & y < 4; x++, y++){
if( a[(a.length-1) - y][(a[x].length-1) / 2 - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 - x] = '·';
}
for(int x = 1, y = 2; x < 10 & y < 12; x++, y++){
if(a[(a.length-1) - y][x-1] == EMPTY)
a[(a.length-1) - y][x-1] = '·';
}
for(int x = 0, y = 10; x < 4 & y < 14; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
}
if (dirDisp == -3){
for(int x = 3, y = 0; x < 5 & y < 4; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 - x] = '·';
}
for(int x = 1, y = 1; x < 10 & y < 12; x++, y++){
if(a[(a.length-1) - y][x-1] == EMPTY)
a[(a.length-1) - y][x-1] = '·';
}
for(int x = 0, y = 9; x < 5 & y < 14; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
}
if (dirDisp == -4){
for(int x = 4, y = 0; x < 5 & y < 4; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) / 2 - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) / 2 - x] = '·';
}
for(int x = 1, y = 0; x < 10 & y < 12; x++, y++){
if(a[(a.length-1) - y][x-1] == EMPTY)
a[(a.length-1) - y][x-1] = '·';
}
for(int x = 0, y = 8; x < 6 & y < 14; x++, y++){
if(a[(a.length-1) - y][(a[x].length-1) - x] == EMPTY)
a[(a.length-1) - y][(a[x].length-1) - x] = '·';
}
}
for (int x = 0; x < a.length; x++){
System.out.println();
for (int y = 0; y < a[x].length; y++){
System.out.print(" "+a [x][y]+" ");
}
}
System.out.println("\nDirección de disparo ["+dirDisp+"]");
System.out.println("Burbuja ["+Burbuja+"]");
}
public static int getDirDisp(){
int dirDisp = sc.nextInt();
while (dirDisp < -4 || dirDisp > 4){
System.out.println("Introduzca una dirección de disparo válida(-1,-2,-3,0,1,2,3)");
dirDisp = sc.nextInt();
}
return dirDisp;
}
public static char generarBurbuja(){
char burbuja = EMPTY;
int azar = (int) (Math.random() * 6);
switch (azar){
case 0 : burbuja = RED; break;
case 1 : burbuja = GREEN; break;
case 2 : burbuja = BLUE; break;
case 3 : burbuja = ORANGE; break;
case 4 : burbuja = YELLOW; break;
case 5 : burbuja = GRAY; break;
case 6 : burbuja = PURPLE; break;
}
return burbuja;
}
public static char obtenerAccionJugador (){
System.out.println("Acción?");
String aux = sc.next();
char accion = aux.charAt(0);
while (accion != IZQUIERDA && accion != DERECHA && accion != DISPARO && accion != SALIR){
System.out.println("Introduzca una acción válida:");
aux = sc.next();
accion = aux.charAt(0);
}
System.out.println("***************************");
return accion;
}
public static void obtenerTrayectoria (char [][] a){
System.out.println("Posiciones:");
for (int x = 0; x < a.length; x++){
for (int y = 0; y < a[x].length;y++){
if(a [x][y] == '·'){
Posicion pos = new Posicion(x,y);
ArrayList<Posicion> aListPos = new ArrayList<Posicion>();
aListPos.add(pos);
for(Posicion ii : aListPos){
System.out.println("(" + pos.getFila() + "," + pos.getColumna()+")");
}
}
}
}
}
public static char [][] realizarDisparo (char [][] a,char Burbuja){
int c [] = new int [a.length];
int w = 0;
for (int x = 0; x < a.length; x++){
for (int y = 0; y < a[x].length;y++){
if (a [x][y] == '·'){
w++;
c [w]= x;
}
if(a[c[1]][y] == '·'){
a[c[1]][y] = Burbuja;
}
}
}
return a;
}
public static int moverDerecha (int dirDisp, char [][] a){
if(dirDisp == -4)
dirDisp = -3;
else if (dirDisp == -3)
dirDisp = -2;
else if (dirDisp == -2)
dirDisp = -1;
else if (dirDisp == -1)
dirDisp = 0;
else if (dirDisp == 0)
dirDisp = 1;
else if (dirDisp == 1)
dirDisp = 2;
else if (dirDisp == 2)
dirDisp = 3;
else if(dirDisp == 3)
dirDisp = 4;
return dirDisp;
}
public static int moverIzquierda (int dirDisp, char [][] a){
if(dirDisp == 4)
dirDisp = 3;
else if (dirDisp == 3)
dirDisp = 2;
else if (dirDisp == 2)
dirDisp = 1;
else if (dirDisp == 1)
dirDisp = 0;
else if (dirDisp == 0)
dirDisp = -1;
else if (dirDisp == -1)
dirDisp = -2;
else if (dirDisp == -2)
dirDisp = -3;
else if(dirDisp == -3)
dirDisp = -4;
else{}
return dirDisp;
}
public static boolean existenBurbujas (char [][] a){
boolean result = true;
int contadorBurbujas = 0;
for (int x = 0; x < a.length; x++){
for (int y = 0; y < a[x].length;y++){
if(a [x][y] != EMPTY){
contadorBurbujas++;
}
}
}
if(contadorBurbujas > 0){
return true;
}
return result;
}
public static void borrarBurbujasAgrupadas(char [][] b, Posicion p) {
if(b[p.fila][p.columna] != EMPTY)
vecinos(b, p.fila, p.columna, b[p.fila][p.columna]);
}
private static void vecinos(char [][] b, int i_comienzo, int j_comienzo, char destino) {
Stack<Integer> ic = new Stack<Integer>();
Stack<Integer> jc = new Stack<Integer>();
ic.add(i_comienzo);
jc.add(j_comienzo);
int t = 0;
boolean [][] visitados = new boolean[b.length][b[0].length];
while( !ic.isEmpty() ) {
int i = ic.pop();
int j = jc.pop();
visitados[i][j] = true;
t++;
if(j-1 >= 0) {
if(b[i][j-1] == destino && !visitados[i][j-1]) {
ic.push(i);
jc.push(j-1);
}
}
if(j+1 < b[0].length) {
if(b[i][j+1] == destino && !visitados[i][j+1]) {
ic.push(i);
jc.push(j+1);
}
}
if(i-1 >=0) {
if(b[i-1][j] == destino && !visitados[i-1][j]) {
ic.push(i-1);
jc.push(j);
}
}
if(i+1 < b.length) {
if(b[i+1][j] == destino && !visitados[i+1][j]) {
ic.push(i+1);
jc.push(j);
}
}
if(j-1 >=0 && i-1 >=0) {
if(b[i-1][j-1] == destino && !visitados[i-1][j-1]) {
ic.push(i-1);
jc.push(j-1);
}
}
if(j+1 < b[0].length && i-1 >= 0 ) {
if(b[i-1][j+1] == destino && !visitados[i-1][j+1]) {
ic.push(i-1);
jc.push(j+1);
}
}
if(j-1>=0 && i+1<b.length) {
if(b[i+1][j-1] == destino && !visitados[i+1][j-1]) {
ic.push(i+1);
jc.push(j-1);
}
}
if(j+1<b[0].length && i+1<b.length) {
if(b[i+1][j+1] == destino && !visitados[i+1][j+1]) {
ic.push(i+1);
jc.push(j+1);
}
}
}
if(t >= 3)
for(int i=0; i<visitados.length; i++)
for(int j=0; j<visitados[i].length; j++)
if(visitados[i][j])
b[i][j] = EMPTY;
}
public static void jugar (){
Posicion p = new Posicion();
char [][] a = generarTablero();
System.out.println("Introduzca la dirección de disparo(-1,-2,-3,-4,0,1,2,3,4)");
int dirDisp = getDirDisp();
char Burbuja = generarBurbuja();
imprimirDisparo(a,dirDisp,Burbuja);
char accion = obtenerAccionJugador();
while(true){
if (accion == IZQUIERDA){
dirDisp = moverIzquierda(dirDisp,a);
limpiarTablero(a);
imprimirDisparo(a,dirDisp,Burbuja);
accion = obtenerAccionJugador();
}
else if(accion == DERECHA) {
dirDisp = moverDerecha(dirDisp,a);
limpiarTablero(a);
imprimirDisparo(a,dirDisp,Burbuja);
accion = obtenerAccionJugador();
}
else if(accion == DISPARO){
realizarDisparo(a,Burbuja);
borrarBurbujasAgrupadas(a,p);
Burbuja = generarBurbuja();
imprimirDisparo(a,dirDisp,Burbuja);
obtenerTrayectoria(a);
accion = obtenerAccionJugador();
}
else if (accion == SALIR){
System.out.println("GAME OVER");
}continue;
}
}
public static void main (String[] args){
jugar();
}
}
另一个带有对象的类
public class Posicion {
int fila;
int columna;
public Posicion(int fila,int columna) {
this.fila = fila;
this.columna = columna;
}
public int getFila(){
return this.fila;
}
public int getColumna(){
return this.columna;
}
public Posicion(){}
尝试一种新的拍摄方式
在收到您的所有答案后,我采用了一种新的拍摄方法,比第一种方法更加简单,使用while循环和更加容易理解的常量名称。
位置类仍然保持不变。
下面是正方向发射代码:
public static void getTrayectory (char [][] a,int shootDirection){
int x = 0, y = 0;
START = ((RIGHT_WALL)/2) + shootDirection;
a [BOTTOM][START] = SHOT;
if(shootDirection > 0){
while (!isOut(BOTTOM-x,START+y) && emptyCell(BOTTOM-x,START+y)){
b [BOTTOM - x][START + y] = SHOT;
x++; y++;
}
y = 0; x=x-1;
while (!isOut(BOTTOM-x,RIGHT_WALL-y) && emptyCell(BOTTOM-x,RIGHT_WALL-y)){
b [BOTTOM-x][RIGHT_WALL-y] = SHOT;
x++; y++;
}
y = 0; x=x-1;
while (!isOut(BOTTOM-x,LEFT_WALL+y) && emptyCell(BOTTOM-x,LEFT_WALL+y)){
b [BOTTOM-x][LEFT_WALL+y] = SHOT;
x++; y++;
}
y = 0;
while (!isOut(BOTTOM-x,RIGHT_WALL-y) && emptyCell(BOTTOM-x,RIGHT_WALL-y)){
b [BOTTOM-x][RIGHT_WALL-y] = SHOT;
x++; y++;
}
}
}
你还需要这个才能编译它 ;)
public static char [][] b = new char [25][9];
public static char EMPTY = '-';
public static char SHOT = 'x';
public static Scanner sc = new Scanner(System.in);
public static int shootDirection;
public static int BOTTOM = b.length - 1;
public static int RIGHT_WALL = b[0].length - 1;
public static int LEFT_WALL = 0;
public static int TOP = 0;
public static int CENTER = ((RIGHT_WALL)/2);
public static int START = ((RIGHT_WALL)/2) + shootDirection;
public static void fill (char [][] b){
for (int x = 0; x < b.length; x++){
for (int y = 0; y < b[x].length;y++){
b [x][y] = EMPTY;
b [10][y] = 'A';
}
}
}
public static void show (char [][] b){
for (int x = 0; x < b.length; x++){
System.out.println();
for (int y = 0; y < b[x].length; y++){
System.out.print(" "+b [x][y]+" ");
}
}
}
public static boolean isOut (int x,int y){
if(x < TOP)return true;
if(y > RIGHT_WALL)return true;
if(y < LEFT_WALL)return true;
return false;
}
static boolean emptyCell(int x, int y){
return b [x-1][y] == EMPTY;
}
事实上,它是有效的,但emptyCell方法有一个错误。它返回b [x-1] [y] == EMPTY,因为如果使用return b [x] [y]会出现OutOfBounds错误。由于x-1,循环停止比应该早一行,我不知道如何修改它使其正常工作。
另一件事是,我想做一个更简单的方法,但即使在下面的小例子中,我也不能通过我的常量弄清楚如何做到这一点。我希望你能帮我做到这一点,它一定很容易,但我不知道怎么做。通过isOut方法和emptyCell方法,答案必须接近。谢谢,对于这个长串的线程感到抱歉。
&
,但应该使用逻辑与&&
。在这种情况下,我认为它们的作用是相同的,但你仍然应该进行更正。 - hyde