jackllvv的博客

正则式匹配 问题: ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype s

判断一个整数是否为回文串 问题: Determine whether an integer is a palindrome. Do this without extra space. 翻译: 判断一个整数是否为回文串，不要使用额外的空间。 解题方案: 对于位数是偶数位的整数，我们只需要将整数平均分为两部分:高位部分和低位部分,将低位部分反转并和高位部分比较，

LeetCode String to Integer 字符转数字

将一个整数反转

z型转换

最长回文串Question Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. 大意 给定一个字符串s,找到s的最长回文子串。字符串的最大长度为1000. Example Example: Input:

求两个有序数组的中位数 Problem 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))

LeetCode(3) Longest Substring Without Repeating CharactersProblem Given a string, find the length of the longest substring without repeating characters. 大意:求字符串最长没有重复字符的子串的长度。 Example Given “abcabc

LeetCode(2) Add Two Numbersquestion: 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 d

盛水最多的容器 问题： Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i...