From 8c6aeafc53b2042cf9954eb2de53fe2a98f9ba7a Mon Sep 17 00:00:00 2001
From: "huangge1199@hotmail.com" <huangge1199>
Date: Sat, 17 Jul 2021 23:02:23 +0800
Subject: [PATCH] =?UTF-8?q?=E5=89=91=E6=8C=87=20Offer=2039:=E6=95=B0?=
 =?UTF-8?q?=E7=BB=84=E4=B8=AD=E5=87=BA=E7=8E=B0=E6=AC=A1=E6=95=B0=E8=B6=85?=
 =?UTF-8?q?=E8=BF=87=E4=B8=80=E5=8D=8A=E7=9A=84=E6=95=B0=E5=AD=97?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...ngChuXianCiShuChaoGuoYiBanDeShuZiLcof.java | 49 +++++++++++++++++++
 ...hongChuXianCiShuChaoGuoYiBanDeShuZiLcof.md | 25 ++++++++++
 2 files changed, 74 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.java
 create mode 100644 src/main/java/leetcode/editor/cn/ShuZuZhongChuXianCiShuChaoGuoYiBanDeShuZiLcof.md

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 @@
+<p>数组中有一个数字出现的次数超过数组长度的一半，请找出这个数字。</p>
+
+<p>&nbsp;</p>
+
+<p>你可以假设数组是非空的，并且给定的数组总是存在多数元素。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例&nbsp;1:</strong></p>
+
+<pre><strong>输入:</strong> [1, 2, 3, 2, 2, 2, 5, 4, 2]
+<strong>输出:</strong> 2</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>限制：</strong></p>
+
+<p><code>1 &lt;= 数组长度 &lt;= 50000</code></p>
+
+<p>&nbsp;</p>
+
+<p>注意：本题与主站 169 题相同：<a href="https://leetcode-cn.com/problems/majority-element/">https://leetcode-cn.com/problems/majority-element/</a></p>
+
+<p>&nbsp;</p>
+<div><div>Related Topics</div><div><li>数组</li><li>哈希表</li><li>分治</li><li>计数</li><li>排序</li></div></div>\n<div><li>👍 174</li><li>👎 0</li></div>
\ No newline at end of file