feat: add solutions to lc problem: No.3133 (doocs#2678)

yanglbme · web-flow · commit 23f7050b00a6 · 2024-04-28T18:18:40.000+08:00
No.3133.Minimum Array End
diff --git a/.github/workflows/black-lint.yml b/.github/workflows/black-lint.yml
@@ -1,21 +1,17 @@
 name: black-linter
 
 on:
-  push: 
-    paths: 
-      - package.json
-      - requirements.txt
+  push:
+    paths:
       - solution/**
       - lcs/**
       - lcp/**
       - lcof2/**
       - lcof/**
       - lcci/**
       - basic/**
-  pull_request: 
-    paths: 
-      - package.json
-      - requirements.txt
+  pull_request:
+    paths:
       - solution/**
       - lcs/**
       - lcp/**
diff --git a/.github/workflows/clang-format-lint.yml b/.github/workflows/clang-format-lint.yml
@@ -1,21 +1,17 @@
 name: clang-format-linter
 
 on:
-  push: 
-    paths: 
-      - package.json
-      - requirements.txt
+  push:
+    paths:
       - solution/**
       - lcs/**
       - lcp/**
       - lcof2/**
       - lcof/**
       - lcci/**
       - basic/**
-  pull_request: 
-    paths: 
-      - package.json
-      - requirements.txt
+  pull_request:
+    paths:
       - solution/**
       - lcs/**
       - lcp/**
diff --git a/.github/workflows/compress.yml b/.github/workflows/compress.yml
@@ -19,7 +19,7 @@ on:
   schedule:
     - cron: '00 23 * * 0'
 
-concurrency: 
+concurrency:
   group: ${{github.workflow}} - ${{github.ref}}
   cancel-in-progress: true
 
diff --git a/.github/workflows/deploy.yml b/.github/workflows/deploy.yml
@@ -5,7 +5,7 @@ on:
     branches:
       - main
       - docs
-    paths: 
+    paths:
       - package.json
       - requirements.txt
       - solution/**
@@ -23,7 +23,7 @@ env:
 permissions:
   contents: write
 
-concurrency: 
+concurrency:
   group: ${{github.workflow}} - ${{github.ref}}
   cancel-in-progress: true
 
diff --git a/.github/workflows/pr-add-label.yml b/.github/workflows/pr-add-label.yml
@@ -4,7 +4,7 @@ on:
   pull_request_target:
     types: [opened, edited, reopened, synchronize]
 
-concurrency: 
+concurrency:
   group: ${{github.workflow}} - ${{github.event_name}}
   cancel-in-progress: true
 
diff --git a/solution/3100-3199/3133.Minimum Array End/README.md b/solution/3100-3199/3133.Minimum Array End/README.md
@@ -48,24 +48,96 @@
 
 ## 解法
 
-### 方法一
+### 方法一：贪心 + 位运算
+
+根据题目描述，要使得数组的最后一个元素尽可能小，且数组中的元素按位与的结果为 $x$，那么数组的第一个元素必须为 $x$。
+
+假设 $x$ 的二进制表示为 $\underline{1}00\underline{1}00$，那么数组序列为 $\underline{1}00\underline{1}00$, $\underline{1}00\underline{1}01$, $\underline{1}00\underline{1}10$, $\underline{1}00\underline{1}11$...
+
+如果我们忽略掉下划线部分，那么数组序列为 $0000$, $0001$, $0010$, $0011$...，第一项为 $0$，那么第 $n$ 项为 $n-1$。
+
+因此，答案就是在 $x$ 的基础上，将 $n-1$ 的二进制的每一位依次填入 $x$ 的二进制中的 $0$ 位。
+
+时间复杂度 $O(\log x)$，空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
 
 ```python
-
+class Solution:
+    def minEnd(self, n: int, x: int) -> int:
+        n -= 1
+        ans = x
+        for i in range(31):
+            if x >> i & 1 ^ 1:
+                ans |= (n & 1) << i
+                n >>= 1
+        ans |= n << 31
+        return ans
 ```
 
 ```java
-
+class Solution {
+    public long minEnd(int n, int x) {
+        --n;
+        long ans = x;
+        for (int i = 0; i < 31; ++i) {
+            if ((x >> i & 1) == 0) {
+                ans |= (n & 1) << i;
+                n >>= 1;
+            }
+        }
+        ans |= (long) n << 31;
+        return ans;
+    }
+}
 ```
 
 ```cpp
-
+class Solution {
+public:
+    long long minEnd(int n, int x) {
+        --n;
+        long long ans = x;
+        for (int i = 0; i < 31; ++i) {
+            if (x >> i & 1 ^ 1) {
+                ans |= (n & 1) << i;
+                n >>= 1;
+            }
+        }
+        ans |= (1LL * n) << 31;
+        return ans;
+    }
+};
 ```
 
 ```go
+func minEnd(n int, x int) (ans int64) {
+	n--
+	ans = int64(x)
+	for i := 0; i < 31; i++ {
+		if x>>i&1 == 0 {
+			ans |= int64((n & 1) << i)
+			n >>= 1
+		}
+	}
+	ans |= int64(n) << 31
+	return
+}
+```
 
+```ts
+function minEnd(n: number, x: number): number {
+    --n;
+    let ans: bigint = BigInt(x);
+    for (let i = 0; i < 31; ++i) {
+        if (((x >> i) & 1) ^ 1) {
+            ans |= BigInt(n & 1) << BigInt(i);
+            n >>= 1;
+        }
+    }
+    ans |= BigInt(n) << BigInt(31);
+    return Number(ans);
+}
 ```
 
 <!-- tabs:end -->
diff --git a/solution/3100-3199/3133.Minimum Array End/README_EN.md b/solution/3100-3199/3133.Minimum Array End/README_EN.md
@@ -44,24 +44,96 @@
 
 ## Solutions
 
-### Solution 1
+### Solution 1: Greedy + Bit Manipulation
+
+According to the problem description, to make the last element of the array as small as possible and the bitwise AND result of the elements in the array is $x$, the first element of the array must be $x$.
+
+Assume the binary representation of $x$ is $\underline{1}00\underline{1}00$, then the array sequence is $\underline{1}00\underline{1}00$, $\underline{1}00\underline{1}01$, $\underline{1}00\underline{1}10$, $\underline{1}00\underline{1}11$...
+
+If we ignore the underlined part, then the array sequence is $0000$, $0001$, $0010$, $0011$..., the first item is $0$, then the $n$-th item is $n-1$.
+
+Therefore, the answer is to fill each bit of the binary of $n-1$ into the $0$ bit of the binary of $x$ based on $x$.
+
+The time complexity is $O(\log x)$, and the space complexity is $O(1)$.
 
 <!-- tabs:start -->
 
 ```python
-
+class Solution:
+    def minEnd(self, n: int, x: int) -> int:
+        n -= 1
+        ans = x
+        for i in range(31):
+            if x >> i & 1 ^ 1:
+                ans |= (n & 1) << i
+                n >>= 1
+        ans |= n << 31
+        return ans
 ```
 
 ```java
-
+class Solution {
+    public long minEnd(int n, int x) {
+        --n;
+        long ans = x;
+        for (int i = 0; i < 31; ++i) {
+            if ((x >> i & 1) == 0) {
+                ans |= (n & 1) << i;
+                n >>= 1;
+            }
+        }
+        ans |= (long) n << 31;
+        return ans;
+    }
+}
 ```
 
 ```cpp
-
+class Solution {
+public:
+    long long minEnd(int n, int x) {
+        --n;
+        long long ans = x;
+        for (int i = 0; i < 31; ++i) {
+            if (x >> i & 1 ^ 1) {
+                ans |= (n & 1) << i;
+                n >>= 1;
+            }
+        }
+        ans |= (1LL * n) << 31;
+        return ans;
+    }
+};
 ```
 
 ```go
+func minEnd(n int, x int) (ans int64) {
+	n--
+	ans = int64(x)
+	for i := 0; i < 31; i++ {
+		if x>>i&1 == 0 {
+			ans |= int64((n & 1) << i)
+			n >>= 1
+		}
+	}
+	ans |= int64(n) << 31
+	return
+}
+```
 
+```ts
+function minEnd(n: number, x: number): number {
+    --n;
+    let ans: bigint = BigInt(x);
+    for (let i = 0; i < 31; ++i) {
+        if (((x >> i) & 1) ^ 1) {
+            ans |= BigInt(n & 1) << BigInt(i);
+            n >>= 1;
+        }
+    }
+    ans |= BigInt(n) << BigInt(31);
+    return Number(ans);
+}
 ```
 
 <!-- tabs:end -->
diff --git a/solution/3100-3199/3133.Minimum Array End/Solution.cpp b/solution/3100-3199/3133.Minimum Array End/Solution.cpp
@@ -0,0 +1,15 @@
+class Solution {
+public:
+    long long minEnd(int n, int x) {
+        --n;
+        long long ans = x;
+        for (int i = 0; i < 31; ++i) {
+            if (x >> i & 1 ^ 1) {
+                ans |= (n & 1) << i;
+                n >>= 1;
+            }
+        }
+        ans |= (1LL * n) << 31;
+        return ans;
+    }
+};
diff --git a/solution/3100-3199/3133.Minimum Array End/Solution.go b/solution/3100-3199/3133.Minimum Array End/Solution.go
@@ -0,0 +1,12 @@
+func minEnd(n int, x int) (ans int64) {
+	n--
+	ans = int64(x)
+	for i := 0; i < 31; i++ {
+		if x>>i&1 == 0 {
+			ans |= int64((n & 1) << i)
+			n >>= 1
+		}
+	}
+	ans |= int64(n) << 31
+	return
+}
diff --git a/solution/3100-3199/3133.Minimum Array End/Solution.java b/solution/3100-3199/3133.Minimum Array End/Solution.java
@@ -0,0 +1,14 @@
+class Solution {
+    public long minEnd(int n, int x) {
+        --n;
+        long ans = x;
+        for (int i = 0; i < 31; ++i) {
+            if ((x >> i & 1) == 0) {
+                ans |= (n & 1) << i;
+                n >>= 1;
+            }
+        }
+        ans |= (long) n << 31;
+        return ans;
+    }
+}
diff --git a/solution/3100-3199/3133.Minimum Array End/Solution.py b/solution/3100-3199/3133.Minimum Array End/Solution.py
@@ -0,0 +1,10 @@
+class Solution:
+    def minEnd(self, n: int, x: int) -> int:
+        n -= 1
+        ans = x
+        for i in range(31):
+            if x >> i & 1 ^ 1:
+                ans |= (n & 1) << i
+                n >>= 1
+        ans |= n << 31
+        return ans
diff --git a/solution/3100-3199/3133.Minimum Array End/Solution.ts b/solution/3100-3199/3133.Minimum Array End/Solution.ts
@@ -0,0 +1,12 @@
+function minEnd(n: number, x: number): number {
+    --n;
+    let ans: bigint = BigInt(x);
+    for (let i = 0; i < 31; ++i) {
+        if (((x >> i) & 1) ^ 1) {
+            ans |= BigInt(n & 1) << BigInt(i);
+            n >>= 1;
+        }
+    }
+    ans |= BigInt(n) << BigInt(31);
+    return Number(ans);
+}
