From 04aa2ffc7dc18883d60115e67e338ce5fd0ac8ff Mon Sep 17 00:00:00 2001 From: yangwolves Date: Wed, 21 Jan 2026 18:52:24 +0800 Subject: [PATCH 1/7] routine --- 26/01/3315.cpp | 22 ++++++++++++++++++++++ 26/01/go/3315.go | 19 +++++++++++++++++++ 2 files changed, 41 insertions(+) create mode 100644 26/01/3315.cpp create mode 100644 26/01/go/3315.go diff --git a/26/01/3315.cpp b/26/01/3315.cpp new file mode 100644 index 0000000..6284041 --- /dev/null +++ b/26/01/3315.cpp @@ -0,0 +1,22 @@ +#include + +class Solution { +public: + std::vector minBitwiseArray(std::vector& nums) { + std::vector ans; + for(auto num:nums){ + if (num == 2) { + ans.push_back(-1); + continue; + } + int temp = num; + int t=0; + while (temp & 1) { + t++; + temp >>= 1; + } + ans.push_back(num ^ (1 << (t-1))); + } + return ans; + } +}; \ No newline at end of file diff --git a/26/01/go/3315.go b/26/01/go/3315.go new file mode 100644 index 0000000..fd2352c --- /dev/null +++ b/26/01/go/3315.go @@ -0,0 +1,19 @@ +package A + +func minBitwiseArray(nums []int) []int { + ans := make([]int, 0, len(nums)) + for _, num := range nums { + if num == 2 { + ans = append(ans, -1) + continue + } + temp := num + t := 0 + for temp&1 == 1 { + t++ + temp >>= 1 + } + ans = append(ans, num^(1<<(t-1))) + } + return ans +} From 124c7332d809d12102f519a9fdbbe743ac8b916c Mon Sep 17 00:00:00 2001 From: wolves Date: Thu, 22 Jan 2026 23:51:20 +0800 Subject: [PATCH 2/7] routine --- 26/01/1895.cpp | 15 +++++++++++++++ 26/01/3507.cpp | 33 +++++++++++++++++++++++++++++++++ 26/01/comp/18q1.cpp | 23 +++++++++++++++++++++++ 26/01/go/3507.go | 38 ++++++++++++++++++++++++++++++++++++++ 4 files changed, 109 insertions(+) create mode 100644 26/01/1895.cpp create mode 100644 26/01/3507.cpp create mode 100644 26/01/comp/18q1.cpp create mode 100644 26/01/go/3507.go diff --git a/26/01/1895.cpp b/26/01/1895.cpp new file mode 100644 index 0000000..8ca85e1 --- /dev/null +++ b/26/01/1895.cpp @@ -0,0 +1,15 @@ +#include + +class Solution { +public: + int largestMagicSquare(std::vector>& grid) { + int m = grid.size(); + int n = grid[0].size(); + std::vector> preM(m,std::vector(n,0)),preN(m,std::vector(n,0)); + for (int i = 0; i < m; i++) { + for(int j = 0;j < n;j++){ + preM[m][n] += grid[m][n]; + } + } + } +}; \ No newline at end of file diff --git a/26/01/3507.cpp b/26/01/3507.cpp new file mode 100644 index 0000000..096ed0c --- /dev/null +++ b/26/01/3507.cpp @@ -0,0 +1,33 @@ +#include +#include + +class Solution { +public: + bool isIncrease(std::vector& nums){ + for (int i = 1; i& nums) { + int ans = 0; + while (!isIncrease(nums)) { + int index = 0; + int minX = INT_MAX; + for (int i = 0; i< nums.size()-1; i++) { + int temp = nums[i]+nums[i+1]; + if (minX > temp) { + minX = temp; + index = i; + } + } + nums.erase(nums.begin()+index+1); + nums[index] = minX; + ans++; + } + return ans; + } +}; \ No newline at end of file diff --git a/26/01/comp/18q1.cpp b/26/01/comp/18q1.cpp new file mode 100644 index 0000000..edb2727 --- /dev/null +++ b/26/01/comp/18q1.cpp @@ -0,0 +1,23 @@ +#include + +class Solution { +public: + int vowelConsonantScore(std::string s) { + int v =0,c=0; + std::string col = "aeiou"; + for (auto i : s) { + if (i > 122 || i < 97) { + continue; + } + if (col.find(i) != std::string::npos) { + v++; + }else { + c++; + } + } + if (c==0) { + return 0; + } + return v/c; + } +}; \ No newline at end of file diff --git a/26/01/go/3507.go b/26/01/go/3507.go new file mode 100644 index 0000000..2fb000f --- /dev/null +++ b/26/01/go/3507.go @@ -0,0 +1,38 @@ +package A + +import "math" + +func isIncrease(nums []int) bool { + for i := range nums { + if i == len(nums)-1 { + break + } + if nums[i] > nums[i+1] { + return false + } + } + return true +} + +func minimumPairRemoval(nums []int) int { + ans := 0 + index := 0 + temp := 0 + for !isIncrease(nums) { + minX := math.MaxInt + for i := range nums { + if i == len(nums)-1 { + break + } + temp = nums[i] + nums[i+1] + if minX > temp { + minX = temp + index = i + } + } + nums[index] = minX + nums = append(nums[:index+1], nums[index+2:]...) + ans++ + } + return ans +} From b08a6b97768be3efd8b56a9b67e75bfeddcef478 Mon Sep 17 00:00:00 2001 From: wolves Date: Sun, 25 Jan 2026 18:04:39 +0800 Subject: [PATCH 3/7] routine --- 26/01/go/1984.go | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 26/01/go/1984.go diff --git a/26/01/go/1984.go b/26/01/go/1984.go new file mode 100644 index 0000000..ccc2512 --- /dev/null +++ b/26/01/go/1984.go @@ -0,0 +1,21 @@ +package A + +import ( + "sort" +) + +func minimumDifference(nums []int, k int) int { + if k == 1 { + return 0 + } + n := len(nums) + sort.Ints(nums) + ans := nums[n-1] - nums[0] + for i := 0; i+k-1 < n; i++ { + temp := nums[i+k-1] - nums[i] + if ans > temp { + ans = temp + } + } + return ans +} From 06508ed1180159893bbadd7fd2dfd93a2df4b106 Mon Sep 17 00:00:00 2001 From: wolves Date: Mon, 26 Jan 2026 18:47:01 +0800 Subject: [PATCH 4/7] routine --- 26/01/go/1200.go | 25 +++++++++++++++++++++++++ test.go | 15 +++++++++++++++ 2 files changed, 40 insertions(+) create mode 100644 26/01/go/1200.go create mode 100644 test.go diff --git a/26/01/go/1200.go b/26/01/go/1200.go new file mode 100644 index 0000000..d72e952 --- /dev/null +++ b/26/01/go/1200.go @@ -0,0 +1,25 @@ +package A + +import "sort" + +func minimumAbsDifference(arr []int) [][]int { + sort.Slice(arr, func(i, j int) bool { + return arr[i] < arr[j] + }) + ans := [][]int{} + n := len(arr) + minDiff := arr[1] - arr[0] + for i := 1; i < n; i++ { + temp := arr[i] - arr[i-1] + if minDiff > temp { + minDiff = temp + } + } + for i := 1; i < n; i++ { + temp := arr[i] - arr[i-1] + if temp == minDiff { + ans = append(ans, []int{arr[i-1], arr[i]}) + } + } + return ans +} diff --git a/test.go b/test.go new file mode 100644 index 0000000..f5806f9 --- /dev/null +++ b/test.go @@ -0,0 +1,15 @@ +package main + +import ( + "fmt" + "sort" +) + +func sorts(arr []int) { + sort.Ints(arr) + fmt.Println(arr) +} + +func main() { + sorts([]int{3, 8, -10, 23, 19, -4, -14, 27}) +} From 68a402077a5e25b2a8d540f50d97a1ccad40dd20 Mon Sep 17 00:00:00 2001 From: wolves Date: Fri, 6 Feb 2026 02:01:18 +0800 Subject: [PATCH 5/7] 3379, 3650 --- 26/01/go/3650.go | 11 +++++++++++ 26/02/3379.go | 18 ++++++++++++++++++ 2 files changed, 29 insertions(+) create mode 100644 26/01/go/3650.go create mode 100644 26/02/3379.go diff --git a/26/01/go/3650.go b/26/01/go/3650.go new file mode 100644 index 0000000..bb548ea --- /dev/null +++ b/26/01/go/3650.go @@ -0,0 +1,11 @@ +package A + +func minCost(n int, edges [][]int) int { + edgeM := make([][]int, n) + for i := 0; i < n; i++ { + edgeM[i] = make([]int, n) + } + for _, e := range edges { + edgeM[e[0]][e[1]] = e[2] + } +} diff --git a/26/02/3379.go b/26/02/3379.go new file mode 100644 index 0000000..38386b6 --- /dev/null +++ b/26/02/3379.go @@ -0,0 +1,18 @@ +package A + +func constructTransformedArray(nums []int) []int { + n := len(nums) + res := make([]int, n) + for i, v := range nums { + if v > 0 { + res[i] = nums[(i+v)%n] + } + if v == 0 { + res[i] = v + } + if v < 0 { + res[i] = nums[((i+v)%n+n)%n] + } + } + return res +} From e1e872380e4f9fa93102f7a4e162201cd47d6a8a Mon Sep 17 00:00:00 2001 From: wolves Date: Fri, 20 Feb 2026 00:37:14 +0800 Subject: [PATCH 6/7] 190, 3379, 693 --- 26/02/190.go | 16 ++++++++++++++++ 26/02/693.go | 6 ++++++ 2 files changed, 22 insertions(+) create mode 100644 26/02/190.go create mode 100644 26/02/693.go diff --git a/26/02/190.go b/26/02/190.go new file mode 100644 index 0000000..9193c4a --- /dev/null +++ b/26/02/190.go @@ -0,0 +1,16 @@ +package A + +import "math/bits" + +func reverseBits(n int) int { + res := 0 + for i := 0; i < 32; i++ { + res = (res << 1) | (n & 1) + n >>= 1 + } + return res +} + +func reverseBits2(n int) int { + return int(bits.Reverse32((uint32(n)))) +} diff --git a/26/02/693.go b/26/02/693.go new file mode 100644 index 0000000..704304c --- /dev/null +++ b/26/02/693.go @@ -0,0 +1,6 @@ +package A + +func hasAlternatingBits(n int) bool { + n = n ^ (n >> 1) + return n&(n+1) == 0 +} From 645ba2ed3d1d035ee29f1d1d270b5d83b4e41bcb Mon Sep 17 00:00:00 2001 From: wolves Date: Sat, 28 Feb 2026 10:01:48 +0800 Subject: [PATCH 7/7] routine --- 26/02/1680.go | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 26/02/1680.go diff --git a/26/02/1680.go b/26/02/1680.go new file mode 100644 index 0000000..9d398fb --- /dev/null +++ b/26/02/1680.go @@ -0,0 +1,13 @@ +package A + +import "math/bits" + +func concatenatedBinary(n int) int { + var res int64 = 0 + const mod = 1e9 + 7 + for i := 0; i < n; i++ { + b := bits.Len32(uint32(i + 1)) + res = ((res << b) + int64(i+1)) % mod + } + return int(res) +}