Solution (leetcode-in-java 1.13 API)

java.lang.Object
- g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k.Solution

```
public class Solution
extends Object
```

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int partitionArray(int[] nums, int k)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

partitionArray

public int partitionArray(int[] nums,
                          int k)