Leetcode 619. Biggest Single Number

Problem:

Table number contains many numbers in column num including duplicated ones.
Can you write a SQL query to find the biggest number, which only appears once.

+---+
|num|
+---+
| 8 |
| 8 |
| 3 |
| 3 |
| 1 |
| 4 |
| 5 |
| 6 | 

For the sample data above, your query should return the following result:

+---+
|num|
+---+
| 6 |

Note:
If there is no such number, just output null.

Solution:

  这道题本不难,但引申出了一个很重要的问题,我第一次写的答案是

SELECT num FROM number GROUP BY num HAVING COUNT(*)=1 ORDER BY num DESC LIMIT 1;

  但没有通过测试用例

1 Input: {"headers": {"number": ["num"]}, "rows": {"number": [[8],[1],[8],[3],[4],[3],[1],[4],[5],[5],[6],[6]]}}
2 
3 Output: {"headers":["num"],"values":[]}
4 
5 Expected: {"headers":["num"],"values":[[null]]}

  因此,若要输出null,需要满足两个条件,第一,select中应是聚合函数,第二,聚合函数处理的行数应为0。

Code:

 

SELECT MAX(num) AS num FROM (SELECT num FROM number GROUP BY num HAVING COUNT(*)=1) AS T;

 

转载于:https://www.cnblogs.com/haoweizh/p/10198568.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值