衣橱整理

/*
 * Problem: Given an m x n grid representing a wardrobe, we need to count the number of cells that a cleaner can organize. The cleaner starts at grid[0][0] and can only move right or down. A cell can be organized only if the sum of the digits of the row index and the column index is less than or equal to cnt.
 *
 * Solution Approach using Java Stream API:
 * 1. Use a helper function to calculate the sum of the digits of a number.
 * 2. Use nested IntStream to iterate over each cell.
 * 3. Filter out cells that cannot be organized.
 * 4. Count the remaining cells.
 */

import java.util.stream.IntStream;

public class SolutionStream {
    public int digitSum(int x) {
        int sum = 0;
        while (x > 0) {
            sum += x % 10;
            x /= 10;
        }
        return sum;
    }

    public long organizeCells(int m, int n, int cnt) {
        return IntStream.range(0, m)
                .boxed()
                .flatMap(i -> IntStream.range(0, n)
                        .filter(j -> digitSum(i) + digitSum(j) <= cnt)
                        .boxed())
                .count();
    }

    public static void main(String[] args) {
        SolutionStream sol = new SolutionStream();
        System.out.println(sol.organizeCells(4, 7, 5)); // Output: 18
    }
}