# [1365. How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)   int* smallerNumbersThanCurrent(int* nums, int numsSize, int* returnSize){ *returnSize=numsSize; int* returnN = malloc(sizeof(int) * numsSize); for(int i=0;i<numsSize;i++) { int n=0; for(int j=0;j<numsSize;j++) { if(nums[j]<nums[i]) { n++; } } returnN[i]=n; } return returnN; }
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up