Fix palindrome substring end index, correct length variable, and improve majority-element test

src/BeforeWork/DP/L5_LongestHuiwen.java

@@ -29,7 +29,7 @@ public String longestPalindrome(String s){
         }
         int left=0;
         int right=0;
-        int maxlenght=0;
+        int maxLength=0;
         //遍历的顺序+递归的条件
         for(int i=s.length()-1;i>=0;i--){
             for(int j=i;j<s.length();j++){
@@ -41,13 +41,13 @@ public String longestPalindrome(String s){
                         dp[i][j]=true;
                     }
                 }
-                if(dp[i][j]&&j-i+1>maxlenght){
-                    maxlenght=j-i+1;
+                if(dp[i][j]&&j-i+1>maxLength){
+                    maxLength=j-i+1;
                     left=i;
                     right=j;
                 }
             }
         }
-        return s.substring(left,maxlenght);
+        return s.substring(left,right + 1);
     }
 }

src/BeforeWork/L593.java

@@ -53,7 +53,7 @@ public boolean validSquare(int[] p1, int[] p2, int[] p3, int[] p4) {
     }
 
     Integer length(int[] a,int[] b){
-        int lenght=(a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]);
-        return lenght;
+        int length=(a[0]-b[0])*(a[0]-b[0])+(a[1]-b[1])*(a[1]-b[1]);
+        return length;
     }
 }

src/Test/Test1.java

@@ -1,9 +1,6 @@
 package Test;
 
-import java.util.HashMap;
-import java.util.Map;
-import java.util.Map.Entry;
-import java.util.Set;
+import java.util.Arrays;
 
 /**
  * @author wuboyu <wuboyu@kuaishou.com>
@@ -23,21 +20,39 @@ public class Test1 {
     //1 2 3 3 3
 
     public static void main(String[] args) {
+        int[] hasMajority = {1, 2, 3, 3, 3};
+        int[] hasMajorityEven = {2, 2, 1, 2};
+        int[] noMajority = {1, 2, 3, 4};
+        int[] single = {7};
 
+        assert getShowMoreN(hasMajority) == 3 : "should find majority element 3";
+        assert getShowMoreN(hasMajorityEven) == 2 : "should find majority element 2";
+        assert getShowMoreN(noMajority) == 0 : "should return 0 when no majority exists";
+        assert getShowMoreN(single) == 7 : "single element should be the majority";
+
+        System.out.println("All Test1 assertions passed: " + Arrays.toString(hasMajority));
     }
 
     public static int getShowMoreN(int[] nums){
-        Map<Integer,Integer> map = new HashMap<>();
-        for (int num:nums) {
-            map.put(num,map.getOrDefault(num,0)+1);
+        int candidate = 0;
+        int count = 0;
+        for (int num : nums) {
+            if (count == 0) {
+                candidate = num;
+                count = 1;
+            } else if (candidate == num) {
+                count++;
+            } else {
+                count--;
+            }
         }
-        int n = nums.length;
-        for (Entry<Integer, Integer> entry:map.entrySet()) {
-            if (entry.getValue()>=n/2) {
-                return entry.getKey();
+        int occurrence = 0;
+        for (int num : nums) {
+            if (num == candidate) {
+                occurrence++;
             }
         }
-        return 0;
+        return occurrence > nums.length / 2 ? candidate : 0;
     }
 
 }