2015年1月22日
Reverse Linked List II
摘要： Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No... 阅读全文
posted @ 2015-01-22 18:35 雄哼哼 阅读(142) 评论(0) 推荐(0)
Distinct Subsequences (dp)
摘要： Given a stringSand a stringT, count the number of distinct subsequences ofTinS.A subsequence of a string is a new string which is formed from the orig... 阅读全文
posted @ 2015-01-22 17:18 雄哼哼 阅读(198) 评论(0) 推荐(0)
Remove Duplicates from Sorted List II
摘要： Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2015-01-22 14:18 雄哼哼 阅读(147) 评论(0) 推荐(0)
Remove Duplicates from Sorted Array II
摘要： Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ret... 阅读全文
posted @ 2015-01-22 13:07 雄哼哼 阅读(165) 评论(0) 推荐(0)