Leetcode 183. Customers Who Never Order
来源:互联网 发布:好考试软件 编辑:程序博客网 时间:2024/06/07 03:45
183. Customers Who Never Order
Total Accepted: 22007 Total Submissions: 68771 Difficulty: EasySuppose that a website contains two tables, the Customers
table and the Orders
table. Write a SQL query to find all customers who never order anything.
Table: Customers
.
+----+-------+| Id | Name |+----+-------+| 1 | Joe || 2 | Henry || 3 | Sam || 4 | Max |+----+-------+
Table: Orders
.
+----+------------+| Id | CustomerId |+----+------------+| 1 | 3 || 2 | 1 |+----+------------+
Using the above tables as example, return the following:
+-----------+| Customers |+-----------+| Henry || Max |+-----------+
思路:
寻找Customers中没有在Orders中出现的即可。关键字:not in
# Write your MySQL query statement belowselect a.name as 'Customers' from Customers awhere a.id not in (select customerid from Orders);
0 0
- LEETCODE database 183. Customers Who Never Order
- leetcode 183. Customers Who Never Order
- leetcode.183. Customers Who Never Order
- 【leetcode Database】183. Customers Who Never Order
- leetcode 183. Customers Who Never Order
- Leetcode 183. Customers Who Never Order
- leetcode 183. Customers Who Never Order
- 183. Customers Who Never Order (LeetCode, SQL)
- LeetCode笔记:183. Customers Who Never Order
- leetcode 183. Customers Who Never Order
- LeetCode | Customers Who Never Order
- Leetcode : Customers Who Never Order
- LeetCode Customers Who Never Order
- Leetcode Customers Who Never Order
- Leetcode: Customers Who Never Order
- 【Leetcode】Customers Who Never Order
- 183. Customers Who Never Order
- 183. Customers Who Never Order
- 10041---构建高并发高可用的电商平台架构实践
- [php] 设计模式之 组合模式
- java多态性
- 简单文本处理小工具
- Head First 设计模式 里面的设计原则总结 MindJet整理
- Leetcode 183. Customers Who Never Order
- nginx反向代理java web应用,网页链接的问题
- 蒙特卡洛模拟
- 10010---关于Java并发编程的总结和思考
- WPF
- 软件开发流程个人理解
- R语言导出数据
- TOJ 2226.Parliament
- JVM中的内存分配(对象的存储)