357. 统计各位数字都不同的数字个数【中等题】【每日一题】
思路:
- 定义dp数组,长度为n+1用来n个状态对应的满足题意的组合个数。
- 初始状态dp[0]= 1。
- 定义end存放当前有多少种可选方案用来匹配。
- 遍历数字n的所有状态,从1开始(n = 0 时直接返回1):当前状态对应的组合个数dp[i] = 上一个状态组合数 + 当前可选方案数;每次遍历更新当前dp[i]之后,更新下一个状态的可选方案 等于当前可选方案乘上可选数字。
- 遍历结束返回dp[n]即为最终答案。
代码:
class Solution {
public int countNumbersWithUniqueDigits(int n) {
int[] dp = new int[n+1];
//dp[i]统计数字x满足0 <= x < Math.pow(10,i),各位数字都不同的数字x的个数,
dp[0] = 1;//dp[0]为特殊情况,dp[0]=1
//end表示待匹配方案数。初始为9
for (int i = 1,end = 9; i <= n; i++) {
//更新当前i位置的dp[i] = 上一个位置的数字个数 + 当前待匹配方案数
dp[i] = dp[i-1] + end;
//更新下一个i位置的待匹配方案数 = 当前i位置的待匹配方案 * (当前还有10个数字中还有几个可以用来匹配)
end *= 10-i;
}
return dp[n];
}
}
1795. 每个产品在不同商店的价格【简单题】
代码:
# Write your MySQL query statement below
select product_id,'store1' as store, store1 as price
from Products
where store1 is not null
union all # 使用union 需要多一个去重的操作,而本题数据不需要去重,因此union all就可以满足要求
select product_id,'store2' as store,store2 as price
from Products
where store2 is not null
union all
select product_id,'store3' as store,store3 as price
from Products
where store3 is not null;
586. 订单最多的客户【简单题】
代码:
# Write your MySQL query statement below
select customer_number
from Orders
group by customer_number
order by count(customer_number) desc
limit 1;
511. 游戏玩法分析 I【简单题】
代码:
# Write your MySQL query statement below
select player_id,min(event_date) as `first_login`
from Activity
group by player_id;
1890. 2020年最后一次登录
代码:
# Write your MySQL query statement below
select user_id , max(time_stamp) as `last_stamp`
from Logins
where year(time_stamp) = '2020'
group by user_id;