Map에서 containsKey로 List도 확인가능하다.
22ms
class Solution {
public int equalPairs(int[][] grid) {
int result = 0;
int n = grid.length;
Map<List<Integer>, Integer> map = new HashMap<>();
List<List<Integer>> list = new ArrayList<>();
for(int i = 0; i < n; i++) {
List<Integer> temp = new ArrayList<>();
List<Integer> temp1 = new ArrayList<>();
for(int j = 0; j < n; j++) {
temp.add(grid[i][j]);
temp1.add(grid[j][i]);
}
map.put(temp, map.getOrDefault(temp, 0) + 1);
list.add(temp1);
}
for(List<Integer> l: list) {
if (map.containsKey(l)) {
result += map.get(l);
}
}
return result;
}
}
'코딩테스트' 카테고리의 다른 글
[leetcode] 735. Asteroid Collision (0) | 2024.06.28 |
---|---|
[leetcode] 162. Find Peak Element (0) | 2024.06.28 |
[leetcode] 1493. Longest Subarray of 1's After Deleting One Element (0) | 2024.06.25 |
[leetcode] 1004. Max Consecutive One III (0) | 2024.06.25 |
[leetcode] 1456.Maximum Number of Vowels in a Substring of Given Length (0) | 2024.06.24 |