Search Insert Position

LeetCode題目: 35. Search Insert Position

My solution:

/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
let searchInsert = (nums, target) => {
    let findIdx = nums.indexOf(target);
    if(findIdx !== -1) {
        return findIdx;
    } else {
        nums.push(target);
        nums.sort((a, b) => a - b);
        return nums.indexOf(target);
    }
}