EvanMeetTheWorld

摘要： Given two words word1 and word2, find the minimum number of steps ... 阅读全文

posted @ 2020-11-23 05:16 EvanMeetTheWorld 阅读(21) 评论(0) 推荐(0)

摘要： classic DP problem, LCS Given two strings text1 and text2, return ... 阅读全文

posted @ 2020-11-23 04:52 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)

摘要： we define two words can form a chain: word1 word2, if we can only ... 阅读全文

posted @ 2020-11-23 04:34 EvanMeetTheWorld 阅读(17) 评论(0) 推荐(0)

摘要： given a 2D array and a time T clips[i][0] represents for the start... 阅读全文

posted @ 2020-11-23 02:10 EvanMeetTheWorld 阅读(35) 评论(0) 推荐(0)

摘要：所谓的动态规划是一种手段不像树或者图或者Math之类的题目一样看到题目就知道这个是属于什么题目应该用什么方式去做。比如说 ... 阅读全文

posted @ 2020-11-23 00:28 EvanMeetTheWorld 阅读(77) 评论(0) 推荐(0)

摘要：链表反转核心代码： while(cur.next != null){ ListNode temp = cur.nex... 阅读全文

posted @ 2020-11-23 00:27 EvanMeetTheWorld 阅读(32) 评论(0) 推荐(0)

摘要： reference：https://www.1point3acres.com/bbs/thread-689770-1-1.html ... 阅读全文

posted @ 2020-11-23 00:27 EvanMeetTheWorld 阅读(64) 评论(0) 推荐(0)

摘要： Given a string s, return the longest palindromic substring in s. r... 阅读全文

posted @ 2020-11-22 11:40 EvanMeetTheWorld 阅读(31) 评论(0) 推荐(0)

摘要： Given a positive integer n, find the **least number of perfect squ... 阅读全文

posted @ 2020-11-22 10:25 EvanMeetTheWorld 阅读(22) 评论(0) 推荐(0)

摘要：两种方法： Math.round(n) == n //if true, then 是整数否则不是 n % 1 == 0 //if ... 阅读全文

posted @ 2020-11-22 09:53 EvanMeetTheWorld 阅读(559) 评论(0) 推荐(0)