From ec98ce5b312535ba0fc9266bc562ece8c7ab1fe3 Mon Sep 17 00:00:00 2001 From: kkunkka Date: Fri, 27 Jun 2025 12:16:31 +0800 Subject: [PATCH] kk --- .../java/com/dota/bit/_1318/Solution.java | 24 +++++++++++++ .../java/com/dota/bit/_1734/Solution.java | 21 ++++++++++++ .../java/com/dota/bit/_2419/Solution.java | 34 +++++++++++++++++++ .../java/com/dota/bit/_2980/Solution.java | 11 ++++++ 4 files changed, 90 insertions(+) create mode 100644 src/main/java/com/dota/bit/_1318/Solution.java create mode 100644 src/main/java/com/dota/bit/_1734/Solution.java create mode 100644 src/main/java/com/dota/bit/_2419/Solution.java create mode 100644 src/main/java/com/dota/bit/_2980/Solution.java diff --git a/src/main/java/com/dota/bit/_1318/Solution.java b/src/main/java/com/dota/bit/_1318/Solution.java new file mode 100644 index 0000000..e0d4820 --- /dev/null +++ b/src/main/java/com/dota/bit/_1318/Solution.java @@ -0,0 +1,24 @@ +package com.dota.bit._1318; + +class Solution { + public int minFlips(int a, int b, int c) { + var sum = 0; + while (a + b + c != 0) { + var ta = a & 1; + var tb = b & 1; + var tc = c & 1; + if ((ta | tb) != tc) { + if ((ta | tb) == 0) { + sum++; + } else { + sum = sum + ta + tb; + } + } + + a >>= 1; + b >>= 1; + c >>= 1; + } + return sum; + } +} \ No newline at end of file diff --git a/src/main/java/com/dota/bit/_1734/Solution.java b/src/main/java/com/dota/bit/_1734/Solution.java new file mode 100644 index 0000000..2cb655a --- /dev/null +++ b/src/main/java/com/dota/bit/_1734/Solution.java @@ -0,0 +1,21 @@ +package com.dota.bit._1734; + +class Solution { + public int[] decode(int[] encoded) { + int n = encoded.length + 1; + int[] res = new int[n]; + int x = 0; + for (int i = 0; i < n - 1; i += 2) { + x ^= encoded[i]; + } + for (int i = 1; i <= n; i++) { + x ^= i; + } + + res[n - 1] = x; + for (int i = n - 2; i >= 0; i--) { + res[i] = res[i + 1] ^ encoded[i]; + } + return res; + } +} \ No newline at end of file diff --git a/src/main/java/com/dota/bit/_2419/Solution.java b/src/main/java/com/dota/bit/_2419/Solution.java new file mode 100644 index 0000000..e2472b4 --- /dev/null +++ b/src/main/java/com/dota/bit/_2419/Solution.java @@ -0,0 +1,34 @@ +package com.dota.bit._2419; + +class Solution { + public static void main(String[] args) { + new Solution().longestSubarray(new int[]{311155, 311155, 311155, 311155, 311155, 311155, 311155, 311155, 201191, 311155}); + } + + public int longestSubarray(int[] nums) { + int max = 1; + int maxLen = 1; + int and = nums[0]; + int len = 0; + for (int num : nums) { + int t = and & num; + if (t < and || t < num) { + and = num; + t = num; + len = 1; + } else { + and = t; + len++; + } + + if (t > max) { + max = t; + maxLen = len; + } + if (t == max && len > maxLen) { + maxLen = len; + } + } + return maxLen; + } +} \ No newline at end of file diff --git a/src/main/java/com/dota/bit/_2980/Solution.java b/src/main/java/com/dota/bit/_2980/Solution.java new file mode 100644 index 0000000..79e9aeb --- /dev/null +++ b/src/main/java/com/dota/bit/_2980/Solution.java @@ -0,0 +1,11 @@ +package com.dota.bit._2980; + +class Solution { + public boolean hasTrailingZeros(int[] nums) { + int sum = 0; + for (int num : nums) { + if ((num & 1) == 0) sum++; + } + return sum>1; + } +} \ No newline at end of file