• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1901_2000.s1975_maximum_matrix_sum.readme.md Maven / Gradle / Ivy

1975\. Maximum Matrix Sum

Medium

You are given an `n x n` integer `matrix`. You can do the following operation **any** number of times:

*   Choose any two **adjacent** elements of `matrix` and **multiply** each of them by `-1`.

Two elements are considered **adjacent** if and only if they share a **border**.

Your goal is to **maximize** the summation of the matrix's elements. Return _the **maximum** sum of the matrix's elements using the operation mentioned above._

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/07/16/pc79-q2ex1.png)

**Input:** matrix = [[1,-1],[-1,1]]

**Output:** 4

**Explanation:** We can follow the following steps to reach sum equals 4: 

- Multiply the 2 elements in the first row by -1. 

- Multiply the 2 elements in the first column by -1.

**Example 2:**

![](https://assets.leetcode.com/uploads/2021/07/16/pc79-q2ex2.png)

**Input:** matrix = [[1,2,3],[-1,-2,-3],[1,2,3]]

**Output:** 16

**Explanation:** We can follow the following step to reach sum equals 16: - Multiply the 2 last elements in the second row by -1.

**Constraints:**

*   `n == matrix.length == matrix[i].length`
*   `2 <= n <= 250`
*   -105 <= matrix[i][j] <= 105