摘要: Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one cha 阅读全文
posted @ 2018-11-05 21:06 C`Moriarty 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subs 阅读全文
posted @ 2018-11-05 21:00 C`Moriarty 阅读(144) 评论(0) 推荐(0) 编辑
摘要: Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted i 阅读全文
posted @ 2018-10-30 19:02 C`Moriarty 阅读(142) 评论(0) 推荐(0) 编辑
摘要: Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm should run in O(n) complexity. Examp 阅读全文
posted @ 2018-10-28 11:31 C`Moriarty 阅读(126) 评论(0) 推荐(0) 编辑
摘要: Given a sorted array consisting of only integers where every element appears twice except for one element which appears once. Find this single element 阅读全文
posted @ 2018-10-20 22:43 C`Moriarty 阅读(157) 评论(0) 推荐(0) 编辑
摘要: Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an in 阅读全文
posted @ 2018-10-20 22:35 C`Moriarty 阅读(100) 评论(0) 推荐(0) 编辑
摘要: Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. 阅读全文
posted @ 2018-10-20 22:30 C`Moriarty 阅读(147) 评论(0) 推荐(0) 编辑
摘要: A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one p 阅读全文
posted @ 2018-10-20 22:26 C`Moriarty 阅读(196) 评论(0) 推荐(0) 编辑
摘要: Given an array, rotate the array to the right by k steps, where k is non-negative. Example 1: Example 2: Note: Try to come up as many solutions as you 阅读全文
posted @ 2018-10-17 22:42 C`Moriarty 阅读(102) 评论(0) 推荐(0) 编辑
摘要: Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix. Note that it is th 阅读全文
posted @ 2018-10-16 20:12 C`Moriarty 阅读(153) 评论(0) 推荐(0) 编辑
/* 鼠标点击求赞文字特效 */ /*鼠标跟随效果*/