Skip to content

Commit a9be075

Browse files
refactor 244
1 parent de5b664 commit a9be075

File tree

1 file changed

+6
-6
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+6
-6
lines changed

src/main/java/com/fishercoder/solutions/_244.java

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -24,13 +24,13 @@ public class _244 {
2424
private Map<String, List<Integer>> map;
2525

2626
public _244(String[] words) {
27-
map = new HashMap<String, List<Integer>>();
27+
map = new HashMap<>();
2828
for (int i = 0; i < words.length; i++) {
2929
String w = words[i];
3030
if (map.containsKey(w)) {
3131
map.get(w).add(i);
3232
} else {
33-
List<Integer> list = new ArrayList<Integer>();
33+
List<Integer> list = new ArrayList<>();
3434
list.add(i);
3535
map.put(w, list);
3636
}
@@ -40,19 +40,19 @@ public _244(String[] words) {
4040
public int shortest(String word1, String word2) {
4141
List<Integer> list1 = map.get(word1);
4242
List<Integer> list2 = map.get(word2);
43-
int ret = Integer.MAX_VALUE;
43+
int result = Integer.MAX_VALUE;
4444
for (int i = 0, j = 0; i < list1.size() && j < list2.size(); ) {
4545
int index1 = list1.get(i);
4646
int index2 = list2.get(j);
4747
if (index1 < index2) {
48-
ret = Math.min(ret, index2 - index1);
48+
result = Math.min(result, index2 - index1);
4949
i++;
5050
} else {
51-
ret = Math.min(ret, index1 - index2);
51+
result = Math.min(result, index1 - index2);
5252
j++;
5353
}
5454
}
55-
return ret;
55+
return result;
5656
}
5757

5858
}

0 commit comments

Comments
 (0)