Leetcode Problem 243. Shortest Word Distance

243. Shortest Word Distance

Leetcode Solutions

Initialize two index variables index1 and index2 to -1, which will hold the most recent positions of word1 and word2 respectively.
Initialize a variable minDistance to Integer.MAX_VALUE to keep track of the shortest distance found so far.
Iterate through the wordsDict array using a variable i.
If the current word is equal to word1, update index1 to i.
If the current word is equal to word2, update index2 to i.
If both index1 and index2 are not -1 (meaning both words have been found at least once), update minDistance with the smaller value between minDistance and the absolute difference between index1 and index2.
After the loop, return minDistance as the result.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen