摘要： package leetcode; public class demo_138 { public Node copyRandomList(Node head) { //如果原链表为空链表直接返回 if(head==null) {return null;} Node otemp=head; //在每个 阅读全文

摘要： package leetcode; import java.util.ArrayList; public class offer_06 { public int[] reversePrint(ListNode head) { ArrayList<Integer> list=new ArrayList 阅读全文

摘要： package leetcode; import java.util.Stack; public class offer_30 { /** initialize your data structure here. */ private Stack<Integer> s1; //辅助栈，存放当前最小元 阅读全文

摘要： package leetcode; import java.util.Stack; public class demo_155 { private Stack<Integer> s1; private Stack<Integer> s2; /** initialize your data struc 阅读全文

摘要： package leetcode; import java.util.Stack; public class offer_09 { //模拟出队列 private Stack<Integer> s1; //模拟进队列 private Stack<Integer> s2; public offer_0 阅读全文

摘要： SELECT name AS Customers FROM Customers WHERE Customers.Id not in (SELECT DISTINCT CustomerId FROM Orders) 阅读全文

摘要： # Write your MySQL query statement below SELECT Email FROM #获取Email个数的表 (SELECT Email,COUNT(Email) AS c FROM Person GROUP BY Email) as e WHERE e.c>1 阅读全文

摘要： SELECT `name` as Employee FROM Employee AS e1, #获取一个还有经理id和Salary的表 (SELECT id,Salary FROM Employee WHERE id IN (SELECT ManagerId FROM Employee WHERE 阅读全文

摘要： # Write your MySQL query statement below SELECT s1.score as Score, #s2表中有分数大于等于排序后的s1表中的分数就代表排名是多少 (SELECT COUNT(DISTINCT s2.score) FROM Scores s2 WHE 阅读全文

摘要： CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INT BEGIN RETURN ( # Write your MySQL query statement below. -- 取前N个最大数的最小数 SELECT IF(COUNT(Salary) 阅读全文