摘要: Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array. Formally the function should: Your algorithm 阅读全文
posted @ 2018-06-29 23:18 小T在学习 阅读(184) 评论(0) 推荐(0) 编辑
摘要: A message containing letters from A-Z is being encoded to numbers using the following mapping: Given a non-empty string containing only digits, determ 阅读全文
posted @ 2018-06-29 22:54 小T在学习 阅读(1090) 评论(1) 推荐(1) 编辑
摘要: Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is po 阅读全文
posted @ 2018-06-29 14:37 小T在学习 阅读(506) 评论(0) 推荐(0) 编辑
摘要: 终于作为转专业小白的我也开始刷题啦!希望能通过记录分享的形式加深解题思路的理解和记忆。也希望大神们能够指点一二。 列表中的题目名称都是链接,难度和标签也都是也都是链接,方便归类搜索。 Total: 41. 阅读全文
posted @ 2018-06-29 12:23 小T在学习 阅读(281) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements that appear twi 阅读全文
posted @ 2018-06-29 11:50 小T在学习 阅读(279) 评论(0) 推荐(0) 编辑
摘要: Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Note: There may be more than one LIS combination, it 阅读全文
posted @ 2018-06-29 00:15 小T在学习 阅读(433) 评论(0) 推荐(0) 编辑