One line in Ruby


  • 0
    F
    def majority_element(nums)
        return nums.sort[nums.length/2]
    end
    

    Can someone help me by explaining time and space complexities of this solution? Thanks!


  • 1
    K

    Ruby Sorting is quick sort which has essentially O(nlogn) in time and O(logn) in space. While it's not the optimal solution, which is O(n), it's easy to understand.


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.