[Swift]LeetCode739. 每日温度 | Daily Temperatures

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10522255.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0instead.

For example, given the list of temperatures T = [73, 74, 75, 71, 69, 72, 76, 73], your output should be [1, 1, 4, 2, 1, 1, 0, 0].

Note: The length of temperatures will be in the range [1, 30000]. Each temperature will be an integer in the range [30, 100].

---

根据每日 气温 列表，请重新生成一个列表，对应位置的输入是你需要再等待多久温度才会升高的天数。如果之后都不会升高，请输入 0来代替。

例如，给定一个列表 temperatures = [73, 74, 75, 71, 69, 72, 76, 73]，你的输出应该是 [1, 1, 4, 2, 1, 1, 0, 0]。

提示：气温 列表长度的范围是 [1, 30000]。每个气温的值的都是 [30, 100] 范围内的整数。

---

484ms

class Solution {
    func dailyTemperatures(_ T: [Int]) -> [Int] {
        let n = T.count
        var res = Array(repeating: 0, count: n)
        for i in (0..<n).reversed() {
            var j = i + 1
            while j < n, T[j] <= T[i]  {
                if res[j] > 0 {
                    j  += res[j]
                } else {
                    j = n
                }
            }
            if j < n {
                res[i] = j - i
            }
        }
        return res
    }
}

---

488ms

class Solution {
    func dailyTemperatures(_ T: [Int]) -> [Int] {
        var result = [Int](repeating: 0, count: T.count)
        var stack = [Int]()
        stack.append(0)
        for i in 1..<T.count {
            while let last = stack.last, T[last] < T[i] {
                stack.removeLast()
                result[last] = i - last
            }
            stack.append(i)
        }
        return result
    }
}

---

556ms

class Solution {
    func dailyTemperatures(_ T: [Int]) -> [Int] {
  var result = Array(repeating: 0, count: T.count)
  var tempStorage = Array(repeating: Int.max, count: 101)

  for i in 0..<T.count {
        tempStorage[T[i]] = i
  }
        
  var minGreaterThanI = Int.max
  
  for currentIndex in (0..<T.count).reversed() {
    let t = T[currentIndex]
      
    if currentIndex != tempStorage[t] {
        tempStorage[t] = currentIndex
    }
      
    for temp in t+1..<101 {
      let indexFromList = tempStorage[temp]
      if indexFromList > currentIndex && indexFromList < minGreaterThanI {
          minGreaterThanI = indexFromList
      }
    }
    
      if minGreaterThanI != Int.max {
          result[currentIndex] = minGreaterThanI - currentIndex
          minGreaterThanI = Int.max
      }
  }
  
  return result
  }
}

---

796ms

class Solution {
    func dailyTemperatures(_ temperatures: [Int]) -> [Int] {
        guard temperatures.count > 1 else { return [0] }

        var result = [Int](repeating: 0, count: temperatures.count)

        var stack = [(index: Int, temperature: Int)]()

        for (index, curTemperature) in temperatures.enumerated() {

            while stack.count > 0 {
                var last = stack.last!
                if curTemperature > last.temperature {
                    last = stack.removeLast()
                    result[last.index] = index - last.index
                } else {
                    break
                }
            }

            stack.append((index, curTemperature))
        }

        return result
    }
}

---

832ms

class Solution {
    
    struct Temperature {
        var temperature = 0
        var index = 0
    }
    
    struct Stack<Temperature> {
        private var temperatures = [Temperature]()
        mutating func push(_ item:Temperature){
            self.temperatures.append(item)
        }
        
        mutating func pop()->Temperature?{
            return self.temperatures.popLast()
        }
        
        func isEmpty() -> Bool {
            return self.temperatures.isEmpty
        }
        
        func peek() -> Temperature? {
           return self.temperatures.last
        }
    }
    
    func dailyTemperatures(_ T: [Int]) -> [Int] {
        var resc:[Int] = Array.init(repeating: 0, count: T.count)
        var stack:Stack = Stack<Temperature>()
        
        for (index,temperature) in T.enumerated() {
            let tempr = Temperature.init(temperature: temperature, index: index)
           
            while let peek = stack.peek(), peek.temperature < temperature {
                resc[peek.index] = index - peek.index
                stack.pop()
            }
            stack.push(tempr)
        }
        return resc
    }
}