【LeetCode算法题库】Day3：Reverse Integer & String to Integer (atoi) & Palindrome Number

【【LeetCode算法题库】Day3：Reverse Integer & String to Integer (atoi) & Palindrome Number】的更多相关文章

【LeetCode算法题库】Day5：Roman to Integer & Longest Common Prefix & 3Sum

[Q13] Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, w…

【LeetCode算法题库】Day3：Reverse Integer & String to Integer (atoi) & Palindrome Number

[Q7] 把数倒过来 Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 Example 3: Input: 120 Output: 21 Solution: https://leetcode.com/problems/reverse-integer/discuss/229800/Pyt…

【LeetCode算法题库】Day4：Regular Expression Matching & Container With Most Water & Integer to Roman

[Q10] Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input str…

【LeetCode算法题库】Day1：TwoSums & Add Two Numbers & Longest Substring Without Repeating Characters

[Q1] Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example: Given nums = [2, 7, 11…

【LeetCode算法题库】Day7：Remove Nth Node From End of List & Valid Parentheses & Merge Two Lists

[Q19] Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5. Note: Giv…

【LeetCode算法题库】Day2：Median of Two Sorted Arrays & Longest Palindromic Substring & ZigZag Conversion

[Q4] There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). You may assume nums1 and nums2 cannot be both empty. Example 1: nums1 = […