Skip to content

Added tasks 2028, 2029, 2030, 2032, 2033 #960

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 5 commits into from
May 25, 2022
Merged

Added tasks 2028, 2029, 2030, 2032, 2033 #960

Changes from 1 commit
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
13c00f3
Added tasks 2028, 2029, 2030, 2032, 2033
ThanhNIT May 25, 2022
9548a3f
format code
ThanhNIT May 25, 2022
b9b604a
Update Solution.java
javadev May 25, 2022
44d7a81
Update Solution.java
javadev May 25, 2022
fe57818
Update Solution.java
javadev May 25, 2022
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Update Solution.java
  • Loading branch information
@javadev
javadev authored May 25, 2022
commit fe578182287eaa5de45a81bfd33d9443daa65393
3 changes: 0 additions & 3 deletions src/main/java/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,17 +17,14 @@ public int minOperations(int[][] grid, int x) {
Arrays.sort(arr);
int target = arr[arr.length / 2];
int res = 0;

for (int i = 0; i < arr.length; i++) {
if (i < arr.length / 2) {

int rem = target - arr[i];
if (rem % x != 0) {
return -1;
}
res += rem / x;
} else {

int rem = arr[i] - target;
if (rem % x != 0) {
return -1;
Expand Down