![](https://img-blog.csdnimg.cn/20210415161808121.jpg?x-oss-process=image/resize,m_fixed,h_224,w_224)
leetcode刷题记录
文章平均质量分 70
要开始努力刷题了啊
笨鸟先飞1003
小菜鸡研一在读,记录自己啃论文历程,欢迎各位大佬指正。
展开
-
LeetCode Day4 最长公共前缀
编写一个函数来查找字符串数组中的最长公共前缀。如果不存在公共前缀,返回空字符串 “”。示例 1:输入:strs = [“flower”,“flow”,“flight”]输出:“fl”示例 2:输入:strs = [“dog”,“racecar”,“car”]输出:""解释:输入不存在公共前缀。提示:0 <= strs.length <= 200 0 <= strs[i].length <= 200 strs[i] 仅由小写英文字母组成来源:力扣.原创 2021-04-18 19:50:43 · 171 阅读 · 0 评论 -
LeetCode Day4 Roman to Integer
emm、英文描述看不懂、今天看的中文题目罗马数字包含以下七种字符:I, V, X, L,C,D 和 M。字符 数值I 1V 5X 10L 50C 100D 500M 1000例如, 罗马数字 2写做 II ,即为两个并列的1。12 写做 XII ,即为 X + II原创 2021-04-18 19:10:17 · 131 阅读 · 0 评论 -
LeetCode Day3 Palindrome Number
Given an integer x, return true if x is palindrome integer.An integer is a palindrome when it reads the same backward as forward.For example, 121 is palindrome while 123 is not.Example 1:Input: x = 121Output: trueExample 2:Input: x = -121Outpu.原创 2021-04-17 17:18:59 · 103 阅读 · 0 评论 -
LeetCode Day2 Reverse Integer
Given a signed 32-bit integer x, return x with its digits reversed. Ifreversing x causes the value to go outside the signed 32-bit integerrange [-231, 231 - 1], then return 0.Assume the environment does not allow you to store 64-bit integers(signed or.原创 2021-04-16 18:04:02 · 108 阅读 · 0 评论 -
LeetCode Day1 Two Sum
Given an array of integers nums and an integer target, return indicesof the two numbers such that they add up to target.You may assume that each input would have exactly one solution, andyou may not use the same element twice.You can return the answer.原创 2021-04-15 17:12:08 · 136 阅读 · 0 评论