Euclidean Distance In 2D Array

I'm trying to write a program that will takes as input a sub-sequence/set/query eg; P = <1,3,0>)

int [][] S = {{1, 3, 0}};
and a list of series. eg;
int [][] T = {{1, 2, 3, 0, 1, 5},{9,9,9,9,9,9}};

The idea is to iterate through the series and find the lowest distance, using euclidean distance, between a subseries and the query.Example: d=distance d(P,T[1..3]=√(1-1)^2 + (3 - 2)^2 + (0 - 3)^2 = sqrt10 => 3.16...Then go through the first subseries again but starting at [1] in the array instead of [0], so d(P,T[2..4]=√(1-2)^2 + (3-3)^2 + (3-0)^2. keep repeating this process, then start searching the next subseries for the lowest distance, save the position of index(row#) and the start of the subseries(column#) that has the lowest distance.Here is the code i have written to do this without using nested for-loops to do it:

//Works out euclidean difference, long way need for loops
int [][] T = new int [][] {{1,2,3,0,1,5}};
int [][] S = new int [][] {{1, 3, 0}};
int s1 = S[0][0]; int s2 = S[0][1]; int s3 = S[0][2];
int t1 = T[0][0]; int t2 = T[0][1]; int t3 = T[0][2];
double sum;
sum = Math.pow((s1 - t1), 2);
sum += Math.pow((s2 - t2), 2);
sum += Math.pow ((s3 - t3), 2);
Double diff = Math.sqrt(sum);
System.out.println(diff);
}

However i want to use for-loops to iterate through as subseries could be of any length. The way i did it above isn't applicable.This is what i have so far...

int [][] S = {{1, 3, 0}};
int [][] T = {{1, 2, 3, 0, 1, 5},{9,9,9,9,9,9}};
int

[code]...