yiyele的博客

难度easy描述Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, n

难度medium描述Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible inp

难度easy描述Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before coding.

难度medium描述The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L

难度medium描述Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000示例Input: "babad"Output: "bab"Note: "aba" is also a valid answer

难度hard描述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)).示例nums1 = [1, 3]nums2

难度medium描述Given a string, find the length of the longest substring without repeating characters.示例Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with th

难度medium描述You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and

难度:easy描述：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 t