2015年04月_yoohoosome

原创 [刷题]Remove Nth Node From End of List

[LintCode]Remove Nth Node From End of List /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; *

2015-04-29 15:05:12 300 1

转载类图的几种关系总结

在UML类图中，常见的有以下几种关系:泛化（Generalization）, 实现（Realization）,关联（Association）,聚合（Aggregation）,组合(Composition)，依赖(Dependency) 1.泛化(Generalization) 【泛化关系】：是一种继承关系,它指定了子类如何特化父类的所有特征和行为例如：老虎是动物的一种. 【箭头指向】

2015-04-27 09:28:07 318

原创 [刷题]Copy List with Random Pointer

[LintCode]Copy List with Random Pointer Version I HashMap /** * Definition for singly-linked list with a random pointer. * class RandomListNode { * int label; * RandomListNode next, ra

2015-04-26 19:35:06 295

原创 [刷题]Linked List Cycle

[LintCode]Linked List Cycle /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; * this.next

2015-04-26 12:21:51 262 1

原创 [刷题]Reorder List

[LintCode]Reorder List /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; * this.next

2015-04-24 22:20:55 264 1

原创 [刷题]Sort List

[LintCode]Sort List /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; * this.next = nul

2015-04-24 20:38:01 335 1

原创 [刷题]Partition List

[LintCode]Partition List /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; * this.next =

2015-04-24 09:31:58 287 1

原创 [刷题]Reverse Linked List II

[LintCode]Reverse Linked List II /** * Definition for ListNode * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null;

2015-04-22 20:10:11 303 1

原创 [刷题]Reverse Linked List

[LintCode]Reverse Linked List /** * Definition for ListNode. * public class ListNode { * int val; * ListNode next; * ListNode(int val) { * this.val = val; * this.

2015-04-22 19:43:24 251 1

原创 [刷题]Remove Duplicates from Sorted List II

[LintCode]Remove Duplicates from Sorted List II Version 1 /** * Definition for ListNode * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x

2015-04-22 19:17:46 419 1

原创 [刷题]Remove Duplicates from Sorted List

[LintCode]Remove Duplicates from Sorted List /** * Definition for ListNode * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; *

2015-04-22 18:49:21 253 1

原创 [刷题]Implement Iterator of Binary Search Tree

[LintCode]Implement Iterator of Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int va

2015-04-22 09:56:33 297

原创 [刷题]Median of two Sorted Arrays

[LintCode]Median of two Sorted Arrays class Solution { /** * @param A: An integer array. * @param B: An integer array. * @return: a double whose format is *.5 or *.0 */ pu

2015-04-22 09:19:53 255

原创 [刷题]strStr

[LIntCode]strStr class Solution { /** * Returns a index to the first occurrence of target in source, * or -1 if target is not part of source. * @param source string to be scanned.

2015-04-21 09:27:10 254

原创 [刷题]Reverse Words in a String

[LIntCode]Reverse Words in a String public class Solution { /** * @param s : A string * @return : A string */ public String reverseWords(String s) { // 2015-4-14 熟悉相关

2015-04-14 20:00:56 230

原创 [刷题]Rotate String

[LintCode]Rotate String public class Solution { /* * param A: A string * param offset: Rotate string with offset. * return: Rotated string. */ public char[] rotateString

2015-04-14 16:35:28 277

原创 [刷题]Recover Rotated Sorted Array

[LintCode]Recover Rotated Sorted Array public class Solution { /** * @param nums: The rotated sorted array * @return: The recovered sorted array */ public void recoverRotatedSo

2015-04-14 11:44:53 294

原创 [刷题]Merge Sorted Array II

[LintCode]Merge Sorted Array II Version I class Solution { /** * @param A: sorted integer array A which has m elements, * but size of A is m+n * @param B: sorted inte

2015-04-13 18:07:55 385

原创 [刷题]Merge Sorted Array

[LintCode]Merge Sorted Array class Solution { /** * @param A and B: sorted integer array A and B. * @return: A new sorted integer array */ public ArrayList mergeSortedArray(A

2015-04-13 17:55:35 280

原创 [刷题]Remove Duplicates from Sorted Array II

[LintCode]Remove Duplicates from Sorted Array II public class Solution { /** * @param A: a array of integers * @return : return an integer */ public int removeDuplicates(int[

2015-04-12 19:21:24 246

原创 [刷题]Remove Duplicates from Sorted Array

[LintCode]Remove Duplicates from Sorted Array public class Solution { /** * @param A: a array of integers * @return : return an integer */ public int removeDuplicates(int[

2015-04-12 18:56:53 218

原创 [刷题]Find Peak Element

[LintCode]Find Peak Element class Solution { /** * @param A: An integers array. * @return: return any of peek positions. */ public int findPeak(int[] A) { // 2015-4-1

2015-04-12 17:57:40 339

原创 [刷题]First Bad Version

[LintCode]First Bad Version /** * public class VersionControl { * public static boolean isBadVersion(int k); * } * you can use VersionControl.isBadVersion(k) to judge wether * the kth cod

2015-04-11 12:15:11 327

原创 [刷题]Search a 2D Matrix II

[LintCode]Search a 2D Matrix II public class Solution { /** * @param matrix, a list of lists of integers * @param target, an integer * @return a boolean, indicate whether matrix

2015-04-11 11:55:46 250

原创 [刷题]Search a 2D Matrix

[LintCode]Search a 2D Matrix public class Solution { /** * @param matrix, a list of lists of integers * @param target, an integer * @return a boolean, indicate whether matrix conta

2015-04-11 11:39:07 260

原创 [刷题]Search in Rotated Sorted Array II

[LintCode]Search in Rotated Sorted Array II public class Solution { /** * param A : an integer ratated sorted array and duplicates are allowed * param target : an integer to be s

2015-04-07 22:49:54 249

原创 [刷题]Search in Rotated Sorted Array

[LintCode]Search in Rotated Sorted Array public class Solution { /** *@param A : an integer rotated sorted array *@param target : an integer to be searched *return : an integer

2015-04-07 22:24:25 235

原创 [刷题]Search Insert Position

[LintCode]Search Insert Position public class Solution { /** * param A : an integer sorted array * param target : an integer to be inserted * return : an integer */ publ

2015-04-07 22:01:54 256

原创 [刷题]Search for a Range

[LintCode]Search for a Range public class Solution { /** *@param A : an integer sorted array *@param target : an integer to be inserted *return : a list of length 2, [index1, i

2015-04-06 12:11:14 292 1

原创 [刷题]Binary Search

[LintCode]Binary Search class Solution { /** * @param nums: The integer array. * @param target: Target to find. * @return: The first position of target. Position starts from 0.

2015-04-01 22:07:26 279 1

原创 [刷题]Validate Binary Search Tree

[LintCode]Validate Binary Search Tree /** * Definition of TreeNode: * public class TreeNode { * public int val; * public TreeNode left, right; * public TreeNode(int val) { *

2015-04-01 20:07:12 309 1

willshine19的专栏