题目描述：
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].
Example:
Given ...
档案日期2015的48
2015年11月30日 - 2015年12月6日
[LeetCode]Count of Smaller Numbers After Self
[LeetCode]Super Ugly Number
作者是
发布于
在
LeetCode.
题目描述：
Write a program to find the nth super ugly number.
Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13 ...
[LeetCode]Burst Balloons
作者是
发布于
在
LeetCode.
题目描述：
Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If you burst balloon i you will get nums[left ...