CPMagical CP Library

Problem solution · C++

Maximum Number of Ones

Maximum Number of Ones: a C++ solution using sorting and greedy selection. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Sorting and greedy selection
Source
walkccc LeetCode Solutions
Length
18 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sorting and greedy selection

For Maximum Number of Ones, the implementation first exposes a useful order, then scans that order while making locally justified choices.

  1. Choose the key that reveals the greedy or grouping structure.
  2. Sort the relevant records by that key.
  3. Scan in order, maintaining the invariant that makes each local choice safe.

Code notes

  • 18 lines of C++ from the credited upstream file 1183-2.cpp.
  • The implementation visibly relies on sequence storage.
  • 2 loop blocks detected.

Complexity

Sorting is typically the dominant term unless the subsequent scan uses a more expensive nested operation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMaximum Number of Ones · C++C++
Use this to learn the idea, then write your own version.
class Solution { public:  int maximumNumberOfOnes(int width, int height, int sideLength, int maxOnes) {    vector<int> subCount;     auto getCount = [sideLength](int length, int index) -> int {      return (length - index - 1) / sideLength + 1;    };     for (int i = 0; i < sideLength; ++i)      for (int j = 0; j < sideLength; ++j)        subCount.push_back(getCount(width, i) * getCount(height, j));     ranges::sort(subCount, greater<>());    return accumulate(subCount.begin(), subCount.begin() + maxOnes, 0);  }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗