- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅转载 深入理解Java：注解（Annotation）自定义注解入门
转自 http://www.cnblogs.com/peida/archive/2013/04/24/3036689.html 深入理解Java：注解（Annotation）自定义注解入门 要深入学习注解，我们就必须能定义自己的注解，并使用注解，在定义自己的注解之前，我们就必须要了解Java为我们提供的元注解和相关定义注解的语法。 元注解： 元注解的作用就是负责
2016-11-09 22:33:24
247
原创 [leetcode]25. Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is
2016-11-01 18:48:09
276
原创 [leetcode]24. Swap Nodes in Pairs
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 algorithm should use only constant space. Y
2016-11-01 18:43:27
304
原创 [leetcode]23. Merge k Sorted Lists
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Leetcode 21题是合并两个链表。合并K个链表的方法就是2的进一步。有两种方法： 1 归并法。即每次链表数组中相邻的两个链表合并，结果为一个新的链表数组，重复之前的流程知道数组中只有一个元
2016-11-01 18:38:53
155
原创 [leetcode]22. Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())
2016-11-01 18:30:32
238
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人