Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit68f48a3

Browse files
committed
Modified 2 solutions
1 parent1328cbf commit68f48a3

File tree

2 files changed

+45
-105
lines changed

2 files changed

+45
-105
lines changed

‎Easy/Available Captures for Rook.java

Lines changed: 27 additions & 80 deletions
Original file line numberDiff line numberDiff line change
@@ -1,86 +1,33 @@
11
classSolution {
2-
publicintnumRookCaptures(char[][]board) {
3-
intnumOfPawns =0;
4-
5-
int[]rookPos =getRookPos(board);
6-
introw =rookPos[0];
7-
intcol =rookPos[1];
8-
9-
for (inti =col +1;i <board[0].length;i++) {
10-
if (board[row][i] =='.') {
11-
continue;
12-
}
13-
14-
if (board[row][i] =='B') {
15-
break;
16-
}
17-
18-
if (board[row][i] =='p') {
19-
numOfPawns++;
20-
break;
21-
}
2+
int[][]dirs = {{0,1}, {1,0}, {-1,0}, {0, -1}};
3+
publicintnumRookCaptures(char[][]board) {
4+
for (inti =0;i <board.length;i++) {
5+
for (intj =0;j <board[i].length;j++) {
6+
if (board[i][j] =='R') {
7+
returngetPawnCount(board,i,j);
228
}
23-
24-
for (inti =col -1;i >=0;i--) {
25-
if (board[row][i] =='.') {
26-
continue;
27-
}
28-
29-
if (board[row][i] =='B') {
30-
break;
31-
}
32-
33-
if (board[row][i] =='p') {
34-
numOfPawns++;
35-
break;
36-
}
37-
}
38-
39-
for (inti =row +1;i <board.length;i++) {
40-
if (board[i][col] =='.') {
41-
continue;
42-
}
43-
44-
if (board[i][col] =='B') {
45-
break;
46-
}
47-
48-
if (board[i][col] =='p') {
49-
numOfPawns++;
50-
break;
51-
}
52-
}
53-
54-
for (inti =row -1;i >=0;i--) {
55-
if (board[i][col] =='.') {
56-
continue;
57-
}
58-
59-
if (board[i][col] =='B') {
60-
break;
61-
}
62-
63-
if (board[i][col] =='p') {
64-
numOfPawns++;
65-
break;
66-
}
67-
}
68-
69-
returnnumOfPawns;
9+
}
7010
}
71-
72-
privateint[]getRookPos(char[][]board) {
73-
int[]pos =newint[2];
74-
75-
for (inti =0;i <board.length;i++) {
76-
for (intj =0;j <board[i].length;j++) {
77-
if (board[i][j] =='R') {
78-
pos[0] =i;
79-
pos[1] =j;
80-
}
81-
}
11+
return0;
12+
}
13+
14+
privateintgetPawnCount(char[][]board,inti,intj) {
15+
intcount =0;
16+
for (int[]dir :dirs) {
17+
intnewX =i +dir[0];
18+
intnewY =j +dir[1];
19+
while (newX >=0 &&newX <board.length &&newY >=0 &&newY <board[0].length) {
20+
if (board[newX][newY] =='p') {
21+
count++;
22+
break;
23+
}
24+
elseif (board[newX][newY] =='B') {
25+
break;
8226
}
83-
84-
returnpos;
27+
newX =newX +dir[0];
28+
newY =newY +dir[1];
29+
}
8530
}
31+
returncount;
32+
}
8633
}
Lines changed: 18 additions & 25 deletions
Original file line numberDiff line numberDiff line change
@@ -1,28 +1,21 @@
11
classSolution {
2-
publicint[]sumEvenAfterQueries(int[]A,int[][]queries) {
3-
int[]evenQuerySum =newint[queries.length];
4-
5-
intcurrEvenSum =0;
6-
for (intnum :A) {
7-
currEvenSum +=num %2 ==0 ?num :0;
8-
}
9-
10-
for (inti=0;i<queries.length;i++) {
11-
intval =queries[i][0];
12-
intidx =queries[i][1];
13-
booleanwasPrevEven =A[idx] %2 ==0;
14-
A[idx] =A[idx] +val;
15-
16-
if (A[idx] %2 ==0) {
17-
currEvenSum +=wasPrevEven ?val :A[idx];
18-
}
19-
else {
20-
currEvenSum -=wasPrevEven ? (A[idx] -val) :0;
21-
}
22-
23-
evenQuerySum[i] =currEvenSum;
24-
}
25-
26-
returnevenQuerySum;
2+
publicint[]sumEvenAfterQueries(int[]A,int[][]queries) {
3+
intsum =0;
4+
for (intnum :A) {
5+
sum +=num %2 ==0 ?num :0;
276
}
7+
int[]ans =newint[queries.length];
8+
for (inti =0;i <queries.length;i++) {
9+
intnewVal =A[queries[i][1]] +queries[i][0];
10+
if (A[queries[i][1]] %2 ==0) {
11+
sum -=A[queries[i][1]];
12+
}
13+
A[queries[i][1]] =newVal;
14+
if (A[queries[i][1]] %2 ==0) {
15+
sum +=newVal;
16+
}
17+
ans[i] =sum;
18+
}
19+
returnans;
20+
}
2821
}

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp