Skip to content

fix sonar for task 438 #138

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
javadev merged 1 commit into from
Jan 10, 2026
Merged

fix sonar for task 438 #138

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,18 +6,18 @@
function findAnagrams(s: string, p: string): number[] {
const map: number[] = new Array(26).fill(0)
for (let i = 0; i < p.length; ++i) {
map[p.charCodeAt(i) - 'a'.charCodeAt(0)]++
map[p.codePointAt(i)! - 'a'.codePointAt(0)!]++
}
const res: number[] = []
let i: number = 0
let j: number = 0
while (i < s.length) {
const idx: number = s.charCodeAt(i) - 'a'.charCodeAt(0)
const idx: number = s.codePointAt(i)! - 'a'.codePointAt(0)!
// Add the new character
map[idx]--
// If the length is greater than window's length, pop the left character in the window
if (i >= p.length) {
map[s.charCodeAt(j++) - 'a'.charCodeAt(0)]++
map[s.codePointAt(j++)! - 'a'.codePointAt(0)!]++
}
let finish: boolean = true
for (let k = 0; k < 26; k++) {
Expand Down