最短单词距离 III

/*
 * 思路：
 * 使用Java Stream API处理相同的逻辑。
 * 我们可以首先将单词和索引对映射为一个列表，然后进行过滤和处理以找到最短距离。
 */
import java.util.*;
import java.util.stream.*;
 
public class SolutionStream {
    public int shortestWordDistance(String[] words, String word1, String word2) {
        List<int[]> wordPositions = IntStream.range(0, words.length)
            .filter(i -> words[i].equals(word1) || words[i].equals(word2))
            .mapToObj(i -> new int[]{i, words[i].equals(word1) ? 1 : 2})
            .collect(Collectors.toList());
        int minDistance = Integer.MAX_VALUE;
        for (int i = 0; i < wordPositions.size(); i++) {
            for (int j = i + 1; j < wordPositions.size(); j++) {
                if (wordPositions.get(i)[1] != wordPositions.get(j)[1] || word1.equals(word2)) {
                    minDistance = Math.min(minDistance, Math.abs(wordPositions.get(i)[0] - wordPositions.get(j)[0]));
                    if (minDistance == 1) return minDistance; // 最短距离为1，直接返回
                }
            }
        }
        return minDistance;
    }
}