weixin_36629430的博客

Classes more than 5 students |leetcode |mysql

weixin_36629430 — Thu, 13 Aug 2020 04:19:12 +0800

select class from courses group by class having count(distinct student)>=5;

Best Time to Buy and Sell | Leetcode | C++

weixin_36629430 — Thu, 13 Aug 2020 03:33:21 +0800

class Solution { public: int maxProfit(vector& prices) { int valley = INT_MAX; int profit = 0; for(int i =0; i < prices.size(); i++) { if(prices[i] < valley) valley =.

Merge two sorted List | leetcode | C++

weixin_36629430 — Wed, 12 Aug 2020 02:47:19 +0800

class Solution { public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { std::vector chain; ListNode* head = new ListNode(0); ListNode* result =head; ListNode* l =l1; while(l!= NUL.

Custmoer placing the largest orders |leetcode |mysql

weixin_36629430 — Tue, 11 Aug 2020 05:44:03 +0800

select customer_number from orders group by customer_number order by count(order_number) desc limit 1

Valid Parentheses |leetcode |python3

weixin_36629430 — Tue, 11 Aug 2020 05:34:32 +0800

class Solution: def isValid(self, s: str) -> bool: queue = [] pare_dict = {')':'(',']':'[','}':'{'} for c in s: if c in pare_dict: if queue: top = queue.pop() e.

Find Customer Referee_id

weixin_36629430 — Mon, 10 Aug 2020 06:31:59 +0800

select name from customer where referee_id !=2 or referee_id is NULL

Word Ladder | Leetcode | Python3

weixin_36629430 — Mon, 10 Aug 2020 06:27:25 +0800

from collections import defaultdict class Solution: def ladderLength(self, beginWord: str, endWord: str, wordList: List[str]) -> int: if endWord not in wordList: return 0 all_combo_dict = defaultdict(list) for word in wo.

Employee Bonus | Leetcode | Mysql

weixin_36629430 — Sun, 09 Aug 2020 06:07:08 +0800

SELECT Employee.name, Bonus.bonus FROM Employee LEFT JOIN Bonus ON Employee.empid = Bonus.empid WHERE bonus < 1000 OR bonus IS NULL ;

X of a Kind in a Deck of Cards | Leetcode | Python3

weixin_36629430 — Sun, 09 Aug 2020 04:57:40 +0800

def hcf(x, y): if x > y: smaller = y else: smaller = x for i in range(1,smaller + 1): if((x % i == 0) and (y % i == 0)): hcf = i return hcf class Solution: def h.

Game Play Analysis | Leetcode | Mysql

weixin_36629430 — Fri, 07 Aug 2020 05:35:48 +0800

1. select player_id, min(event_date) as 'first_login' from Activity group by player_id 2. select A1.player_id,A1.device_id from Activity A1, (select player_id, min(event_date) as 'first_login' from Activity group by player_id) A2 where A1....

Logger Rate Limiter | Leetcode | python

weixin_36629430 — Fri, 07 Aug 2020 04:06:31 +0800

class Logger: def __init__(self): """ Initialize your data structure here. """ self.msg_dict = {} def shouldPrintMessage(self, timestamp: int, message: str) -> bool: """ Returns true if the mess.

Rising Temperature | leetcode | Mysql

weixin_36629430 — Thu, 06 Aug 2020 04:38:07 +0800

select w2.Id from Weather w1, Weather w2 where w2.Temperature > w1.Temperature AND DATEDIFF(w2.RecordDate, w1.RecordDate) = 1

MovingAverage | leetcode Python3

weixin_36629430 — Thu, 06 Aug 2020 04:37:14 +0800

class MovingAverage: def __init__(self, size: int): """ Initialize your data structure here. """ self.size = size self.window = [] def next(self, val: int) -> float: size = self.size win.

Leetcode 299 | Bulls and cows | C++

weixin_36629430 — Wed, 05 Aug 2020 09:59:20 +0800

class Solution { public: int inside(int a , std::vector v) { for (int i = 0; i < v.size(); i++) { if (a == v[i]) return i; } return -1; } .

Python 直接拷贝浅拷贝深拷贝区别

weixin_36629430 — Wed, 22 Jul 2020 10:55:11 +0800

直接复制只是把引用增多了一个 , 用任意一个引用改变对象都会导致其他引用也变. copy - 浅拷贝, 复制了一个新的父对象, 但是对象中如果有嵌套结构, 子对象的元素改变也会引起所有的引用都改变 copy.deepcopy() 完全复制父对象与子对象, 完全独立. import copy a = [1, 2, 3, 4, ['a', 'b']] #原始对象 b = a #赋值，传对象的引用 c = copy.copy(a) ..

Text Justification | Leetcode 68 C++

weixin_36629430 — Sun, 19 Jul 2020 15:33:19 +0800

class Solution { public: vector fullJustify(vector& words, int maxWidth) { std::vector result; int line_index = 0; int letter_count = 0; int i = 0; std::ve.

Letter Combination | Leetcode

weixin_36629430 — Mon, 29 Jun 2020 06:01:11 +0800

class Solution{ private: const string digit_to_letter[10] = { " ", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" }; std::vector

184. Department Highest Salary | Leetcode

weixin_36629430 — Sun, 28 Jun 2020 01:18:41 +0800

select distinct Department.Name as 'Department',Employee.Name as 'Employee',D1.Salary from Department, Employee, (select Max(Employee.Salary) as Salary ,DepartmentId from Employee group by DepartmentId) as D1 where Department.Id = D1.DepartmentId and Empl.

Customers who never order | Leetcode

weixin_36629430 — Sun, 28 Jun 2020 00:36:32 +0800

select C1.Name as Customers from Customers C1 where C1.Id not in ( select CustomerId from Orders);

3sum closest | Leetcode

weixin_36629430 — Sun, 28 Jun 2020 00:18:38 +0800

class Solution { public: int threeSumClosest(vector& nums, int target) { int diff = INT_MAX, size = nums.size(); sort(begin(nums),end(nums)); for(int i = 0; i < size && diff != 0; i++) { ...