solution(cpp,java,python): 169. Majority Element

169. Majority Element
- C++
- Java
- Python

Easy/169. Majority Element/solution.cpp

@@ -0,0 +1,8 @@
+class Solution {
+public:
+    int majorityElement(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        int n = nums.size();
+        return nums[n/2];
+    }
+};

Easy/169. Majority Element/solution.java

@@ -0,0 +1,7 @@
+class Solution {
+    public int majorityElement(int[] nums) {
+        Arrays.sort(nums);
+        int n = nums.length;
+        return nums[n/2];
+    }
+}

Easy/169. Majority Element/solution.md

@@ -0,0 +1,14 @@
+# PROBLEM
+
+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.
+
+# EXPLANATION
+
+1. The code begins by sorting the array nums in non-decreasing order using the sort function from the C++ Standard Library. This rearranges the elements such that identical elements are grouped together.
+
+2. Once the array is sorted, the majority element will always be present at index n/2, where n is the size of the array.
+This is because the majority element occurs more than n/2 times, and when the array is sorted, it will occupy the middle position.
+
+3. The code returns the element at index n/2 as the majority element.

Easy/169. Majority Element/solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def majorityElement(self, nums: List[int]) -> int:
+        nums.sort()
+        n = len(nums)
+        return nums[n//2]