로딩
요청 처리 중입니다...

JAVA_LeetCode 1365_How Many Numbers Are Smaller Than the Current Number

 JAVA_LeetCode 1365_How Many Numbers Are Smaller Than the Current Number

JAVA_LeetCode 1365_How Many Numbers Are Smaller Than the Current Number 풀이 class Solution { public int[] smallerNumbersThanCurrent(int[] nums) { int[] arr = new int[nums.length]; int cnt = 0; for(int i = 0; i < nums.length; i++){ cnt = 0; for(int j = 0; j < nums.length; j++){ if (nums[i] > nums[j]) cnt++; } arr[i] = cnt; } return arr; } } * 출처 https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number...

# JAVA # JAVA_HowManyNumbersAreSmallerThantheCurrentNumber # JAVA_LeetCode1365 # JAVA_LeetCode1365_HowManyNumbersAreSmallerThantheCurrentNumber # LeetCode1365_HowManyNumbersAreSmallerThantheCurrentNumber