This is the leetcode code track of Wendi.
# | Title | Comment | Language |
---|---|---|---|
2829 | Determine the Minimum Sum of a k-avoiding Array | math | C++ |
7006 | Maximize the Profit as the Salesman | DP,array | C++ |
2834 | Find the Minimum Possible Sum of a Beautiful Array | math | C++ |
# | Title | Comment |
---|---|---|
0175 | Combine Two Tables | OUTER JOIN |
0176 | Second Highest Salary | nested MAX |
0177 | Nth Highest Salary | 更通用的求第n大的条目的方法 |
0178 | Rank Scores | DENSE_RANK() |
0180 | Consecutive Numbers | DISTINCT , 根据value的出现频次筛选条目 |
0181 | Employees Earning More Than Their Managers | 自连接 |
0182 | Duplicate Emails | 只取有重复的元素 |
0184 | Department Highest Salary | MAX from groups |
0196 | Delete Duplicate Emails | DELETE |
0197 | Rising Temperature | DATEDIFF |
0595 | Big Countries | |
1777 | Product's Price for Each Store | SUM , IF |
1873 | Calculate Special Bonus | IF |
2205 | The Number of Users That Are Eligible for Discount | BETWEEN , DISTINCT |