-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathFindAllAnagramsInAString_438.swift
More file actions
59 lines (54 loc) · 1.53 KB
/
FindAllAnagramsInAString_438.swift
File metadata and controls
59 lines (54 loc) · 1.53 KB
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
//
// FindAllAnagramsInAString_438.swift
// LeetCode_Swift
//
// Created by Huni on 30/10/2017.
// Copyright © 2017 KnighhtJoker. All rights reserved.
//
import Foundation
class FindAllAnagramsInAString_438 {
func findAnagrams(_ s: String, _ p: String) -> [Int] {
let m = p.count
let n = s.count
var result = [Int]()
if n < m {
return result
}
var sArray = [Int]()
var pArray = [Int]()
let sUnicodeArray = Array(s.unicodeScalars)
var sumP = 0
var sumST = 0
let aValue = Int(UnicodeScalar("a")!.value)
for _ in 1...256 {
sArray.append(0)
pArray.append(0)
}
for u in p.unicodeScalars {
pArray[Int(u.value) - aValue] += 1
}
for u in p.unicodeScalars {
sumP += Int(u.value)
}
for u in sUnicodeArray[0..<m] {
sumST += Int(u.value)
sArray[Int(u.value) - aValue] += 1
}
for i in 0..<n-m {
if sumP == sumST {
if sArray == pArray {
result.append(i)
}
}
sArray[Int(sUnicodeArray[i].value) - aValue] -= 1
sArray[Int(sUnicodeArray[i+m].value) - aValue] += 1
sumST = sumST - Int(sUnicodeArray[i].value) + Int(sUnicodeArray[i+m].value)
}
if sumP == sumST {
if sArray == pArray {
result.append(n-m)
}
}
return result
}
}