LeetCode/Hard

10 Regular Expression Matching

1. Description Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*' where : '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching sould cover the entire input string (not partial). constraints : 1

04 Median of Two Sorted Arrays

1. Description Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run time complexity should be O(log(m+n)) constraints : nums1.length == m nums2.length == n 0