chore(azl397985856#169): 删除无用注释

Author: azl397985856

problems/169.majority-element.md

@@ -42,43 +42,6 @@ Output: 2
 Javascript Code:
 
 ```js
-/*
- * @lc app=leetcode id=169 lang=javascript
- *
- * [169] Majority Element
- *
- * https://leetcode.com/problems/majority-element/description/
- *
- * algorithms
- * Easy (51.62%)
- * Total Accepted:    365.6K
- * Total Submissions: 702.5K
- * Testcase Example:  '[3,2,3]'
- *
- * 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
- * @return {number}
- */
 var majorityElement = function(nums) {
     let count = 1;
     let majority = nums[0];