183. 从不订购的客户
摘要:SELECT name AS Customers FROM Customers WHERE Customers.Id not in (SELECT DISTINCT CustomerId FROM Orders)
阅读全文
posted @
2021-08-20 22:23
一仟零一夜丶
阅读(23)
推荐(0)
182. 查找重复的电子邮箱
摘要:# 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
阅读全文
posted @
2021-08-20 17:06
一仟零一夜丶
阅读(46)
推荐(0)
181. 超过经理收入的员工
摘要:SELECT `name` as Employee FROM Employee AS e1, #获取一个还有经理id和Salary的表 (SELECT id,Salary FROM Employee WHERE id IN (SELECT ManagerId FROM Employee WHERE
阅读全文
posted @
2021-08-20 16:39
一仟零一夜丶
阅读(45)
推荐(0)
178. 分数排名
摘要:# Write your MySQL query statement below SELECT s1.score as Score, #s2表中有分数大于等于排序后的s1表中的分数就代表排名是多少 (SELECT COUNT(DISTINCT s2.score) FROM Scores s2 WHE
阅读全文
posted @
2021-08-14 10:42
一仟零一夜丶
阅读(35)
推荐(0)
177. 第N高的薪水
摘要:CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INT BEGIN RETURN ( # Write your MySQL query statement below. -- 取前N个最大数的最小数 SELECT IF(COUNT(Salary)
阅读全文
posted @
2021-08-13 21:05
一仟零一夜丶
阅读(13)
推荐(0)
176. 第二高的薪水
摘要:#取出前大的子表,再找出最小的 SELECT IF(COUNT(Salary)=2, MIN(Salary), NULL) #if(ex1,ex2,ex3),如果ex1为真,则输出结果为ex2,否则为ex3 AS SecondHighestSalary #取别名 FROM (SELECT DISTI
阅读全文
posted @
2021-08-13 20:37
一仟零一夜丶
阅读(20)
推荐(0)
198. 打家劫舍
摘要:package leetcode; public class demo_198 { public int rob(int[] nums) { int[] dp=new int[nums.length]; dp[0]=nums[0]; //防止出现一间房屋的情况 try { dp[1]=Math.ma
阅读全文
posted @
2021-08-07 11:41
一仟零一夜丶
阅读(33)
推荐(0)
171. Excel 表列序号
摘要:package leetcode; public class demo_171 { public int titleToNumber(String columnTitle) { int num=0; //类似于二进制转化为十进制,这里是26 for(int i=0;i<columnTitle.len
阅读全文
posted @
2021-08-06 21:22
一仟零一夜丶
阅读(63)
推荐(0)
169. 多数元素
摘要:package leetcode; public class demo_169 { public int majorityElement(int[] nums) { int count=1; int target=nums[0]; //摩尔投票法,与target相同则加一,不同则减一 for(int
阅读全文
posted @
2021-08-06 20:59
一仟零一夜丶
阅读(24)
推荐(0)
179. 最大数
摘要:package leetcode; public class demo_173 { public String largestNumber(int[] nums) { String str=""; String[] strnum=new String[nums.length]; int flag=0
阅读全文
posted @
2021-08-06 20:18
一仟零一夜丶
阅读(43)
推荐(0)
168. Excel表列名称
摘要:package leetcode; public class demo_168 { public String convertToTitle(int columnNumber) { StringBuffer sb=new StringBuffer(); while(columnNumber!=0)
阅读全文
posted @
2021-08-03 16:08
一仟零一夜丶
阅读(61)
推荐(0)
167. 两数之和 II - 输入有序数组
摘要:package leetcode; public class demo_167 { public int[] twoSum(int[] numbers, int target) { int[] num=new int[2]; int i=0,j=numbers.length-1; while(i<j
阅读全文
posted @
2021-08-03 11:39
一仟零一夜丶
阅读(41)
推荐(0)
165. 比较版本号
摘要:package leetcode; public class demo_165 { public int compareVersion(String version1, String version2) { String[] v1=version1.split("\\."); String[] v2
阅读全文
posted @
2021-08-03 10:25
一仟零一夜丶
阅读(40)
推荐(0)
162. 寻找峰值
摘要:package leetcode; //nums[mid+1]>nums[mid],那么mid+2只有两种可能,一个是大于mid+1,一个是小于mid+1,小于mid+1的情况,那么mid+1就是峰值, //大于mid+1的情况,继续向右推,如果一直到数组的末尾都是大于的,那么可以肯定最后一个元素是
阅读全文
posted @
2021-08-01 16:46
一仟零一夜丶
阅读(41)
推荐(0)