Given an array of integers, replace all the occurrences of elemToReplace with substitutionElem.

Example

For inputArray = [1, 2, 1], elemToReplace = 1, and substitutionElem = 3, the output should be

solution(inputArray, elemToReplace, substitutionElem) = [3, 2, 3].

Input/Output

• [execution time limit] 3 seconds (java)

• [memory limit] 1 GB

• [input] array.integer inputArray

  Guaranteed constraints:

  0 ≤ inputArray.length ≤ 104,

  0 ≤ inputArray[i] ≤ 109.

• [input] integer elemToReplace

  Guaranteed constraints:

  0 ≤ elemToReplace ≤ 109.

• [input] integer substitutionElem

  Guaranteed constraints:

  0 ≤ substitutionElem ≤ 109.

• [output] array.integer

풀이

int[] solution(int[] inputArray, int elemToReplace, int substitutionElem) {
    for (int i = 0; i < inputArray.length; i ++) {
        int n = inputArray[i];
        
        if (n == elemToReplace) inputArray[i] = substitutionElem;
    }
    
    return inputArray;
}