码不停Ti2001
码不停Ti2001
全部文章
LeetCode
# PAT乙级练习题(1)
# 团队设计天梯赛(2)
2020HBU天梯赛训练(48)
C++(284)
C语言(4)
Git(1)
idea(3)
java入门(17)
java编程规范(1)
java项目(1)
kinect(2)
LeetCode从零开始(3)
Linux(12)
MySQL(1)
pat(26)
SQL刷题(2)
XML(8)
信息安全(2)
分治算法(1)
剑指offer(2)
博客美化(5)
哈希表(6)
实习(3)
并查集(1)
微信小程序(5)
微机原理与汇编语言(6)
心得(3)
总结(23)
数学(1)
数据库(1)
数据结构(42)
数组(21)
整理(5)
日迹(7)
月刊(1)
服务器(7)
未完成(12)
未归档(63)
杂货铺(1)
树(10)
油管笔记(2)
牛客网(10)
玩转服务器(1)
环境配置(1)
生活杂碎(1)
知乎笔记(1)
笔记(6)
算法(2)
腾讯Techo开发者大会(2)
蓝桥杯(4)
视频笔记(1)
读书(4)
读书笔记(4)
趣味科普(1)
软件分享(2)
零碎知识点(2)
题解(5)
归档
标签
去牛客网
登录
/
注册
韩旭051 一个大二单身dog
好好学习,活着就好
全部文章
/ LeetCode
(共115篇)
【LeetCode第 160 场周赛】5238. 找出给定方程的正整数解
5238. 找出给定方程的正整数解 显示英文描述 我的提交返回竞赛 用户通过次数745 用户尝试次数796 通过次数757 提交次数1221 题目难度Easy 给出一个函数 f(x, y) 和一个目标结果 z,请你计算方程 f(x,y) == z 所有可能的正整数...
2019-10-28
0
406
【LeetCode】1217. Play with Chips
There are some chips, and the i-th chip is at position chips[i]. You can perform any of the two following types of moves any number of times (possibl...
2019-10-12
0
533
【LeetCode】1217. Play with Chips
There are some chips, and the i-th chip is at position chips[i]. You can perform any of the two following types of moves any number of times (possibl...
2019-10-12
0
0
【LeetCode】1218. Longest Arithmetic Subsequence of Given Difference
Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that th...
2019-10-12
0
487
【LeetCode】1218. Longest Arithmetic Subsequence of Given Difference
Given an integer array arr and an integer difference, return the length of the longest subsequence in arr which is an arithmetic sequence such that th...
2019-10-12
0
554
【LeetCode】13. Roman to Integer
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 1...
2019-10-10
0
349
【LeetCode】13. Roman to Integer
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 1...
2019-10-10
0
415
【LeetCode】617. Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n...
2019-10-05
0
481
【LeetCode】617. Merge Two Binary Trees
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n...
2019-10-05
0
523
【Leet Code】70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you c...
2019-10-04
0
484
首页
上一页
3
4
5
6
7
8
9
10
11
12
下一页
末页