Skip to content

feat: add solutions to lc problem: No.3022 #2282

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 18 commits into from
Jan 30, 2024
Merged

feat: add solutions to lc problem: No.3022 #2282

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
18 commits
Select commit Hold shift + click to select a range
cdb0ec7
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
9afeee3
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
57d2c97
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
87bd707
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
24b450f
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
9877807
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
39a0c40
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
44273c6
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
dee978b
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
6412efe
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
76ec3f8
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
b6e40b4
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
da7d91b
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
f850679
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
25b8d06
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
7398a36
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
ece446f
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
137d044
feat: add solutions to lc problems: No.3022
Nothing-avil Jan 29, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
102 changes: 98 additions & 4 deletions ...ion/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -65,19 +65,113 @@
<!-- tabs:start -->

```python

class Solution:
def minOrAfterOperations(self, nums: List[int], k: int) -> int:
ans = 0
rans = 0
for i in range(29, -1, -1):
test = ans + (1 << i)
cnt = 0
val = 0
for num in nums:
if val == 0:
val = test & num
else:
val &= test & num
if val:
cnt += 1
if cnt > k:
rans += 1 << i
else:
ans += 1 << i
return rans
```

```java

class Solution {
public int minOrAfterOperations(int[] nums, int k) {
int ans = 0, rans = 0;
for (int i = 29; i >= 0; i--) {
int test = ans + (1 << i);
int cnt = 0;
int val = 0;
for (int num : nums) {
if (val == 0) {
val = test & num;
} else {
val &= test & num;
}
if (val != 0) {
cnt++;
}
}
if (cnt > k) {
rans += (1 << i);
} else {
ans += (1 << i);
}
}
return rans;
}
}
```

```cpp

class Solution {
public:
int minOrAfterOperations(vector<int>& nums, int k) {
int ans = 0, rans = 0;
for (int i = 29; i >= 0; i--) {
int test = ans + (1 << i);
int cnt = 0;
int val = 0;
for (auto it : nums) {
if (val == 0) {
val = test & it;
} else {
val &= test & it;
}
if (val) {
cnt++;
}
}
if (cnt > k) {
rans += (1 << i);
} else {
ans += (1 << i);
}
}
return rans;
}
};
```

```go

func minOrAfterOperations(nums []int, k int) int {
ans := 0
rans := 0
for i := 29; i >= 0; i-- {
test := ans + (1 << i)
cnt := 0
val := 0
for _, num := range nums {
if val == 0 {
val = test & num
} else {
val &= test & num
}
if val != 0 {
cnt++
}
}
if cnt > k {
rans += (1 << i)
} else {
ans += (1 << i)
}
}
return rans
}
```

<!-- tabs:end -->
Expand Down
102 changes: 98 additions & 4 deletions .../3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -61,19 +61,113 @@ It can be shown that 15 is the minimum possible value of the bitwise OR of the r
<!-- tabs:start -->

```python

class Solution:
def minOrAfterOperations(self, nums: List[int], k: int) -> int:
ans = 0
rans = 0
for i in range(29, -1, -1):
test = ans + (1 << i)
cnt = 0
val = 0
for num in nums:
if val == 0:
val = test & num
else:
val &= test & num
if val:
cnt += 1
if cnt > k:
rans += 1 << i
else:
ans += 1 << i
return rans
```

```java

class Solution {
public int minOrAfterOperations(int[] nums, int k) {
int ans = 0, rans = 0;
for (int i = 29; i >= 0; i--) {
int test = ans + (1 << i);
int cnt = 0;
int val = 0;
for (int num : nums) {
if (val == 0) {
val = test & num;
} else {
val &= test & num;
}
if (val != 0) {
cnt++;
}
}
if (cnt > k) {
rans += (1 << i);
} else {
ans += (1 << i);
}
}
return rans;
}
}
```

```cpp

class Solution {
public:
int minOrAfterOperations(vector<int>& nums, int k) {
int ans = 0, rans = 0;
for (int i = 29; i >= 0; i--) {
int test = ans + (1 << i);
int cnt = 0;
int val = 0;
for (auto it : nums) {
if (val == 0) {
val = test & it;
} else {
val &= test & it;
}
if (val) {
cnt++;
}
}
if (cnt > k) {
rans += (1 << i);
} else {
ans += (1 << i);
}
}
return rans;
}
};
```

```go

func minOrAfterOperations(nums []int, k int) int {
ans := 0
rans := 0
for i := 29; i >= 0; i-- {
test := ans + (1 << i)
cnt := 0
val := 0
for _, num := range nums {
if val == 0 {
val = test & num
} else {
val &= test & num
}
if val != 0 {
cnt++
}
}
if cnt > k {
rans += (1 << i)
} else {
ans += (1 << i)
}
}
return rans
}
```

<!-- tabs:end -->
Expand Down
27 changes: 27 additions & 0 deletions solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
class Solution {
public:
int minOrAfterOperations(vector<int>& nums, int k) {
int ans = 0, rans = 0;
for (int i = 29; i >= 0; i--) {
int test = ans + (1 << i);
int cnt = 0;
int val = 0;
for (auto it : nums) {
if (val == 0) {
val = test & it;
} else {
val &= test & it;
}
if (val) {
cnt++;
}
}
if (cnt > k) {
rans += (1 << i);
} else {
ans += (1 << i);
}
}
return rans;
}
};
25 changes: 25 additions & 0 deletions solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
func minOrAfterOperations(nums []int, k int) int {
ans := 0
rans := 0
for i := 29; i >= 0; i-- {
test := ans + (1 << i)
cnt := 0
val := 0
for _, num := range nums {
if val == 0 {
val = test & num
} else {
val &= test & num
}
if val != 0 {
cnt++
}
}
if cnt > k {
rans += (1 << i)
} else {
ans += (1 << i)
}
}
return rans
}
26 changes: 26 additions & 0 deletions solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
class Solution {
public int minOrAfterOperations(int[] nums, int k) {
int ans = 0, rans = 0;
for (int i = 29; i >= 0; i--) {
int test = ans + (1 << i);
int cnt = 0;
int val = 0;
for (int num : nums) {
if (val == 0) {
val = test & num;
} else {
val &= test & num;
}
if (val != 0) {
cnt++;
}
}
if (cnt > k) {
rans += (1 << i);
} else {
ans += (1 << i);
}
}
return rans;
}
}
20 changes: 20 additions & 0 deletions solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
class Solution:
def minOrAfterOperations(self, nums: List[int], k: int) -> int:
ans = 0
rans = 0
for i in range(29, -1, -1):
test = ans + (1 << i)
cnt = 0
val = 0
for num in nums:
if val == 0:
val = test & num
else:
val &= test & num
if val:
cnt += 1
if cnt > k:
rans += 1 << i
else:
ans += 1 << i
return rans