์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |
Tags
- SwiftUI
- ํ๋ก๊ทธ๋๋จธ์ค
- ์ด์งํ์
- ios
- ๋ธ๋ฃจํธํฌ์ค
- ๋ธ๋ฃจํธํฌ์ค ์๊ณ ๋ฆฌ์ฆ
- ๋ถํ ํ์
- ์๊ณ ๋ฆฌ์ฆ
- ๋ฐฑ์ค
- ์คํ
- ์ฝํ
- ๋นํธ์ฐ์ฐ์
- ๋ฌธ์์ด
- ๋ถํ ์ ๋ณต
- BFS
- ๋ฐฑํธ๋ํน
- ๋์ ํฉ
- dp
- WebApp
- ๊ทธ๋ฆฌ๋ ์๊ณ ๋ฆฌ์ฆ
- ์์
- Queue
- dfs
- ๋ถํ ์ ๋ณต
- ์ ํด๋ฆฌ๋ ํธ์ ๋ฒ
- Swift
- ์ฝ๋ฉํ ์คํธ
- WebView
Archives
- Today
- Total
MUKER_DEV with iOS
[swift] ํ๋ก๊ทธ๋๋จธ์ค - ๋ชจ์์ฌ์ ๋ณธ๋ฌธ
๋์ ํ์ด
func solution(_ word:String) -> Int {
let alphabet = ["A","E","I","O","U"]
var arr = [String]()
func DFS(_ s: String) {
arr.append(s)
if s.count == alphabet.count { return }
for i in 0..<alphabet.count {
DFS(s+alphabet[i])
}
}
DFS("")
return arr.firstIndex(of: word)!
}
ํ์ด ํค์๋
DFS
'๐ค ์๊ณ ๋ฆฌ์ฆ > programmers' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[swift] ํ๋ก๊ทธ๋๋จธ์ค -2๊ฐ ์ดํ๋ก ๋ค๋ฅธ ๋นํธ (0) | 2023.04.13 |
---|---|
[swift] ํ๋ก๊ทธ๋๋จธ์ค - [1์ฐจ] ํ๋ ์ฆ4๋ธ๋ก (0) | 2023.04.12 |
[swift] ํ๋ก๊ทธ๋๋จธ์ค - [3์ฐจ] ํ์ผ๋ช ์ ๋ ฌ (0) | 2023.04.10 |
[swift] ํ๋ก๊ทธ๋๋จธ์ค - ๋ฐฉ๋ฌธ ๊ธธ์ด (0) | 2023.04.07 |
[swift] ํ๋ก๊ทธ๋๋จธ์ค - ์คํฌํธ๋ฆฌ (0) | 2023.04.06 |