有一天我们渺小的作为 或许 会巨大震动整个世界

摘要： 10. Regular Expression Matching Hard Hard Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and 阅读全文

摘要： https://www.cnblogs.com/jessepeng/p/10984983.html Linux 的R环境，可以通过anaconda jupyter notbook很容易的配置，见我之前的博客 https://www.cnblogs.com/shanyr/p/11276755.html 阅读全文

摘要： 9. Palindrome Number Easy Easy Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. Ex 阅读全文

摘要： 8. String to Integer (atoi) Medium Medium Implement atoi which converts a string to an integer. The function first discards as many whitespace charact 阅读全文

摘要： 7. Reverse Integer Easy Easy Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Out 阅读全文

摘要： 6. ZigZag Conversion Medium Medium The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to di 阅读全文

摘要： Leetcode 5. Longest Palindromic Substring(最长回文子串， Manacher算法) Given a string s, find the longest palindromic substring in s. You may assume that the m 阅读全文

摘要： 4. Median of Two Sorted Arrays Hard Hard There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted a 阅读全文

摘要： 3. Longest Substring Without Repeating Characters Medium Medium Given a string, find the length of the longest substring without repeating characters. 阅读全文

摘要： 恢复内容开始 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 阅读全文