路的博客

public String decodeMessage(String key, String message) { int next='a'; int[] cs=new int[26]; // int idx=0; Arrays.fill(cs,-1); for(int i=0;i

public boolean checkXMatrix(int[][] grid) { int n = grid.length; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) { if (i == j || (i + j) == (n - 1)) { if (grid[i][j] == 0) {

public ListNode mergeInBetween(ListNode list1, int a, int b, ListNode list2) { ListNode p = list1, q = list1; while (--a > 0) { p = p.next; } while (b-- > 0) { q = q.next; } p.next =

public int countAsterisks(String s) { int ans = 0; for (int i = 0, ok = 1; i < s.length(); ++i) { char c = s.charAt(i); if (c == '*') { ans += ok; } else if (c == '|') { ok

public int waysToMakeFair(int[] nums) { int n = nums.length - 1; if (n == 0) return 1; int[] presum1 = new int[nums.length+1];//偶数 int[] presum2 = new int[nums.length+1];//奇数 presum1[0] = nums[0]; presum1[1]

public String greatestLetter(String s) { Set ht = new HashSet(); for (int i = 0; i < s.length(); i++) { char c = s.charAt(i); ht.add(c); } for (int i = 25; i >= 0; i--) {

public String getSmallestString(int n, int k) { StringBuilder ans = new StringBuilder(); for (int i = 1; i

public int[] countPoints(int[][] points, int[][] queries) { int m = queries.length; int[] ans = new int[m]; for (int k = 0; k < m; ++k) { int x = queries[k][0], y = queries[k][1], r = queries[k][2]; for (var

public double calculateTax(int[][] brackets, int income) { int n=brackets.length; if(income

public int[] findingUsersActiveMinutes(int[][] logs, int k) { Map d = new HashMap(); for (var log : logs) { int i = log[0], t = log[1]; d.computeIfAbsent(i, key -> new HashSet()).add(t);

public boolean strongPasswordCheckerII(String password) { if (password.length() < 8) { return false; } int mask = 0; for (int i = 0; i < password.length(); ++i) { char c = password.charAt(i);

private int m, k; private Queue q; private TreeMap s1; private TreeMap s2; private TreeMap s3; private int size1, size2, size3; private long sum2; public MKAverage

public int countNicePairs(int[] nums) { Map cnt = new HashMap(); for (int x : nums) { int y = x - rev(x); cnt.merge(y, 1, Integer::sum); } final int mod = (int) 1e9 + 7; lo

public boolean areSentencesSimilar(String sentence1, String sentence2) { var words1 = sentence1.split(" "); var words2 = sentence2.split(" "); if (words1.length < words2.length) { var t = words1; words1 = wor

public int minMaxGame(int[] nums) { for (int n = nums.length; n > 1;) { n >>= 1; for (int i = 0; i < n; ++i) { int a = nums[i

public int rearrangeCharacters(String s, String target) { int[] cnt1 = new int[26]; int[] cnt2 = new int[26]; for (int i = 0; i < s.length(); ++i) { ++cnt1[s.charAt(i) - 'a']; } for (int i = 0; i < target

public String evaluate(String s, List knowledge) { Map d = new HashMap(knowledge.size()); for (var e : knowledge) { d.put(e.get(0), e.get(1)); } StringBuilder ans = new StringBuild

public boolean digitCount(String num) { Map h = new HashMap(); int n = num.length(); for (int i = 0; i < n; i++) { int digit = num.charAt(i) - '0'; h.put(digit, h.getOrDef

public int prefixCount(String[] words, String pref) { int res = 0; for (String word : words) { if (word.startsWith(pref)) { res++; } } return res; }

public int minOperations(int[] nums, int x) { int target = -x; for (int num : nums) target += num; if (target < 0) return -1; // 全部移除也无法满足要求 int ans = -1, left = 0, sum = 0, n = nums.length; for (int right = 0; righ

public int countEven(int num) { int y = num / 10, x = num % 10; int res = y * 5, ySum = 0; while (y != 0) { ySum += y % 10; y /= 10; } if (ySum % 2 == 0) { res += x / 2 + 1;

public int maxValue(int n, int index, int maxSum) { int left = 1, right = maxSum; while (left < right) { int mid = (left + right + 1) >>> 1; if (sum(mid - 1, index) + sum(mid, n - index)

public boolean areNumbersAscending(String s) { int pre = 0, pos = 0; while (pos < s.length()) { if (Character.isDigit(s.charAt(pos))) { int cur = 0; while (pos < s.length() && Character.isDigit(s

public int getNumberOfBacklogOrders(int[][] orders) { final int MOD = 1000000007; PriorityQueue buyOrders = new PriorityQueue((a, b) -> b[0] - a[0]); PriorityQueue sellOrders = new PriorityQueue((a, b)

public char repeatedCharacter(String s) { Set seen = new HashSet(); for (int i = 0; i < s.length(); i++) { char ch = s.charAt(i); if (!seen.add(ch)) { return ch; }

public int minMovesToSeat(int[] seats, int[] students) { Arrays.sort(seats); Arrays.sort(students); int res = 0; for (int i = 0; i < seats.length; i++) { res += Math.abs(seats[i] - students[i]); }

int N; TreeSet students; public ExamRoom(int N) { this.N = N; students = new TreeSet(); } public int seat() { //Let's determine student, the position of the next //student to sit down. int

public List twoOutOfThree(int[] nums1, int[] nums2, int[] nums3) { Map map = new HashMap(); for (int i : nums1) { map.put(i, 1); } for (int i : nums2) { ma

public int minimumLength(String s) { int n = s.length(); int left = 0, right = n - 1; while (left < right && s.charAt(left) == s.charAt(right)) { char c = s.charAt(left); while (left

public int minimumMoves(String s) { int ans = 0; for (int i = 0; i < s.length(); ++i) { if (s.charAt(i) == 'X') { ++ans; i += 2; } } return ans; }

public int countHomogenous(String s) { final int MOD = 1000000007; long res = 0; char prev = s.charAt(0); int cnt = 0; for (int i = 0; i < s.length(); i++) { char c = s.charAt(i); if (c == pre

public int minimumBoxes(int n) { int x = (int) Math.cbrt(6L * n); int ans = x * (x + 1) / 2; int maxN = (int) ((long) x * (x + 1) * (x + 2) / 6); if (maxN > n) { maxN -= ans; ans -= x; }

public String largestMerge(String w1, String w2) { StringBuilder sb = new StringBuilder(); while (w1.length() + w2.length() > 0) { if (w1.compareTo(w2) > 0) { sb.append(w1.charAt(0)); w1 = w1.subs

public int finalValueAfterOperations(String[] operations) { int x = 0; for (String op : operations) { if ("X++".equals(op) || "++X".equals(op)) { x++; } else { x--; }

public int maximumScore(int a, int b, int c) { int sum = a + b + c; int maxVal = Math.max(Math.max(a, b), c); return Math.min(sum - maxVal, sum / 2); }

public int minimumSize(int[] nums, int maxOperations) { int left = 1, right = Arrays.stream(nums).max().getAsInt(); int ans = 0; //在不超过给定次数情况下,找出最小的值 while (left

class Solution { public boolean validPath(int n, int[][] edges, int source, int destination) { List[] adj = new List[n]; for (int i = 0; i < n; i++) { adj[i] = new ArrayList(); } for (int[]

public int minMoves(int[] nums, int k) { var p = new ArrayList(); for (int i = 0; i < nums.length; ++i) if (nums[i] != 0) p.add(i - p.size()); int m = p.size(); int[] s = new int[m + 1]; // p 的前缀和

public boolean canChoose(int[][] groups, int[] nums) { int i = 0; for (int k = 0; k < nums.length && i < groups.length;) { if (check(groups[i], nums, k)) { k += groups[i].length; i++;

public int minElements(int[] nums, int limit, int goal) { long sum = 0; for (int x : nums) { sum += x; } long diff = Math.abs(sum - goal); return (int) ((diff + limit - 1) / limit); }