풀이
class Solution {
public char repeatedCharacter(String s) {
Set<Character> seen = new HashSet<>();
for(int i=0;i<s.length();i++) {
if(seen.contains(s.charAt(i)))
return s.charAt(i);
seen.add(s.charAt(i));
}
return ' ';
}
}
'Software Engineering > Algorithm' 카테고리의 다른 글
[LeetCode] #560 Subarray Sum Equals K (0) | 2024.07.06 |
---|---|
[LeetCode] #1941 Check if All Characters Have Equal Number of Occurrences (0) | 2024.06.23 |
[LeetCode] #2248 Intersection of Multiple Arrays (0) | 2024.06.23 |
[LeetCode] Two Sum (0) | 2024.06.22 |
[LeetCode] K Radius Subarray Averages (0) | 2024.06.10 |