Thread: Method to solve a word search in Java using 2d arrays

I'm trying to create a method that will search through a 2d array of numbers. If the numbers add up to a certain sum, those numbers should remain and all of the other numbers should be changed to a 0. For example, if the desired sum is 7 and a row contains 2 5 1 2, the result should be 2 5 0 0 after the method is implemented. I have everything functioning but instead of keeping all of the numbers that add up to the sum, only the last number is retained. So, I am left with 0 5 0 0 . I think I need another array somewhere but not sure exactly how to go about implementing it. Any ideas?

    public static int[][] horizontalSums(int[][] a, int sumToFind) {
		int[][] b = new int[a.length][a[0].length];
		int columnStart = 0;
		while (columnStart < a[0].length) {
			for (int row = 0; row < a.length; row++) {
				int sum = 0;
				for (int column = columnStart; column < a[row].length; column++) {
					sum += a[row][column];
					if (sum == sumToFind) {
						b[row][column] = a[row][column];
					}
				}
 
			}
			columnStart++;
		}
		return b;
	}

It need go through a horizontal array checking if consecutive numbers add up to a desired sum. If they do, those numbers remain, if they don't, the numbers become zeros.

if its 4 5 5 2. its supposed to add 4 and 5, then add 5 and 5, then and 5 and 2.