LeetCode.cpp/test/leetcode/problems/construct-the-minimum-bitwise-array-ii.cpp at 4785c622fa0196f944b7abc6806959b25968043a · 0xMashiro/LeetCode.cpp · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include "leetcode/problems/construct-the-minimum-bitwise-array-ii.h"

#include "gtest/gtest.h"

namespace leetcode {
namespace problem_3315 {

class ConstructTheMinimumBitwiseArrayIiTest : public ::testing::TestWithParam<string> {
 protected:
  void SetUp() override { solution.setStrategy(GetParam()); }

  ConstructTheMinimumBitwiseArrayIiSolution solution;
};

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, Example1) {
  vector<int> nums = {2, 3, 5, 7};
  vector<int> expected = {-1, 1, 4, 3};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, Example2) {
  vector<int> nums = {11, 13, 31};
  vector<int> expected = {9, 12, 15};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest1) {
  vector<int> nums = {2};
  vector<int> expected = {-1};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest2) {
  vector<int> nums = {3};
  vector<int> expected = {1};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest3) {
  vector<int> nums = {5};
  vector<int> expected = {4};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest4) {
  vector<int> nums = {7};
  vector<int> expected = {3};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest5) {
  vector<int> nums = {131};  // 10000011 binary
  // 后缀连续1的个数：最低位1，次低位1，第三位0 -> suffix_ones = 2
  // ans = 131 - (1 << 1) = 131 - 2 = 129
  // 验证：129 (10000001) OR 130 (10000010) = 131 (10000011)
  vector<int> expected = {129};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest6) {
  vector<int> nums = {257};  // 100000001 binary
  // 后缀连续1的个数：最低位1，次低位0 -> suffix_ones = 1
  // ans = 257 - 1 = 256
  // 验证：256 (100000000) OR 257 (100000001) = 257
  vector<int> expected = {256};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

TEST_P(ConstructTheMinimumBitwiseArrayIiTest, AdditionalTest7) {
  vector<int> nums = {1023}; // 1111111111 (10 bits)
  // 后缀连续1的个数 = 10
  // ans = 1023 - (1 << 9) = 1023 - 512 = 511
  // 验证：511 (0111111111) OR 512 (1000000000) = 1023 (1111111111)
  vector<int> expected = {511};
  vector<int> result = solution.minBitwiseArray(nums);
  EXPECT_EQ(expected, result);
}

INSTANTIATE_TEST_SUITE_P(
    LeetCode, ConstructTheMinimumBitwiseArrayIiTest,
    ::testing::ValuesIn(ConstructTheMinimumBitwiseArrayIiSolution().getStrategyNames()));

}  // namespace problem_3315
}  // namespace leetcode