Merge pull request #1026 from 0xff-dev/3133

Add solution and test-cases for problem 3133

Author: 6boris

leetcode/3101-3200/3133.Minimum-Array-End/README.md

@@ -1,28 +1,33 @@
 # [3133.Minimum Array End][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You are given two integers `n` and `x`. You have to construct an array of **positive** integers `nums` of size `n` where for every `0 <= i < n - 1`, `nums[i + 1]` is **greater than** `nums[i]`, and the result of the bitwise `AND` operation between all elements of `nums` is `x`.
+
+Return the **minimum** possible value of `nums[n - 1]`.
 
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
-```
+Input: n = 3, x = 4
 
-## 题意
-> ...
+Output: 6
 
-## 题解
+Explanation:
 
-### 思路1
-> ...
-Minimum Array End
-```go
+nums can be [4,5,6] and its last element is 6.
 ```
 
+**Example 2:**
+
+```
+Input: n = 2, x = 7
+
+Output: 15
+
+Explanation:
+
+nums can be [7,15] and its last element is 15.
+```
 
 ## 结语
 

leetcode/3101-3200/3133.Minimum-Array-End/Solution.go

@@ -1,5 +1,33 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(n int, x int) int64 {
+	ans := int64(x)
+	if n == 1 {
+		return ans
+	}
+	nn := int64(n) - 1
+	zero := 0
+	c := int64(0)
+	for {
+		zero++
+		c = 1 << (zero - 1)
+		if nn <= c {
+			break
+		}
+		nn -= c
+	}
+	c |= (nn - 1)
+	cur := int64(1)
+	for ; c > 0; c >>= 1 {
+		for ans&cur != 0 {
+			cur <<= 1
+		}
+		now := c & 1
+		if now == 1 {
+			ans |= cur
+			continue
+		}
+		cur <<= 1
+	}
+	return ans
 }

leetcode/3101-3200/3133.Minimum-Array-End/Solution_test.go

@@ -10,30 +10,29 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		n, x   int
+		expect int64
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", 3, 4, 6},
+		{"TestCase2", 2, 7, 15},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.n, c.x)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",
+					c.expect, got, c.n, c.x)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }