Skip to content

[우석] 네크워트, 이중우선순위큐 #99

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.

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

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
41 changes: 41 additions & 0 deletions 최우석/네트워크.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
# 네트워크

```kotlin
import java.util.*

class Solution {
fun solution(n: Int, computers: Array<IntArray>): Int {
var answer = 0

var visited = Array(computers.size) { false }

for ((n, computer) in computers.withIndex()) {
if (visited[n]) {
continue
}
visited[n] = true
bfs(n, computers, visited)
answer += 1
}
return answer
}

fun bfs(n: Int, computers: Array<IntArray>, visited: Array<Boolean>) {
var queue: Queue<Int> = LinkedList<Int>()
queue.add(n)

while (queue.isNotEmpty()) {
var now = queue.poll()

for ((next, computer) in computers[now].withIndex()) {
if (visited[next] || computer != 1) {
continue
}
queue.add(next)
visited[next] = true
}
}
}
}

```
63 changes: 63 additions & 0 deletions 최우석/이중우선순위큐.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,63 @@
# 이중우선순위큐

```kotlin
import java.util.*

class Solution {
fun solution(operations: Array<String>): IntArray {
var answer = intArrayOf()

var totalQueue = mutableSetOf<Int>()
var minQueue = PriorityQueue<Int>()
var maxQueue = PriorityQueue<Int>(Collections.reverseOrder())

for (operation in operations) {
var (command, numberValue) = operation.split(" ")
val number = numberValue.toInt()

if (command == "I") {
totalQueue.add(number)
minQueue.add(number)
maxQueue.add(number)
} else if (command == "D") {
if (number == 1) {
while (maxQueue.isNotEmpty()) {
val maxNumber = maxQueue.poll()
if (totalQueue.contains(maxNumber)) {
totalQueue.remove(maxNumber)
break
}
}
} else {
while (minQueue.isNotEmpty()) {
val minNumber = minQueue.poll()
if (totalQueue.contains(minNumber)) {
totalQueue.remove(minNumber)
break
}
}
}
}
}
print(totalQueue)
var maxNumber = 0
var minNumber = 0
while (maxQueue.isNotEmpty()) {
maxNumber = maxQueue.poll()
print(maxNumber)
if (totalQueue.contains(maxNumber)) {
break
}
maxNumber = 0
}
while (minQueue.isNotEmpty()) {
minNumber = minQueue.poll()
if (totalQueue.contains(minNumber)) {
break
}
minNumber = 0
}
return intArrayOf(maxNumber, minNumber)
}
}
```