O(1) time complexity || One liner || Java || Easiest Approach💯
IntuitionApproachComplexity
Time complexity:O(1)

Space complexity:O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:O(1)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int maxContainers(int n, int w, int maxWeight) {
        //maxweight < n*n*w :ans = n*n;
        //maxweight> n*n*w : ans = maxweight/w;

        if(maxWeight >= n*n*w) return n*n;
        else return maxWeight/w;
    }
}
```
['Java']