diff --git a/src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.java b/src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.java new file mode 100644 index 0000000..5d861ab --- /dev/null +++ b/src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.java @@ -0,0 +1,49 @@ +//数组中有一个数字出现的次数超过数组长度的一半,请找出这个数字。 +// +// +// +// 你可以假设数组是非空的,并且给定的数组总是存在多数元素。 +// +// +// +// 示例 1: +// +// 输入: [1, 2, 3, 2, 2, 2, 5, 4, 2] +//输出: 2 +// +// +// +// 限制: +// +// 1 <= 数组长度 <= 50000 +// +// +// +// 注意:本题与主站 169 题相同:https://leetcode-cn.com/problems/majority-element/ +// +// +// Related Topics 数组 哈希表 分治 计数 排序 +// 👍 174 👎 0 + +package leetcode.editor.cn; + +import java.util.Arrays; + +//剑指 Offer 39:数组中出现次数超过一半的数字 +class ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof { + public static void main(String[] args) { + //测试代码 + Solution solution = new ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof().new Solution(); + } + + //力扣代码 + //leetcode submit region begin(Prohibit modification and deletion) + class Solution { + public int majorityElement(int[] nums) { + Arrays.sort(nums); + return nums[nums.length / 2]; + } + } +//leetcode submit region end(Prohibit modification and deletion) + +} \ No newline at end of file diff --git a/src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.md b/src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.md new file mode 100644 index 0000000..3c5af7d --- /dev/null +++ b/src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.md @@ -0,0 +1,25 @@ +

数组中有一个数字出现的次数超过数组长度的一半,请找出这个数字。

+ +

 

+ +

你可以假设数组是非空的,并且给定的数组总是存在多数元素。

+ +

 

+ +

示例 1:

+ +
输入: [1, 2, 3, 2, 2, 2, 5, 4, 2]
+输出: 2
+ +

 

+ +

限制:

+ +

1 <= 数组长度 <= 50000

+ +

 

+ +

注意:本题与主站 169 题相同:https://leetcode-cn.com/problems/majority-element/

+ +

 

+
Related Topics
  • 数组
  • 哈希表
  • 分治
  • 计数
  • 排序
  • \n
  • 👍 174
  • 👎 0
  • \ No newline at end of file