public int[] getLongestCommonSequence(int[] x, int[] y) {

		int[][] c = new int[x.length + 1][y.length + 1];

		// start from c[1][1], since row 0 and column 0 should all be 0
		// if either one string is 0, then LCS is also 0
		for (int i = 1; i <= x.length; i++) {
			for (int j = 1; j <= y.length; j++) {
				// three possibilities
				if (x[i - 1] == y[j - 1])// current charAt comparison
				{
					c[i][j] = c[i - 1][j - 1] + 1;
				} else if (c[i - 1][j] >= c[i][j - 1]) {
					c[i][j] = c[i - 1][j];
				} else {
					c[i][j] = c[i][j - 1];
				}
			}
		}
		print(c);
		return DisplayLCS(c, x, y);
	}