Notice
Recent Posts
Recent Comments
Link
๊ด€๋ฆฌ ๋ฉ”๋‰ด

0105

36. Java/Javascript ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค(lv.0) ์ค‘๋ณต๋œ ์ˆซ์ž๊ฐœ์ˆ˜ ๋ณธ๋ฌธ

๐Ÿง‘‍๐Ÿ’ป programmers

36. Java/Javascript ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค(lv.0) ์ค‘๋ณต๋œ ์ˆซ์ž๊ฐœ์ˆ˜

๊ณต๋ฐฑ์˜ค 2025. 3. 11. 20:45
728x90
๋ฐ˜์‘ํ˜•

โœ… ๋ฌธ์ œ

์ •์ˆ˜๊ฐ€ ๋‹ด๊ธด ๋ฐฐ์—ด array์™€ ์ •์ˆ˜ n์ด ๋งค๊ฐœ๋ณ€์ˆ˜๋กœ ์ฃผ์–ด์งˆ ๋•Œ, array์— n์ด ๋ช‡ ๊ฐœ ์žˆ๋Š” ์ง€๋ฅผ return ํ•˜๋„๋ก solution ํ•จ์ˆ˜๋ฅผ ์™„์„ฑํ•ด๋ณด์„ธ์š”.

โœ… java

package Lv0.์ค‘๋ณต๋œ_์ˆซ์ž๊ฐœ์ˆ˜;

class Solution {
    public int solution(int[] array, int n) {
        int answer = 0;
        for (int i = 0; i < array.length; i++) {
            if (array[i] == n) {
                answer++;
            }
        }
        return answer;
    }
}

โœ… javascript

function solution(array, n) {
    let answer = 0;
    answer = array.filter(num => num === n).length;
    return answer;
}
728x90