- 博客(3)
- 收藏
- 关注
RSS订阅原创 LeetCode刷题笔记（Python-001）
283.Move Zeroes（难度：Easy）描述：Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.举例:输入: [0,1,0,3,12]输出: [1,3,12,...
2019-11-08 12:05:07
102
原创 LeetCode刷题笔记（SQL-001）
178.Rank ScoresSQL Schema（表结构）Create table If Not Exists Scores (Id int, Score DECIMAL(3,2));Truncate table Scores;insert into Scores (Id, Score) values ('1', '3.5');insert into Scores (Id, S...
2019-11-08 10:09:51
180
原创 LeetCode刷题笔记（SQL-002）
626.Exchange SeatsSQL Schema（表结构）Create table If Not Exists seat(id int, student varchar(255));Truncate table seat;insert into seat (id, student) values ('1', 'Abbot');insert into seat (id, s...
2019-11-08 10:09:48
126
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人