LeetCode: 153. Find Minimum in Rotated Sorted Array

16次阅读

共计 186 个字符，预计需要花费 1 分钟才能阅读完成。

defmodule Solution do
  @spec find_min(nums :: [integer]) :: integer
  def find_min(nums) do
    [head | tail] = nums
    tail
    |> Enum.reduce_while(
      head,
      fn item, acc ->
      if item < acc do
        {:halt, item}
      else
        {:cont, acc}
      end
    end)
  end
end

正文完