Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an array nums of size n, return the majority element.
The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.
 
Please complete the following python code precisely:
```python
class Solution:
    def majorityElement(self, nums: List[int]) -> int:
```