[Algorithm] Fish

[hwangJi-dev]

💬 문제

https://app.codility.com/programmers/lessons/7-stacks_and_queues/fish/

💬 풀이

public func solution(_ A : inout [Int], _ B : inout [Int]) -> Int {
 var stack: [Int] = []
 var fish0Count = 0
 
 for i in 0..<A.count {
 if B[i] == 1 {
 stack.append(A[i])
 } else {
 if stack.isEmpty {
 fish0Count += 1
 } else {
 for _ in 0..<stack.count {
 let pop = stack.popLast() ?? -1
 if A[i] < pop {
 stack.append(pop)
 break
 }
 }
 
 if stack.count == 0 {
 fish0Count += 1
 }
 }
 }
 }
 
 return fish0Count + stack.count
}

소요시간 : 문제이해를 잘못해서 너무 오래 걸렸다.

시간 복잡도 : O(N)

평가표 : https://app.codility.com/demo/results/trainingWHWEJW-WG3/