From cdb0ec735b9c9c39994adc401fcee4e3b9fae66c Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:28:01 +0530 Subject: [PATCH 01/18] feat: add solutions to lc problems: No.3022 --- .../README.md | 104 +++++++++++++++++- 1 file changed, 100 insertions(+), 4 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md index 04c05024478da..a0e6f11ca424c 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md @@ -65,19 +65,115 @@ ```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& 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 +} ``` From 9afeee3311a9bf06207d3e8e8d599db4f699e745 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:28:46 +0530 Subject: [PATCH 02/18] feat: add solutions to lc problems: No.3022 --- .../README_EN.md | 104 +++++++++++++++++- 1 file changed, 100 insertions(+), 4 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md index 6803513199684..4d6b191653795 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md @@ -61,19 +61,115 @@ It can be shown that 15 is the minimum possible value of the bitwise OR of the r ```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& 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 +} ``` From 57d2c9778ffe85e09c4c503dd2766ab46336f9c4 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:30:51 +0530 Subject: [PATCH 03/18] feat: add solutions to lc problems: No.3022 --- .../Solution.cpp | 29 +++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp new file mode 100644 index 0000000000000..308522055e7e3 --- /dev/null +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp @@ -0,0 +1,29 @@ +class Solution { +public: + int minOrAfterOperations(vector& 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; + } +}; From 87bd70745aa7b22b9a75ad3692ab5bdc93c80f95 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:31:29 +0530 Subject: [PATCH 04/18] feat: add solutions to lc problems: No.3022 --- .../Solution.go | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.go diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.go b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.go new file mode 100644 index 0000000000000..9df187137ce73 --- /dev/null +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.go @@ -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 +} From 24b450fb9965584df65e425587d07dbdd14a8226 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:32:48 +0530 Subject: [PATCH 05/18] feat: add solutions to lc problems: No.3022 --- .../Solution.java | 26 +++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.java diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.java b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.java new file mode 100644 index 0000000000000..5c795bc8c74fb --- /dev/null +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.java @@ -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; + } +} From 9877807a20567322f70772b3f17d23c889ab43f3 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:33:24 +0530 Subject: [PATCH 06/18] feat: add solutions to lc problems: No.3022 --- .../Solution.py | 20 +++++++++++++++++++ 1 file changed, 20 insertions(+) create mode 100644 solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py new file mode 100644 index 0000000000000..c8efa7d0e4a97 --- /dev/null +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py @@ -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 From 39a0c40f46bc102af76c3eae7f35ba1142b7a63a Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:41:50 +0530 Subject: [PATCH 07/18] feat: add solutions to lc problems: No.3022 --- .../Solution.cpp | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp index 308522055e7e3..3d5539f3f9b38 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp @@ -9,8 +9,7 @@ class Solution { for (auto it : nums) { if (val == 0) { val = test & it; - } - else { + }else { val &= test & it; } if (val) { @@ -19,8 +18,7 @@ class Solution { } if (cnt > k) { rans += (1 << i); - } - else{ + }else{ ans += (1 << i); } } From 44273c6cee22dafba9f15310aeb939487f6c0d78 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:42:13 +0530 Subject: [PATCH 08/18] feat: add solutions to lc problems: No.3022 --- .../README.md | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md index a0e6f11ca424c..2007ce380f87b 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md @@ -128,8 +128,7 @@ public: for (auto it : nums) { if (val == 0) { val = test & it; - } - else { + }else { val &= test & it; } if (val) { @@ -138,8 +137,7 @@ public: } if (cnt > k) { rans += (1 << i); - } - else{ + }else{ ans += (1 << i); } } From dee978ba22b814de2c61ffadf8ea7e49f6da93d2 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:42:34 +0530 Subject: [PATCH 09/18] feat: add solutions to lc problems: No.3022 --- .../README_EN.md | 6 ++---- 1 file changed, 2 insertions(+), 4 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md index 4d6b191653795..61ee5ddc64e0c 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md @@ -124,8 +124,7 @@ public: for (auto it : nums) { if (val == 0) { val = test & it; - } - else { + }else { val &= test & it; } if (val) { @@ -134,8 +133,7 @@ public: } if (cnt > k) { rans += (1 << i); - } - else{ + }else{ ans += (1 << i); } } From 6412efed3fba88880e216dad9a22bdd5230bc2d5 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:44:35 +0530 Subject: [PATCH 10/18] feat: add solutions to lc problems: No.3022 --- .../Solution.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp index 3d5539f3f9b38..81512f1243caa 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp @@ -9,7 +9,7 @@ class Solution { for (auto it : nums) { if (val == 0) { val = test & it; - }else { + } else { val &= test & it; } if (val) { @@ -18,7 +18,7 @@ class Solution { } if (cnt > k) { rans += (1 << i); - }else{ + } else{ ans += (1 << i); } } From 76ec3f8cd47db00d35b932ac8e5291f95bb7fce1 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:44:56 +0530 Subject: [PATCH 11/18] feat: add solutions to lc problems: No.3022 --- .../README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md index 2007ce380f87b..36e0d36765340 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md @@ -128,7 +128,7 @@ public: for (auto it : nums) { if (val == 0) { val = test & it; - }else { + } else { val &= test & it; } if (val) { @@ -137,7 +137,7 @@ public: } if (cnt > k) { rans += (1 << i); - }else{ + } else{ ans += (1 << i); } } From b6e40b4b79d703eb4bc2b726e863bd00d7e78477 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 18:45:16 +0530 Subject: [PATCH 12/18] feat: add solutions to lc problems: No.3022 --- .../README_EN.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md index 61ee5ddc64e0c..b5f889444648a 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md @@ -124,7 +124,7 @@ public: for (auto it : nums) { if (val == 0) { val = test & it; - }else { + } else { val &= test & it; } if (val) { @@ -133,7 +133,7 @@ public: } if (cnt > k) { rans += (1 << i); - }else{ + } else{ ans += (1 << i); } } From da7d91bf135e3c5ebf024e234dd4ec35165da8d6 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 20:00:52 +0530 Subject: [PATCH 13/18] feat: add solutions to lc problems: No.3022 --- .../Solution.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp index 81512f1243caa..5a321badeba37 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.cpp @@ -18,7 +18,7 @@ class Solution { } if (cnt > k) { rans += (1 << i); - } else{ + } else { ans += (1 << i); } } From f8506795dfe4171950e6e584350612a6366212f9 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 20:01:08 +0530 Subject: [PATCH 14/18] feat: add solutions to lc problems: No.3022 --- .../README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md index 36e0d36765340..9b3de1b9a5306 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md @@ -137,7 +137,7 @@ public: } if (cnt > k) { rans += (1 << i); - } else{ + } else { ans += (1 << i); } } From 25b8d06c3341b9518a829d3454d0cdc162106a54 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 20:01:23 +0530 Subject: [PATCH 15/18] feat: add solutions to lc problems: No.3022 --- .../README_EN.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md index b5f889444648a..f00c0812ce46e 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md @@ -133,7 +133,7 @@ public: } if (cnt > k) { rans += (1 << i); - } else{ + } else { ans += (1 << i); } } From 7398a36034e6e4e620516035c232f1ad5c717fd4 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 20:06:31 +0530 Subject: [PATCH 16/18] feat: add solutions to lc problems: No.3022 --- .../Solution.py | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py index c8efa7d0e4a97..a9c94fb9810ad 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/Solution.py @@ -14,7 +14,7 @@ def minOrAfterOperations(self, nums: List[int], k: int) -> int: if val: cnt += 1 if cnt > k: - rans += (1 << i) + rans += 1 << i else: - ans += (1 << i) + ans += 1 << i return rans From ece446f1cc5833fb63b699112db8a0e9ed3cdf3d Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 20:08:33 +0530 Subject: [PATCH 17/18] feat: add solutions to lc problems: No.3022 --- .../README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md index 9b3de1b9a5306..83c7858aafa51 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README.md @@ -81,9 +81,9 @@ class Solution: if val: cnt += 1 if cnt > k: - rans += (1 << i) + rans += 1 << i else: - ans += (1 << i) + ans += 1 << i return rans ``` From 137d04487d8715b5a8e7ff90037664f7e2acdc00 Mon Sep 17 00:00:00 2001 From: Sandarbh Singhal <123533242+Nothing-avil@users.noreply.github.com> Date: Mon, 29 Jan 2024 20:09:06 +0530 Subject: [PATCH 18/18] feat: add solutions to lc problems: No.3022 --- .../README_EN.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md index f00c0812ce46e..c5d883980ef75 100644 --- a/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md +++ b/solution/3000-3099/3022.Minimize OR of Remaining Elements Using Operations/README_EN.md @@ -77,9 +77,9 @@ class Solution: if val: cnt += 1 if cnt > k: - rans += (1 << i) + rans += 1 << i else: - ans += (1 << i) + ans += 1 << i return rans ```