zxqstrong - 博客园

2016年3月17日

摘要： Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your a 阅读全文

posted @ 2016-03-17 16:07 zxqstrong 阅读(208) 评论(0) 推荐(0) 编辑

21. Merge Two Sorted Lists

摘要： Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 合并两个有序链表阅读全文

posted @ 2016-03-17 15:21 zxqstrong 阅读(151) 评论(0) 推荐(0) 编辑

2016年3月15日

20 Valid Parentheses

摘要： Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the 阅读全文

posted @ 2016-03-15 16:47 zxqstrong 阅读(173) 评论(0) 推荐(0) 编辑

19. Remove Nth Node From End of List

摘要： Given a linked list, remove the nth node from the end of list and return its head. For example, Note:Given n will always be valid.Try to do this in on 阅读全文

posted @ 2016-03-15 16:01 zxqstrong 阅读(147) 评论(0) 推荐(0) 编辑

18. 4Sum

摘要： Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array whic 阅读全文

posted @ 2016-03-15 15:34 zxqstrong 阅读(151) 评论(0) 推荐(0) 编辑

2016年3月14日

17. Letter Combinations of a Phone Number

摘要： Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文

posted @ 2016-03-14 17:27 zxqstrong 阅读(150) 评论(0) 推荐(0) 编辑

16. 3Sum Closest

摘要： Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. 阅读全文

posted @ 2016-03-14 16:52 zxqstrong 阅读(166) 评论(0) 推荐(0) 编辑

15. 3Sum

摘要： Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of 阅读全文

posted @ 2016-03-14 16:33 zxqstrong 阅读(187) 评论(0) 推荐(0) 编辑

14. Longest Common Prefix

摘要： Write a function to find the longest common prefix string amongst an array of strings. 求多个字符串的最长公共前缀。 1、当strs为空，直接输出“” 2、当strs中含有“”，直接输出“” 3、strs[0]的最阅读全文

posted @ 2016-03-14 15:11 zxqstrong 阅读(126) 评论(0) 推荐(0) 编辑

13 Roman to Integer

摘要： Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 整体来说，罗马数字中的字符代表的数值大小，一般是从左至右非严格递减的（也就是说可能相阅读全文

posted @ 2016-03-14 14:42 zxqstrong 阅读(161) 评论(0) 推荐(0) 编辑

strong

每天看一点，每天学一点

公告