Algorithms

smallest distance

seoca 2021. 1. 16. 21:27

 

find the smallest distance in a given array. 

 

const arr = [1, 4, 2, 2, 1, 5];

function smallestDistance(arr) {
    const distanceArray = [];
    for (let i = 0; i < arr.length; i++) {
        if (arr.lastIndexOf(arr[i]) !== arr.indexOf(arr[i])) {
            let distance = arr.lastIndexOf(arr[i]) - arr.indexOf(arr[i]) //get the distance
            distanceArray.push(distance); //push to new array
        }
    }

    distanceArray.sort() //sort
    console.log(distanceArray[0]) //return first index
}

smallestDistance(arr); //1