02 2021 档案
摘要：题目 LeetCode LeetCode-cn The count-and-say sequence is a sequence of digit strings defined by the recursive formula: countAndSay(1) = "1" countAndSay(n
阅读全文
摘要：题目 LeetCode LeetCode-cn Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the inde
阅读全文
摘要：题目 LeetCode LeetCode-cn Implement strStr(). Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. C
阅读全文
摘要：题目 leetcode-cn leetcode Given a sorted array nums, remove the duplicates in-place such that each element appears only once and returns the new length.
阅读全文
摘要：题目 LeetCode LeetCode-cn Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the fi
阅读全文
摘要：题目 LeetCode LeetCode-cn Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An in
阅读全文
摘要：题目 LeetCode 力扣 题解 先维护一个map，用于建立罗马数字和整数的关系，接着挨个破译即可。 //Go func romanToInt(s string) int { var charToIntMap = make(map[byte]int, 8) charToIntMap['I'] =
阅读全文
摘要：题目 LeetCode LeetCode-cn Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an
阅读全文
摘要：题目 LeetCode LeetCode-cn Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forw
阅读全文
摘要：题目 LeetCode LeetCode-cn Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 3
阅读全文
