feat: 169.majority-element add Python3 implementation (azl397985856#108)

Author: ybian19

problems/169.majority-element.md

@@ -37,9 +37,11 @@ Output: 2
 
 ## 代码
 
-```js
+* 语言支持：JS，Python
 
+Javascript Code:
 
+```js
 /*
  * @lc app=leetcode id=169 lang=javascript
  *
@@ -55,23 +57,23 @@ Output: 2
  *
  * Given an array of size n, find the majority element. The majority element is
  * the element that appears more than ⌊ n/2 ⌋ times.
- * 
+ *
  * You may assume that the array is non-empty and the majority element always
  * exist in the array.
- * 
+ *
  * Example 1:
- * 
- * 
+ *
+ *
  * Input: [3,2,3]
  * Output: 3
- * 
+ *
  * Example 2:
- * 
- * 
+ *
+ *
  * Input: [2,2,1,1,1,2,2]
  * Output: 2
- * 
- * 
+ *
+ *
  */
 /**
  * @param {number[]} nums
@@ -94,3 +96,18 @@ var majorityElement = function(nums) {
 };
 ```
 
+Python Code:
+
+```python
+class Solution:
+    def majorityElement(self, nums: List[int]) -> int:
+        count, majority = 1, nums[0]
+        for num in nums[1:]:
+            if count == 0:
+                majority = num
+            if num == majority:
+                count += 1
+            else:
+                count -= 1
+        return majority
+```