weixin_43170297的博客

原创 LeetCode LCP33蓄水(java)

class Solution { public int storeWater(int[] bucket, int[] vat) { int ans = Integer.MAX_VALUE; if(IntStream.of(vat).sum() == 0){ return 0; } for(int i=1; i<10001; i++){ int temp = i; for(int j = 0; j<bucket.length; j++){ int .

原创 LeetCode LCP 28采购方案(java/ python3)

python3class Solution: def purchasePlans(self, nums: List[int], target: int) -> int: mod = 1000000007 res = 0 nums = [i for i in nums if i < target] n = len(nums) - 1 m = 0 nums.sort() .

原创 LeetCode 263丑数(java)

class Solution { public boolean isUgly(int num) { if(num < 1) return false; while (num %5 == 0 ) num /=5; while (num % 3 == 0) num /= 3; while (num % 2 == 0) num >>= 1; .

原创 IDEA项目显示在上方处理方法

原创 LeetCode 1768 交替合并字符串(java)

class Solution { public String mergeAlternately(String word1, String word2) { StringBuilder sb = new StringBuilder(); int len = Math.max(word1.length(), word2.length()); for(int i = 0; i< len; i++) { if(.

原创 LeetCode 390消除游戏(java)

class Solution { public int lastRemaining(int n) { // 递归方法 // 判断特例 if(n == 1 || n == 2) return n; return n == 1 ? 1: 2 * (n / 2 + 1 - lastRemaining(n / 2)); }}

原创 LeetCode 365水壶问题(java)

class Solution { public boolean canMeasureWater(int x, int y, int z) { // 判断特例 if(x + y < z) return false; if(x == z || y == z || x + y == z) return true; return z % help(x, y) == 0; .

原创 LeetCode 73矩阵置零(java)

class Solution { public void setZeroes(int[][] matrix) { int m = matrix.length, n = matrix[0].length; int [][] temp = new int [m][n]; for(int i = 0; i < m; ++i) for(int j = 0; j < n; ++j) .

原创 LeetCode1748 唯一元素的和(java)

class Solution { public int sumOfUnique(int[] nums) { Map<Integer, Integer> map = new HashMap<>(); // 遍历 for(int num : nums) map.put(num, map.getOrDefault(num, 0) + 1); int sum = 0; .

原创 LeetCode 1758生成交替二进制字符串的最小操作数(java)

class Solution { public int minOperations(String s) { int res1 = 0, res2 = 0, j = 0; for(int i = 0; i < s.length(); i++) { if(s.charAt(i) - '0' == j) res1++; else res2++; .

原创 LeetCode 1716计算力扣银行的钱(java)

class Solution { public int totalMoney(int n) { int res = 0 ; for(int i = 0, base = 1; i < n; ++i) { res += base + i % 7; if((i + 1) % 7 == 0) ++base; } return res; }}

原创 LeetCode剑指offer26 树的子结构(JAVA)

class Solution { public boolean isSubStructure(TreeNode A, TreeNode B) { if(A == null || B == null) return false; return help(A, B) || isSubStructure(A.left, B) || isSubStructure(A.right, B); } public boolean help(.

原创 LeetCode 1710卡车上的最大单元数(java)

class Solution { public int maximumUnits(int[][] boxTypes, int truckSize) { Arrays.sort(boxTypes, (a, b) ->{ return -(a[1] - b[1]); }); int res = 0; for(int i = 0; i< boxTypes.length; ++i) { .

原创 LeetCode 1704判断字符串的两半是否相似(java)

class Solution { public boolean halvesAreAlike(String s) { // 先将字符串转化为小写,再转化为字符数组 char[] ch = s.toLowerCase().toCharArray(); int count1 = 0, count2 = 0, len = ch.length >> 1; for(int i = 0; i< ch.length; i++) { .

原创 LeetCode 1688比赛中的配对次数(java)

class Solution { public int numberOfMatches(int n) { return n == 1 ? 0 : n - 1; }}

原创 LeetCode 1700无法吃午餐的学生数量(java))

class Solution { public int countStudents(int[] students, int[] sandwiches) { int [] amount = new int[2]; for(int i : students) amount[i]++; for(int i : sandwiches) { if(amount[i] > 0) .

原创 LeetCode 1672最富有客户的资产总量(java)

class Solution { public int maximumWealth(int[][] accounts) { int max = 0; for(int i =0; i< accounts.length; i++) { int x = 0; for(int j = 0; j < accounts[i].length; j++) { x += accounts[i].

原创 LeetCode 164最大间距(java)

class Solution { public int maximumGap(int[] nums) { int len = nums.length; Arrays.sort(nums); int temp = 0; int res = 0; if(len < 2) return 0; for(int i = 0; i < len - 1; i++) { .

原创 LeetCode 324摆动排序(java)

class Solution { public void wiggleSort(int[] nums) { Arrays.sort(nums); int len = nums.length; // 数组克隆,再排序 int[] temp = nums.clone(); for(int i = 0; i < len/ 2; i++) { nums[2 * i] = temp[(len - 1).

原创 LeetCode 1329按矩阵对角线排序(java)

class Solution { public int[][] diagonalSort(int[][] mat) { int m = mat.length, n = mat[0].length; for(int k = 0; k < Math.min(m, n); k++) { for(int i = 0; i< m - 1; i++) { for(int j = 0; j < n -.

原创 LeetCode 1414和为k的最小斐波切纳数字数目(java)

class Solution { public int findMinFibonacciNumbers(int k) { if(k == 0) return 0; int a = 1, b = 1; while(b <= k) { b += a; a = b -a; } return findMinFibonacciNumbers(k - .

原创 LeetCode 738单调递增的数字(java)

class Solution { public int monotoneIncreasingDigits(int N) { int i = 1; int res = N; while( i <= res/10) { int temp = res / i % 100; i *= 10; if(temp / 10 > temp % 10) .

原创 LeetCode 1374生成每种字符都是奇数个的字符串(java)

class Solution { public String generateTheString(int n) { if(n < 1) return ""; char[] ch = new char[n]; for(int i = 0; i < n- 1; i++) { ch[i] = 'a'; } ch[n - 1] = (n & 1) == .

原创 LeetCode 1389按既定顺序创建目标数组(java)

class Solution { public int[] createTargetArray(int[] nums, int[] index) { List<Integer> list = new ArrayList<>(); for(int i = 0; i < index.length; i++) { list.add(index[i], nums[i]); }..

原创 LeetCode 1464数组中两元素的最大乘积(java)

class Solution { public int maxProduct(int[] nums) { int temp1 = nums[0], temp2 = nums[1]; for(int i = 2; i< nums.length; i ++) { if(temp1 > temp2) temp2 = nums[i] > temp2 ? nums[i] : temp2; .

原创 LeetCode 1523在区间范围内统计奇数数目(java)

```javaclass Solution { public int countOdds(int low, int high) { return (high + 1) / 2 - low / 2; }}

原创 LeetCode 1460通过翻转子数组使两个数组相等(java)

class Solution { public boolean canBeEqual(int[] target, int[] arr) { Arrays.sort(target); Arrays.sort(arr); for(int i = 0; i < arr.length; i++) { if(arr[i] != target[i]) return false; }..

原创 LeetCode 1323 6和9组成的最大数字(java)

class Solution { public int maximum69Number (int num) { int pos = 0, temp = num, n =1; while(temp != 0) { pos = temp % 10 == 6 ? n : pos; temp = temp / 10; n ++; } return pos == 0 ? .

原创 LeetCode 1512好数对的数目(java)

class Solution { public int numIdenticalPairs(int[] nums) { int res =0, len = nums.length; if(len > 1) { for(int i = 0; i < len; i++) { for(int j = i + 1; j < len; j++){ .

原创 LeetCode 1624两个相同字符之间的最长子字符串(java)

class Solution { public int maxLengthBetweenEqualCharacters(String s) { int size = s.length(); int res = -1; for(int start = 0; start < size - 1; start++) { for(int end = start + 1; end < size; end++) { .

原创 LeetCode1619删除某些元素后的数组均值(java)

class Solution { public double trimMean(int[] arr) { Arrays.sort(arr); int len = arr.length; int start = len / 20, end = len - len / 20; double sum = 0; for(int i = start;i < end; i++) { sum += a..

原创 LeetCode 1385两个数组间的距离值(java)

class Solution { public int findTheDistanceValue(int[] arr1, int[] arr2, int d) { int res = 0; for(int i = 0; i < arr1.length; i++) { boolean flag = false; for(int j = 0; j < arr2.length; j++) { ..

原创 Leetcode 1455检查单词是否为句中其他单词的前缀(java)

class Solution { public int isPrefixOfWord(String sentence, String searchWord) { if(null == sentence || null == searchWord) return -1; String [] str = sentence.split(" "); for(int i = 0; i < str.length; ++i) {..

原创 LeetCode 1450在给定时间做作业的学生人数(java)

class Solution { public int busyStudent(int[] startTime, int[] endTime, int queryTime) { int res = 0; for(int i = 0; i< startTime.length; i++) { if(queryTime >= startTime[i] && queryTime <= endTime[i]) ..

原创 LeetCode 1446 连续字符(java)

class Solution { public int maxPower(String s) { int len = s.length(); if(len <= 1) return len; int res = 1; char[] chS = s.toCharArray(); for(int i = 0; i < len - 1; ++i) { int j..

原创 LeetCode 1266访问所有点的最小时间(java)

class Solution { public int minTimeToVisitAllPoints(int[][] points) { int res = 0; for(int i = 1; i< points.length; ++i) { res += Math.max(Math.abs(points[i][0] - points[i -1][0]), Math.abs(points[i][1] - points[i - 1][..

原创 LeetCode 1281整数的各位积和之差(java)

class Solution { public int subtractProductAndSum(int n) { int temp = 1; int sum = 0; while(n != 0) { temp *= n %10; sum += n % 10; n /= 10; } return temp - sum; }}

原创 LeetCode 946验证栈序列(java)

class Solution { public boolean validateStackSequences(int[] pushed, int[] popped) { if(null == pushed || null == popped) return false; Stack<Integer> stack = new Stack<>(); int pos = 0; for(int.

原创 LeetCode 142环形链表2(java)

public class Solution { public ListNode detectCycle(ListNode head) { if(null == head) return null; ListNode fast = head, slow = head; while (true) { if (fast == null || fast.next == null) return null;.

原创 LeetCode 1232缀点成线(java)

class Solution { public boolean checkStraightLine(int[][] coordinates) { if( coordinates.length == 2) return true; for(int i = 0; i< coordinates.length - 2; ++i) { int x1 = coordinates[i + 1][0] - coordina..