leet-39 - combination sum

class Solution {
    public List<List<Integer>> combinationSum(int[] candidates, int target) {
        // Sort candidates
        Arrays.sort(candidates); // Time complexity: O(nlogn)
        
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        List<Integer> eachSolution = new ArrayList<Integer>();
        for(int i = 0; i < candidates.length; i ++) {
            if(target % candidates[i] == 0) {
                for(int j = 0; j < target / candidates[i]; j ++) {
                    eachSolution.add(candidates[i]);
                }
            }
        }
        
        int size = candidates.length;
        int[][] board = new int[size][size];
        for(int i = size - 1; i >= 0; i --) {
            for(int j = 0; j < size; j ++) {
                int tempSum = candidates[i] + candidates[j];
                if(tempSum > target) {
                    board[i][j] = -1;
                } else {
                    board[i][j] = tempSum;
                }
            }
        }
        
        
    }
}