基于Java语言的LeetCode编程题目解答设计源码

package everydayProblem; import org.junit.Test; import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * 创建时间：2024/5/9--14:05 */ public class test { @Test public void LeetCode2105test() { LeetCode2105 leetCode = new LeetCode2105(); int[] plants = {2, 2, 3, 3}; int capacityA = 3, capacityB = 4; int count = leetCode.minimumRefill(plants, capacityA, capacityB); System.out.println(count); } @Test public void LeetCode2244test() { LeetCode2244 leetCode = new LeetCode2244(); int[] nums = {218, 211, 220, 218, 211, 218, 218, 217, 213, 215, 219, 214, 210, 210, 212, 219, 214, 211, 216, 218, 211, 216, 218, 218, 212, 210, 211, 211, 215, 216, 212, 219, 219, 210, 217, 218, 217, 217, 213, 216, 217, 212, 217, 219, 215, 217, 215, 218, 210, 218, 218, 210, 212, 219, 217, 214, 216, 218, 220, 217, 215, 215, 213, 210, 212, 211, 215, 218, 214, 212, 211, 216, 210, 216, 218, 220, 211, 211, 212, 218, 218, 210, 215, 210, 215, 213, 212, 220, 217, 219, 214, 216, 217, 214, 215, 213, 218, 219, 220, 219, 215, 216, 219, 218, 211, 215, 210, 214, 210, 215, 219, 214, 212, 217, 219, 215, 214, 217, 213, 219, 213, 218, 217, 214, 216, 219, 217, 217, 211, 214, 214, 220, 220, 216, 218, 216, 220, 211, 213, 219, 218, 219, 215, 216, 216, 220, 211, 214, 212, 219, 210, 215, 218, 218, 220, 210, 214, 211, 217, 214, 220, 214, 213, 210, 219, 213, 214, 210, 212, 216, 210, 217, 211, 215, 217, 213, 214, 210, 217, 212, 217, 216, 217, 210, 211, 213, 214, 220, 211, 216, 214, 211, 217, 211, 211, 215, 219, 219, 213, 216}; int result = leetCode.minimumRounds(nums); System.out.println(result); } @Test public void LeetCode1542test() { LeetCode1542 leetCode = new LeetCode1542(); String s = "32424153"; int count = leetCode.longestAwesome(s); System.out.println(count); } @Test public void LeetCode1177test() { LeetCode1177 leetCode = new LeetCode1177(); String s = "abcda"; int[][] queries = {{3, 3, 0}, {1, 2, 0}, {0, 3, 1}, {0, 3, 2}, {0, 4, 1}}; List<Boolean> booleans = leetCode.canMakePaliQueries1(s, queries); System.out.println(booleans); } @Test public void LeetCode1371test() { LeetCode1371 leetCode = new LeetCode1371(); String s = "eleetminicoworoep"; int maxLength = leetCode.findTheLongestSubstring(s); System.out.println(maxLength); } @Test public void LeetCode2644test() { LeetCode2644 leetCode = new LeetCode2644(); int[] nums = {20, 14, 21, 10}; int[] divisors = {5, 7, 5}; int score = leetCode.maxDivScore(nums, divisors); System.out.println(score); } @Test public void LeetCode1553test() { LeetCode1553 leetCode = new LeetCode1553(); int minDays = leetCode.minDays(10); System.out.println(minDays); } @Test public void LeetCode826test() { LeetCode826 leetCode = new LeetCode826(); int[] difficulty = {85, 47, 57}; int[] profit = {24, 101, 99}; int[] worker = {40, 81, 25}; int maxProfit = leetCode.maxProfitAssignment(difficulty, profit, worker); System.out.println(maxProfit); } @Test public void LeetCode2589test() { LeetCode2589 leetCode = new LeetCode2589(); int[][] tasks = {{2, 6, 1}, {4, 5, 1}, {1, 5, 1}}; int runTime = leetCode.findMinimumTime(tasks); System.out.println(runTime); } @Test public void LeetCode2831test() { LeetCode2831 leetCode = new LeetCode2831(); List<Integer> nums = new ArrayList<>(Arrays.asList(3, 2, 8, 4, 5, 5, 6, 7, 10, 7, 10, 6, 2, 5, 5)); int numCount = leetCode.longestEqualSubarray(nums, 6); System.out.println(numCount); } @Test public void LeetCode1673test() { LeetCode1673 leetCode = new LeetCode1673(); int[] nums = {3, 5, 6, 2}; int[] result = leetCode.mostCompetitive(nums, 2); System.out.println(Arrays.toString(result)); } @Test public void LeetCode2981test() { LeetCode2981 leetCode = new LeetCode2981(); String s = "ccc"; int maxLength = leetCode.maximumLength(s); System.out.println(maxLength); } @Test public void LeetCode2982test() { LeetCode2982 leetCode = new LeetCode2982(); String s = "bbcc"; int maxLength = leetCode.maximumLength(s); System.out.println(maxLength); } @Test public void LeetCode2965test() { LeetCode2965 leetCode = new LeetCode2965(); int[][] grid = {{1, 3}, {2, 2}}; int[] values = leetCode.findMissingAndRepeatedValues(grid); System.out.println(Arrays.toString(values)); } @Test public void NumArraytest() { int[] nums = {1, 3, 5}; NumArray leetCode = new NumArray(nums); System.out.println(leetCode.sumRange(0, 2)); leetCode.update(1, 2); System.out.println(leetCode.sumRange(0, 2)); } @Test public void LeetCode3072test() { LeetCode3072 leetCode = new LeetCode3072(); int[] nums = {5, 14, 3, 1, 2}; int[] result = leetCode.resultArray(nums); System.out.println(Arrays.toString(result)); } @Test public void LeetCode3040test() { LeetCode3040 leetCode = new LeetCode3040(); int[] nums = {3, 2, 1, 2, 3, 4}; int maxCount = leetCode.maxOperations(nums); System.out.println(maxCount); } @Test public void LeetCode1423test() { LeetCode1423 leetCode = new LeetCode1423(); int[] cardPoints = {1, 2, 3, 4, 5, 6, 1}; int maxValue = leetCode.maxScore(cardPoints, 3); System.out.println(maxValue); } @Test public void LeetCode215test() { LeetCode215 leetCode = new LeetCode215(); int[] nums = {3, 2, 3, 1, 2, 4, 5, 5, 6}; int kthLargest = leetCode.findKthLargest(nums, 9); System.out.println(kthLargest); } @Test public void LeetCode312test() { LeetCode312 leetCode = new LeetCode312(); int[] nums = {7, 9, 8, 0, 7, 1, 3, 5, 5, 2, 3}; int maxCount = leetCode.maxCoins(nums); System.out.println(maxCount); } @Test public void LeetCode491test() { LeetCode491 leetCode = new LeetCode491(); char[][] board = {{'X', '.', 'X', '.', 'X'}, {'.', 'X', '.', 'X', '.'}, {'.', 'X', '.', '.', '.'}, {'.', 'X', '.', '.', 'X'}, {'.', 'X', '.', '.', '.'}, {'X', '.', 'X', 'X', 'X'}, {'.', 'X', '.', '.', '.'}, {'.', 'X', '.', 'X', '.'}, {'X', '.', 'X', '.', 'X'}, {'.', 'X', '.', '.', 'X'}}; int count = leetCode.countBattleships(board); System.out.println(count); } @Test public void LeetCode2813test() { LeetCode2813 leetCode = new LeetCode2813(); int[][] items = {{3, 2}, {3, 1}, {2, 2}, {5, 3}}; long maximumElegance = leetCode.findMaximumElegance(items, 3); System.out.println(maximumElegance); } @Test public void LeetCode2713test() { LeetCode2713 leetCode = new LeetCode2713(); int[][] mat = {{3, 1, 6}, {-9, 5, 7}}; int frequency = leetCode.maxIncreasingCells(mat); System.out.println(frequency); } @Test public void LCRleetCode61test() { LCRleetCode61 leetCode = new LCRleetCode61(); int[] temperatureA = {21, 18, 18, 18, 31}, temperatureB = {34, 32, 16, 16, 17}; i