LeetCode算法练习(Hard)
我们要爱学习
敲敲代码,各种玩耍
展开
-
Regular Expression Matching问题及解法
问题描述: 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 e原创 2017-03-01 12:57:56 · 394 阅读 · 0 评论 -
Median of Two Sorted Arrays问题及解法
问题描述: 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转载 2017-02-22 11:03:31 · 487 阅读 · 0 评论