String str1, str2 ;
if (text1.length() >= text2.length()) {
str1 = text2;
str2 = text1;
} else {
str1 = text1;
str2 = text2;
}
List list = new ArrayList();
for (int y = 0; y < str1.length(); y++) {
for (int x = 0; x < str2.length(); x++) {
if (str1.charAt(y) == str2.charAt(x))
list.add(new Point(x, y));
}
}
LinkedList queue = new LinkedList();
SortedSet costSet = new TreeSet();
Point pt = new Point(0, 0);
if (list.contains(pt)) {
queue.addLast(new Data(1, 1, 0));
} else {
if (1 < str2.length())
queue.addLast(new Data(1, 0, 1));
if (1 < str1.length())
queue.addLast(new Data(0, 1, 1));
}