Merge remote-tracking branch 'origin/master'

src/main/java/contest/y2022/m7/Dw83.java

@@ -0,0 +1,72 @@
+package contest.y2022.m7;
+
+import java.lang.reflect.Array;
+import java.util.Arrays;
+
+public class Dw83 {
+    public static void main(String[] args) {
+        Dw83 solution = new Dw83();
+    }
+
+    public int shortestSequence(int[] rolls, int k) {
+        int cnt = 1;
+        boolean[] uses = new boolean[k + 1];
+        int use = k;
+        for (int i = 0; i < rolls.length; i++) {
+            if (!uses[rolls[i]]) {
+                uses[rolls[i]] = true;
+                use--;
+            }
+            if (use == 0) {
+                cnt++;
+                Arrays.fill(uses, false);
+                use = k;
+            }
+        }
+        return cnt;
+    }
+
+    public long zeroFilledSubarray(int[] nums) {
+        long cnt = 0;
+        int[] cnts = new int[nums.length];
+        if (nums[0] == 0) {
+            cnts[0] = 1;
+            cnt = 1;
+        }
+        for (int i = 1; i < nums.length; i++) {
+            if (nums[i] == 0) {
+                cnts[i] = cnts[i - 1] + 1;
+                cnt += cnts[i];
+            }
+        }
+        return cnt;
+    }
+
+    public String bestHand(int[] ranks, char[] suits) {
+        boolean bl = true;
+        int max = 1;
+        int cnt = 1;
+        Arrays.sort(ranks);
+        for (int i = 1; i < 5; i++) {
+            if (suits[i] != suits[i - 1]) {
+                bl = false;
+            }
+            if (ranks[i] == ranks[i - 1]) {
+                cnt++;
+            } else {
+                max = Math.max(max, cnt);
+                cnt = 1;
+            }
+        }
+        max = Math.max(max, cnt);
+        if (bl) {
+            return "Flush";
+        } else if (max >= 3) {
+            return "Three of a Kind";
+        } else if (max == 2) {
+            return "Pair";
+        } else {
+            return "High Card";
+        }
+    }
+}

src/main/java/contest/y2022/m7/NumberContainers.java

@@ -0,0 +1,32 @@
+package contest.y2022.m7;
+
+import java.util.*;
+
+public class NumberContainers {
+    Map<Integer, Integer> nums;
+    Map<Integer, TreeSet<Integer>> map;
+
+    public NumberContainers() {
+        nums = new HashMap<>();
+        map = new HashMap<>();
+    }
+
+    public void change(int index, int number) {
+        if (nums.containsKey(index)) {
+            map.get(nums.get(index)).remove(index);
+        }
+        nums.put(index, number);
+        TreeSet<Integer> list = map.getOrDefault(number, new TreeSet<>());
+        list.add(index);
+        map.put(number, list);
+    }
+
+    public int find(int number) {
+        TreeSet<Integer> list = map.getOrDefault(number, new TreeSet<>());
+        if (list.size() > 0) {
+            return list.first();
+        } else {
+            return -1;
+        }
+    }
+}

src/main/java/contest/y2022/m9/Week311.java

@@ -0,0 +1,118 @@
+package contest.y2022.m9;
+
+import com.code.leet.entiy.TreeNode;
+
+import java.util.*;
+
+public class Week311 {
+    public static void main(String[] args) {
+        Week311 soluytion = new Week311();
+        //TreeNode root = new TreeNode(Arrays.asList(2, 3, 5, 8, 13, 21, 34));
+        TreeNode root = new TreeNode(Arrays.asList(0, 1, 2, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2));
+        soluytion.reverseOddLevels(root);
+    }
+
+    class Trie {
+        private Trie[] children;
+        private int cnt;
+
+        public Trie() {
+            children = new Trie[26];
+            cnt = 0;
+        }
+
+        public void insert(String word) {
+            Trie node = this;
+            for (int i = 0; i < word.length(); i++) {
+                char ch = word.charAt(i);
+                int index = ch - 'a';
+                if (node.children[index] == null) {
+                    node.children[index] = new Trie();
+                }
+                node = node.children[index];
+                node.cnt += 1;
+            }
+        }
+
+        private int search(String prefix) {
+            Trie node = this;
+            int cnt = 0;
+            for (int i = 0; i < prefix.length(); i++) {
+                char ch = prefix.charAt(i);
+                int index = ch - 'a';
+                if (node.children[index] == null) {
+                    break;
+                }
+                node = node.children[index];
+                cnt += node.cnt;
+            }
+            return cnt;
+        }
+    }
+
+    public int[] sumPrefixScores(String[] words) {
+        Trie trie = new Trie();
+        for (String word : words) {
+            trie.insert(word);
+        }
+        int[] arrs = new int[words.length];
+        for (int i = 0; i < words.length; i++) {
+            arrs[i] = trie.search(words[i]);
+        }
+        return arrs;
+    }
+
+    public TreeNode reverseOddLevels(TreeNode root) {
+        List<Integer> list = new ArrayList<>();
+        Queue<TreeNode> queue = new LinkedList<>();
+        queue.add(root);
+        while (!queue.isEmpty()) {
+            TreeNode node = queue.poll();
+            list.add(node.val);
+            if (node.left != null) {
+                queue.add(node.left);
+                queue.add(node.right);
+            }
+        }
+        root = new TreeNode(list.get(0));
+        queue.add(root);
+        int n = 1;
+        int min = 0;
+        int max = 0;
+        int cnt = 1;
+        int mul = 1;
+        while (cnt < list.size()) {
+            min = max + 1;
+            max += mul * 2;
+            cnt += mul * 2;
+            if (n % 2 == 0) {
+                for (int i = min; i <= max; i = i + 2) {
+                    TreeNode node = queue.poll();
+                    TreeNode left = new TreeNode(list.get(i));
+                    TreeNode right = new TreeNode(list.get(i + 1));
+                    node.left = left;
+                    node.right = right;
+                    queue.add(left);
+                    queue.add(right);
+                }
+            } else {
+                for (int i = max; i >= min; i = i - 2) {
+                    TreeNode node = queue.poll();
+                    TreeNode left = new TreeNode(list.get(i));
+                    TreeNode right = new TreeNode(list.get(i - 1));
+                    node.left = left;
+                    node.right = right;
+                    queue.add(left);
+                    queue.add(right);
+                }
+            }
+            n++;
+            mul *= 2;
+        }
+        return root;
+    }
+
+    public int smallestEvenMultiple(int n) {
+        return n % 2 == 0 ? n : n * 2;
+    }
+}

src/main/java/leetcode/editor/cn/ANumberAfterADoubleReversal.java

@@ -39,6 +39,7 @@
 // 👍 1 👎 0
 
 package leetcode.editor.cn;
+
 //5963:反转两次的数字
 class ANumberAfterADoubleReversal {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/AddTwoNumbers.java

@@ -52,6 +52,7 @@ public class AddTwoNumbers{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/AverageOfLevelsInBinaryTree.java

@@ -50,6 +50,7 @@ public class AverageOfLevelsInBinaryTree{
         // TO TEST
     }
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for a binary tree node.
      * public class TreeNode {

src/main/java/leetcode/editor/cn/BalancedBinaryTree.java

@@ -52,6 +52,7 @@ public class BalancedBinaryTree{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for a binary tree node.
      * public class TreeNode {

src/main/java/leetcode/editor/cn/BaoHanMinhanShuDeZhanLcof.java

@@ -38,6 +38,7 @@ public class BaoHanMinhanShuDeZhanLcof{
         //测试代码
 //        Solution solution = new BaoHanMinhanShuDeZhanLcof().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class MinStack {

src/main/java/leetcode/editor/cn/BinaryTreePostorderTraversal.java

@@ -30,6 +30,7 @@ public class BinaryTreePostorderTraversal{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for a binary tree node.
      * public class TreeNode {

src/main/java/leetcode/editor/cn/BinaryTreeZigzagLevelOrderTraversal.java

@@ -56,7 +56,8 @@ public class BinaryTreeZigzagLevelOrderTraversal {
      * }
      */
     class Solution {
-        public List<List<Integer>> zigzagLevelOrder(TreeNode root) {List<List<Integer>> ans = new LinkedList<List<Integer>>();
+        public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
+            List<List<Integer>> ans = new LinkedList<List<Integer>>();
             if (root == null) {
                 return ans;
             }

src/main/java/leetcode/editor/cn/BooleanEvaluationLcci.java

@@ -26,12 +26,14 @@
 // 👍 43 👎 0
 
 package leetcode.editor.cn;
+
 //面试题 08.14:布尔运算
 public class BooleanEvaluationLcci {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new BooleanEvaluationLcci().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/BuildArrayFromPermutation.java

@@ -38,6 +38,7 @@
 // Related Topics 数组 模拟 👍 2 👎 0
 
 package leetcode.editor.cn;
+
 //1920:基于排列构建数组
 class BuildArrayFromPermutation {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/CheckIfAParenthesesStringCanBeValid.java

@@ -58,6 +58,7 @@
 // 👍 4 👎 0
 
 package leetcode.editor.cn;
+
 //5948:判断一个括号字符串是否有效
 class CheckIfAParenthesesStringCanBeValid {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/CheckIfAllCharactersHaveEqualNumberOfOccurrences.java

@@ -30,6 +30,7 @@
 // Related Topics 哈希表 字符串 计数 👍 0 👎 0
 
 package leetcode.editor.cn;
+
 //1941:检查是否所有字符出现次数相同
 class CheckIfAllCharactersHaveEqualNumberOfOccurrences {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/CheckIfTheSentenceIsPangram.java

@@ -43,6 +43,7 @@ public class CheckIfTheSentenceIsPangram{
         //测试代码
         Solution solution = new CheckIfTheSentenceIsPangram().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/CheckIfWordEqualsSummationOfTwoWords.java

@@ -57,12 +57,14 @@
 // 👍 4 👎 0
 
 package leetcode.editor.cn;
+
 //1880:检查某单词是否等于两单词之和
 public class CheckIfWordEqualsSummationOfTwoWords {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new CheckIfWordEqualsSummationOfTwoWords().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/ChuanDiXinXi.java

@@ -53,6 +53,7 @@ public class ChuanDiXinXi{
         System.out.println(solution.numWays(3, new int[][]{{0, 2}, {2, 1}}, 2));
         System.out.println(solution.numWays(5, new int[][]{{0, 2}, {2, 1}, {3, 4}, {2, 3}, {1, 4}, {2, 0}, {0, 4}}, 3));
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/CloneGraph.java

@@ -108,6 +108,7 @@ class Node {
 
     class Solution {
         private HashMap<Node, Node> use = new HashMap<>();
+
         public Node cloneGraph(Node node) {
             if (node == null) {
                 return node;

src/main/java/leetcode/editor/cn/Combinations.java

@@ -51,6 +51,7 @@ public class Combinations {
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {
         List<List<Integer>> list = new ArrayList<>();
+
         //        public List<List<Integer>> combine(int n, int k) {
 //            int[] nums = new int[n];
 //            for (int i = 0; i < n; i++) {

src/main/java/leetcode/editor/cn/CongWeiDaoTouDaYinLianBiaoLcof.java

@@ -30,6 +30,7 @@ class CongWeiDaoTouDaYinLianBiaoLcof{
 
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/ConvertBinaryNumberInALinkedListToInteger.java

@@ -61,6 +61,7 @@ public class ConvertBinaryNumberInALinkedListToInteger{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/ConvertSortedArrayToBinarySearchTree.java

@@ -45,6 +45,7 @@ class ConvertSortedArrayToBinarySearchTree{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for a binary tree node.
      * public class TreeNode {

src/main/java/leetcode/editor/cn/CorporateFlightBookings.java

@@ -48,6 +48,7 @@
 // Related Topics 数组 前缀和 👍 218 👎 0
 
 package leetcode.editor.cn;
+
 //1109:航班预订统计
 class CorporateFlightBookings {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/CountNicePairsInAnArray.java

@@ -47,6 +47,7 @@ public class CountNicePairsInAnArray{
         //测试代码
         Solution solution = new CountNicePairsInAnArray().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {
@@ -69,6 +70,7 @@ class Solution {
             }
             return (int) (count % (Math.pow(10, 9) + 7));
         }
+
         private int revert(int num) {
             String str = "" + num;
             str = new StringBuilder(str).reverse().toString();

src/main/java/leetcode/editor/cn/CountSquareSumTriples.java

@@ -28,6 +28,7 @@
 // Related Topics 数学 枚举 👍 5 👎 0
 
 package leetcode.editor.cn;
+
 //1925:统计平方和三元组的数目
 class CountSquareSumTriples {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/DeleteMiddleNodeLcci.java

@@ -29,6 +29,7 @@ public class DeleteMiddleNodeLcci{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/DeleteNodeInALinkedList.java

@@ -47,6 +47,7 @@ public class DeleteNodeInALinkedList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/DesignAuthenticationManager.java

@@ -74,6 +74,7 @@ public class DesignAuthenticationManager{
         //测试代码
 //        Solution solution = new DesignAuthenticationManager().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class AuthenticationManager {

src/main/java/leetcode/editor/cn/DesignHashset.java

@@ -56,12 +56,15 @@ public class DesignHashset{
         //测试代码
 //        Solution solution = new DesignHashset().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class MyHashSet {
         List<Integer> list;
 
-    /** Initialize your data structure here. */
+        /**
+         * Initialize your data structure here.
+         */
         public MyHashSet() {
             list = new ArrayList<>();
         }
@@ -81,7 +84,9 @@ class MyHashSet {
             }
         }
 
-    /** Returns true if this set contains the specified element */
+        /**
+         * Returns true if this set contains the specified element
+         */
         public boolean contains(int key) {
             for (int i = 0; i < list.size(); i++) {
                 if (list.get(i) == key) {

src/main/java/leetcode/editor/cn/DetermineColorOfAChessboardSquare.java

@@ -44,12 +44,14 @@
 // 👍 4 👎 0
 
 package leetcode.editor.cn;
+
 //1812:判断国际象棋棋盘中一个格子的颜色
 public class DetermineColorOfAChessboardSquare {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new DetermineColorOfAChessboardSquare().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/EmployeeImportance.java

@@ -56,12 +56,14 @@ class Employee {
 
     class Solution {
         Map<Integer, Employee> map = new HashMap<>();
+
         public int getImportance(List<Employee> employees, int id) {
             for (Employee employee : employees) {
                 map.put(employee.id, employee);
             }
             return dfs(id);
         }
+
         private int dfs(int id) {
             Employee employee = map.get(id);
             int total = employee.importance;

src/main/java/leetcode/editor/cn/FanZhuanLianBiaoLcof.java

@@ -31,6 +31,7 @@ public class FanZhuanLianBiaoLcof{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/FindGreatestCommonDivisorOfArray.java

@@ -45,6 +45,7 @@
 // 👍 2 👎 0
 
 package leetcode.editor.cn;
+
 //1979:找出数组的最大公约数
 class FindGreatestCommonDivisorOfArray {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/FindRightInterval.java

@@ -61,6 +61,7 @@ class FindRightInterval{
         TwoArray twoArray = new TwoArray("[[1,4],[2,3],[3,4]]", true);
         solution.findRightInterval(twoArray.getArr());
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/FindTheMostCompetitiveSubsequence.java

@@ -44,6 +44,7 @@ public class FindTheMostCompetitiveSubsequence{
         //测试代码
         Solution solution = new FindTheMostCompetitiveSubsequence().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/FindingPairsWithACertainSum.java

@@ -70,6 +70,7 @@ public class FindingPairsWithACertainSum{
         //测试代码
 //        Solution solution = new FindingPairsWithACertainSum().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class FindSumPairs {

src/main/java/leetcode/editor/cn/FindingTheUsersActiveMinutes.java

@@ -62,6 +62,7 @@ public class FindingTheUsersActiveMinutes{
         //测试代码
         Solution solution = new FindingTheUsersActiveMinutes().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/FirstUniqueCharacterInAString.java

@@ -28,6 +28,7 @@ class FirstUniqueCharacterInAString{
         //测试代码
         Solution solution = new FirstUniqueCharacterInAString().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/FourXy4Wx.java

@@ -28,12 +28,14 @@
 // 👍 25 👎 0
 
 package leetcode.editor.cn;
+
 //LCP 28:采购方案
 public class FourXy4Wx {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new FourXy4Wx().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/FrequencyOfTheMostFrequentElement.java

@@ -54,6 +54,7 @@ public class FrequencyOfTheMostFrequentElement{
         //测试代码
         Solution solution = new FrequencyOfTheMostFrequentElement().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/GetBiggestThreeRhombusSumsInAGrid.java

@@ -65,6 +65,7 @@ public class GetBiggestThreeRhombusSumsInAGrid{
         //测试代码
         Solution solution = new GetBiggestThreeRhombusSumsInAGrid().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/GroupAnagramsLcci.java

@@ -31,6 +31,7 @@ class GroupAnagramsLcci{
         //测试代码
         Solution solution = new GroupAnagramsLcci().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/HouseRobberIi.java

@@ -64,6 +64,7 @@ public class HouseRobberIi {
             }
             return Math.max(range(Arrays.copyOfRange(nums, 0, length - 1)), range(Arrays.copyOfRange(nums, 1, length)));
         }
+
         public int range(int[] nums) {
             int length = nums.length;
             int start = nums[0], end = Math.max(nums[0], nums[1]);

src/main/java/leetcode/editor/cn/HtmlEntityParser.java

@@ -72,6 +72,7 @@ public class HtmlEntityParser{
         //测试代码
         Solution solution = new HtmlEntityParser().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/IncreasingSubsequences.java

@@ -47,6 +47,7 @@ class IncreasingSubsequences {
     class Solution {
         private List<Integer> path = new ArrayList<>();
         private List<List<Integer>> res = new ArrayList<>();
+
         public List<List<Integer>> findSubsequences(int[] nums) {
             backtracking(nums, 0);
             return res;

src/main/java/leetcode/editor/cn/IncrementalMemoryLeak.java

@@ -42,12 +42,14 @@
 // 👍 2 👎 0
 
 package leetcode.editor.cn;
+
 //1860:增长的内存泄露
 public class IncrementalMemoryLeak {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new IncrementalMemoryLeak().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/InsertionSortList.java

@@ -42,6 +42,7 @@ public class InsertionSortList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/IntegerToRoman.java

@@ -70,12 +70,14 @@
 // 👍 593 👎 0
 
 package leetcode.editor.cn;
+
 //12:整数转罗马数字
 public class IntegerToRoman {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new IntegerToRoman().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/IntersectionOfTwoArraysIi.java

@@ -44,6 +44,7 @@ class IntersectionOfTwoArraysIi{
         //测试代码
         Solution solution = new IntersectionOfTwoArraysIi().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/IntersectionOfTwoLinkedLists.java

@@ -81,6 +81,7 @@ public class IntersectionOfTwoLinkedLists{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/IntersectionOfTwoLinkedListsLcci.java

@@ -24,6 +24,7 @@ public class IntersectionOfTwoLinkedListsLcci{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/InvertBinaryTree.java

@@ -37,6 +37,7 @@ public class InvertBinaryTree{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for a binary tree node.
      * public class TreeNode {

src/main/java/leetcode/editor/cn/IsomorphicStrings.java

@@ -48,6 +48,7 @@ public class IsomorphicStrings{
         Solution solution = new IsomorphicStrings().new Solution();
         solution.isIsomorphic("badc", "baba");
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/JumpGameIi.java

@@ -36,6 +36,7 @@
 // 👍 1053 👎 0
 
 package leetcode.editor.cn;
+
 //45:跳跃游戏 II
 public class JumpGameIi {
     public static void main(String[] args) {
@@ -43,6 +44,7 @@ public class JumpGameIi{
         Solution solution = new JumpGameIi().new Solution();
         System.out.println(solution.jump(new int[]{2, 3, 1, 1, 4}));
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/KClosestPointsToOrigin.java

@@ -47,6 +47,7 @@ class KClosestPointsToOrigin{
         //测试代码
         Solution solution = new KClosestPointsToOrigin().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/KthLargestElementInAnArray.java

@@ -39,6 +39,7 @@ public class KthLargestElementInAnArray{
         //测试代码
         Solution solution = new KthLargestElementInAnArray().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/KthNodeFromEndOfListLcci.java

@@ -25,6 +25,7 @@ public class KthNodeFromEndOfListLcci{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/LargestNumberAfterMutatingSubstring.java

@@ -52,6 +52,7 @@
 // Related Topics 贪心 数组 字符串 👍 5 👎 0
 
 package leetcode.editor.cn;
+
 //1946:子字符串突变后可能得到的最大整数
 class LargestNumberAfterMutatingSubstring {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/LengthOfTheLongestAlphabeticalContinuousSubstring.java

@@ -0,0 +1,63 @@
+//字母序连续字符串 是由字母表中连续字母组成的字符串。换句话说，字符串 "abcdefghijklmnopqrstuvwxyz" 的任意子字符串都是 字母序连
+//续字符串 。 
+//
+// 
+// 例如，"abc" 是一个字母序连续字符串，而 "acb" 和 "za" 不是。 
+// 
+//
+// 给你一个仅由小写英文字母组成的字符串 s ，返回其 最长 的 字母序连续子字符串 的长度。 
+//
+// 
+//
+// 示例 1： 
+//
+// 输入：s = "abacaba"
+//输出：2
+//解释：共有 4 个不同的字母序连续子字符串 "a"、"b"、"c" 和 "ab" 。
+//"ab" 是最长的字母序连续子字符串。
+// 
+//
+// 示例 2： 
+//
+// 输入：s = "abcde"
+//输出：5
+//解释："abcde" 是最长的字母序连续子字符串。
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= s.length <= 10⁵ 
+// s 由小写英文字母组成 
+// 
+//
+// 👍 4 👎 0
+
+package leetcode.editor.cn;
+
+//2414:最长的字母序连续子字符串的长度
+public class LengthOfTheLongestAlphabeticalContinuousSubstring {
+    public static void main(String[] args) {
+        // 测试代码
+        Solution solution = new LengthOfTheLongestAlphabeticalContinuousSubstring().new Solution();
+    }
+
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public int longestContinuousSubstring(String s) {
+            int cnt = 0;
+            int bf = 0;
+            for (int i = 1; i < s.length(); i++) {
+                if (s.charAt(i) - s.charAt(i - 1) != 1) {
+                    cnt = Math.max(cnt, i - bf);
+                    bf = i;
+                }
+            }
+            return Math.max(cnt, s.length() - bf);
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

src/main/java/leetcode/editor/cn/LianBiaoZhongDaoShuDiKgeJieDianLcof.java

@@ -25,6 +25,7 @@ public class LianBiaoZhongDaoShuDiKgeJieDianLcof{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/LiangGeLianBiaoDeDiYiGeGongGongJieDianLcof.java

@@ -72,6 +72,7 @@ public class LiangGeLianBiaoDeDiYiGeGongGongJieDianLcof{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/LinkedListComponents.java

@@ -53,6 +53,7 @@ public class LinkedListComponents{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/LinkedListCycle.java

@@ -67,6 +67,7 @@ public class LinkedListCycle{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * class ListNode {

src/main/java/leetcode/editor/cn/LinkedListCycleIi.java

@@ -70,6 +70,7 @@ public class LinkedListCycleIi{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * class ListNode {

src/main/java/leetcode/editor/cn/LongerContiguousSegmentsOfOnesThanZeros.java

@@ -54,12 +54,14 @@
 // 👍 7 👎 0
 
 package leetcode.editor.cn;
+
 //1869:哪种连续子字符串更长
 public class LongerContiguousSegmentsOfOnesThanZeros {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new LongerContiguousSegmentsOfOnesThanZeros().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/LongestDuplicateSubstring.java

@@ -40,6 +40,7 @@ public class LongestDuplicateSubstring{
         Solution solution = new LongestDuplicateSubstring().new Solution();
         // TO TEST
     }
+
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {
         public String longestDupSubstring(String s) {

src/main/java/leetcode/editor/cn/MaximumAscendingSubarraySum.java

@@ -50,12 +50,14 @@
 // 👍 15 👎 0
 
 package leetcode.editor.cn;
+
 //1800:最大升序子数组和
 public class MaximumAscendingSubarraySum {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MaximumAscendingSubarraySum().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MaximumElementAfterDecreasingAndRearranging.java

@@ -70,6 +70,7 @@ public class MaximumElementAfterDecreasingAndRearranging{
         //测试代码
         Solution solution = new MaximumElementAfterDecreasingAndRearranging().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MaximumIceCreamBars.java

@@ -53,6 +53,7 @@ public class MaximumIceCreamBars{
         //测试代码
         Solution solution = new MaximumIceCreamBars().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MaximumNumberOfWordsFoundInSentences.java

@@ -40,6 +40,7 @@
 // 👍 1 👎 0
 
 package leetcode.editor.cn;
+
 //5946:句子中的最多单词数
 class MaximumNumberOfWordsFoundInSentences {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/MaximumPopulationYear.java

@@ -34,12 +34,14 @@
 // 👍 14 👎 0
 
 package leetcode.editor.cn;
+
 //1854:人口最多的年份
 public class MaximumPopulationYear {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MaximumPopulationYear().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MaximumValueAfterInsertion.java

@@ -43,12 +43,14 @@
 // 👍 4 👎 0
 
 package leetcode.editor.cn;
+
 //1881:插入后的最大值
 public class MaximumValueAfterInsertion {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MaximumValueAfterInsertion().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MaximumXorForEachQuery.java

@@ -56,12 +56,14 @@
 // 👍 11 👎 0
 
 package leetcode.editor.cn;
+
 //1829:每个查询的最大异或值
 public class MaximumXorForEachQuery {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MaximumXorForEachQuery().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MedianOfTwoSortedArrays.java

@@ -68,6 +68,7 @@ public class MedianOfTwoSortedArrays{
         //测试代码
         Solution solution = new MedianOfTwoSortedArrays().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MergeKSortedLists.java

@@ -57,6 +57,7 @@ public class MergeKSortedLists{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {
@@ -75,6 +76,7 @@ class Solution {
             }
             return result;
         }
+
         public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
             if (l1 == null) {
                 return l2;

src/main/java/leetcode/editor/cn/MergeTwoSortedLists.java

@@ -47,6 +47,7 @@ public class MergeTwoSortedLists{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/MiddleOfTheLinkedList.java

@@ -48,6 +48,7 @@ public class MiddleOfTheLinkedList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/MinStack.java

@@ -81,16 +81,20 @@ public class MinStack {
         class Data {
             int num;
             int min;
+
             public Data(int num, int min) {
                 this.num = num;
                 this.min = min;
             }
+
             public int getNum() {
                 return num;
             }
+
             public void setNum(int num) {
                 this.num = num;
             }
+
             public int getMin() {
                 return min;
             }
@@ -99,6 +103,7 @@ public class MinStack {
                 this.min = min;
             }
         }
+
         Stack<Data> stack;
 
         public MinStack1() {

src/main/java/leetcode/editor/cn/MinimizeMaximumPairSumInArray.java

@@ -55,6 +55,7 @@ public class MinimizeMaximumPairSumInArray{
         //测试代码
         Solution solution = new MinimizeMaximumPairSumInArray().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MinimumCostToMoveChipsToTheSamePosition.java

@@ -38,6 +38,7 @@
 // Related Topics 贪心 数组 数学 👍 95 👎 0
 
 package leetcode.editor.cn;
+
 //1217:玩筹码
 class MinimumCostToMoveChipsToTheSamePosition {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/MinimumNumberOfOperationsToMakeStringSorted.java

@@ -55,12 +55,14 @@
 // 👍 1 👎 0
 
 package leetcode.editor.cn;
+
 //5720:使字符串有序的最少操作次数
 public class MinimumNumberOfOperationsToMakeStringSorted {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MinimumNumberOfOperationsToMakeStringSorted().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MinimumNumberOfSwapsToMakeTheBinaryStringAlternating.java

@@ -41,12 +41,14 @@
 // 👍 8 👎 0
 
 package leetcode.editor.cn;
+
 //1864:构成交替字符串需要的最小交换次数
 public class MinimumNumberOfSwapsToMakeTheBinaryStringAlternating {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MinimumNumberOfSwapsToMakeTheBinaryStringAlternating().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/MinimumOperationsToMakeTheArrayIncreasing.java

@@ -45,12 +45,14 @@
 // 👍 7 👎 0
 
 package leetcode.editor.cn;
+
 //1827:最少操作使数组递增
 public class MinimumOperationsToMakeTheArrayIncreasing {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new MinimumOperationsToMakeTheArrayIncreasing().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/NextGreaterNodeInLinkedList.java

@@ -54,6 +54,7 @@ public class NextGreaterNodeInLinkedList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/NthDigit.java

@@ -24,6 +24,7 @@
 // 👍 170 👎 0
 
 package leetcode.editor.cn;
+
 //400:第 N 位数字
 class NthDigit {
     public static void main(String[] args) {

src/main/java/leetcode/editor/cn/NumberOfIslands.java

@@ -78,6 +78,7 @@ public class NumberOfIslands {
             }
             return count;
         }
+
         private void dfs(char[][] grid, int x, int y) {
             if (x < 0 || y < 0 || x >= grid.length || y >= grid[0].length || grid[x][y] == '0') {
                 return;

src/main/java/leetcode/editor/cn/OddEvenLinkedList.java

@@ -34,6 +34,7 @@ public class OddEvenLinkedList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/PalindromeLinkedList.java

@@ -31,6 +31,7 @@ public class PalindromeLinkedList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/PalindromeLinkedListLcci.java

@@ -33,6 +33,7 @@ public class PalindromeLinkedListLcci{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/PartitionList.java

@@ -42,6 +42,7 @@ public class PartitionList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/PascalsTriangle.java

@@ -29,6 +29,7 @@ public class PascalsTriangle{
         //测试代码
         Solution solution = new PascalsTriangle().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/PermutationInString.java

@@ -41,6 +41,7 @@ public class PermutationInString{
         //测试代码
         Solution solution = new PermutationInString().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/PowerOfTwo.java

@@ -56,12 +56,14 @@
 // 👍 362 👎 0
 
 package leetcode.editor.cn;
+
 //231:2 的幂
 class PowerOfTwo {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new PowerOfTwo().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/ProfitableSchemes.java

@@ -44,12 +44,14 @@
 // 👍 138 👎 0
 
 package leetcode.editor.cn;
+
 //879:盈利计划
 public class ProfitableSchemes {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new ProfitableSchemes().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/QueriesOnNumberOfPointsInsideACircle.java

@@ -44,12 +44,14 @@
 // 👍 5 👎 0
 
 package leetcode.editor.cn;
+
 //1828:统计一个圆中点的数目
 public class QueriesOnNumberOfPointsInsideACircle {
     public static void main(String[] args) {
         //测试代码
         Solution solution = new QueriesOnNumberOfPointsInsideACircle().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class Solution {

src/main/java/leetcode/editor/cn/RangeSumQueryMutable.java

@@ -47,12 +47,14 @@
 // 👍 273 👎 0
 
 package leetcode.editor.cn;
+
 //307:区域和检索 - 数组可修改
 public class RangeSumQueryMutable {
     public static void main(String[] args) {
         //测试代码
 //        Solution solution = new RangeSumQueryMutable().new Solution();
     }
+
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
     class NumArray {

src/main/java/leetcode/editor/cn/RemoveDuplicateNodeLcci.java

@@ -42,6 +42,7 @@ public class RemoveDuplicateNodeLcci{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/RemoveDuplicatesFromSortedList.java

@@ -42,6 +42,7 @@ public class RemoveDuplicatesFromSortedList{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/RemoveDuplicatesFromSortedListIi.java

@@ -42,6 +42,7 @@ public class RemoveDuplicatesFromSortedListIi{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {

src/main/java/leetcode/editor/cn/RemoveLinkedListElements.java

@@ -46,6 +46,7 @@ class RemoveLinkedListElements{
     }
     //力扣代码
     //leetcode submit region begin(Prohibit modification and deletion)
+
     /**
      * Definition for singly-linked list.
      * public class ListNode {