James Pan

原题网址：https://leetcode.com/problems/maximum-product-of-word-lengths/Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share comm

原题网址：https://leetcode.com/problems/meeting-rooms/Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],...] (si < ei), determine if a person could attend