GoLang Solution For LeetCode Problem: Count of Smaller Numbers After Self
Solving Count of Smaller Numbers After Self in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: [5,2,6,1] Output: [2,1,1,0] Explanation: To the right of 5 there are 2 smaller elements (2 and 1). To the right of 2 there is only 1 smaller element (1). To the right of 6 there is 1 smaller element (1). To the right of 1 there is 0 smaller element.
See the full details of the problem Count of Smaller Numbers After Self at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go