Cisco

link

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution {
static boolean[][] visited;
public static boolean exist(char[][] board, String word) {
visited=new boolean[board.length][board[0].length];
for(int i=0;i<board.length;i++){
for(int j=0;j<board[i].length;j++){
if(search(board,word,i,j,0,true,true)) return true;
}
}
return false;
}
private static boolean search(char[][] board, String word, int i, int j, int index,boolean horizontal,boolean vertical){
if(index==word.length()) return true;

if(i>=board.length || i<0 ||j>=board[i].length || j<0 ||board[i][j]!=word.charAt(index) ||visited[i][j]){
return false;
}

visited[i][j]=true;
if(horizontal&&(search(board,word,i-1,j,index+1,true,false) ||
search(board,word,i+1,j,index+1,true,false)) ||
vertical&&(search(board,word,i,j-1,index+1,false,true) ||
search(board,word,i,j+1,index+1,false,true))){
return true;
}

visited[i][j]=false;
return false;
}
}
public class MyClass {
public static void main(String[] args) {
char[][] board={{'A','B','C','E'},
{'S','F','C','S'},
{'A','D','E','E'}};
String word="ASAD";
System.out.println(Solution.exist(board, word));
}
}

link

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
import java.io. BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class MyClass{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int num=scanner.nextInt();
char[][] board=new char[num][num];
for(int i=0;i<num;i++){
for(int j=0;j<num;j++){
if((i+j)%2==0){
board[i][j]='W';
}else{
board[i][j]='B';
}
}
}
for(char[] row:board)System.out.println(String.valueOf(row));
}
}

0%