From 6571eb45d2957b369244071f6759cb85f7237b3c Mon Sep 17 00:00:00 2001
From: wangsiyuan <2392948297@qq.com>
Date: Tue, 5 Sep 2023 15:57:42 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20Solution.java?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/solution/Solution.java | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/solution/Solution.java b/src/solution/Solution.java
index 9da3fd3..029ef4c 100644
--- a/src/solution/Solution.java
+++ b/src/solution/Solution.java
@@ -8,7 +8,7 @@ import java.util.Set;
 public class Solution {
 
     //给定一个字符串 s ，找出其中不含有重复字符的 最长子串 的长度。
-    public int lengthOfLongestSubstring(String s) {
+    public static int lengthOfLongestSubstring(String s) {
         // 哈希集合，记录每个字符是否出现过
         Set<Character> occ = new HashSet<Character>();
         int n = s.length();
@@ -52,7 +52,7 @@ public class Solution {
 
 
     //哈希映射算法（Hash Mapping Algorithm）用于找出一个数组中的众数（majority element）
-    public int majorityElement(int[] nums) {
+    public static int majorityElement(int[] nums) {
         Map<Integer, Integer> map = new HashMap<>();
         // maxNum 表示元素，maxCount 表示元素出现的次数
         int maxNum = 0, maxCount = 0;