摘要：
A.坐飞机 代码： #include <bits/stdc++.h> using namespace std; const int maxn = 1e5 + 10; int n, t; int a[maxn], b[maxn]; int p[maxn]; int main() { scanf("%d 阅读全文
摘要：
https://leetcode.com/problems/delete-duplicate-emails/ Write a SQL query to delete all duplicate email entries in a table named Person, keeping only u 阅读全文
摘要：
https://leetcode.com/problems/classes-more-than-5-students/ There is a table courses with columns: student and class Please list out all classes which 阅读全文
摘要：
https://leetcode.com/problems/second-highest-salary/ Write a SQL query to get the second highest salary from the Employee table. For example, given th 阅读全文
摘要：
https://leetcode.com/problems/not-boring-movies/ X city opened a new cinema, many people would like to go to this cinema. The cinema also gives out a 阅读全文
摘要：
https://leetcode.com/problems/swap-salary/ Given a table salary, such as the one below, that has m=male and f=female values. Swap all f and m values ( 阅读全文
摘要：
https://leetcode.com/problems/customers-who-never-order/ Suppose that a website contains two tables, the Customers table and the Orderstable. Write a 阅读全文
摘要：
https://leetcode.com/problems/employees-earning-more-than-their-managers/ The Employee table holds all employees including their managers. Every emplo 阅读全文
摘要：
https://leetcode.com/problems/big-countries/ There is a table World A country is big if it has an area of bigger than 3 million square km or a populat 阅读全文
摘要：
https://leetcode.com/problems/duplicate-emails/ Write a SQL query to find all duplicate emails in a table named Person. For example, your query should 阅读全文
摘要：
https://leetcode.com/problems/combine-two-tables/ Table: Person Table: Address Write a SQL query for a report that provides the following information 阅读全文
摘要：
https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/ Given two integers L and R, find the count of numbers in the range [L 阅读全文
摘要：
https://leetcode.com/problems/partition-labels/ A string S of lowercase letters is given. We want to partition this string into as many parts as possi 阅读全文