LeetCode 2643: Row With Maximum Ones Solution

Master LeetCode problem 2643 (Row With Maximum Ones), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2643. Row With Maximum Ones

Easy

Array Matrix

Problem Explanation

Explanation:

To solve this problem, we need to iterate through each row of the matrix and count the number of ones in each row. We will keep track of the row with the maximum count of ones and return its index along with the count.

Initialize variables maxOnesRow and maxOnesCount to store the index of the row with maximum ones and the count.
Iterate through each row of the matrix.
For each row, count the number of ones and compare it with the current maximum count.
If the current row has more ones than the previous maximum, update maxOnesRow and maxOnesCount.
Return the index of the row with maximum ones and the count.

Time Complexity: O(m * n) where m is the number of rows and n is the number of columns in the matrix.

Space Complexity: O(1)

Solution Code

class Solution {
    public int[] rowWithMaxOnes(int[][] mat) {
        int maxOnesRow = -1;
        int maxOnesCount = 0;
        
        for (int i = 0; i < mat.length; i++) {
            int onesCount = 0;
            for (int j = 0; j < mat[i].length; j++) {
                if (mat[i][j] == 1) {
                    onesCount++;
                }
            }
            if (onesCount > maxOnesCount) {
                maxOnesRow = i;
                maxOnesCount = onesCount;
            }
        }
        
        return new int[]{maxOnesRow, maxOnesCount};
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2643 (Row With Maximum Ones)?

This page provides optimized solutions for LeetCode problem 2643 (Row With Maximum Ones) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2643 (Row With Maximum Ones)?

The time complexity for LeetCode 2643 (Row With Maximum Ones) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2643 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2643 in Java, C++, or Python.

Back to LeetCode Solutions