TonyLuis

2015年6月3日

Java for LeetCode 138 Copy List with Random Pointer

摘要： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy ... 阅读全文

posted @ 2015-06-03 16:39 TonyLuis 阅读(240) 评论(0) 推荐(0)

Java for LeetCode 137 Single Number II

摘要： Given an array of integers, every element appears three times except for one. Find that single one. Note:Your algorithm should have a linear runtime c... 阅读全文

posted @ 2015-06-03 16:02 TonyLuis 阅读(316) 评论(0) 推荐(0)

Java for LeetCode 136 Single Number

摘要： Given an array of integers, every element appears twice except for one. Find that single one. Note:Your algorithm should have a linear runtime complex... 阅读全文

posted @ 2015-06-03 12:10 TonyLuis 阅读(197) 评论(0) 推荐(0)

Java for LeetCode 135 Candy

摘要： There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following req... 阅读全文

posted @ 2015-06-03 12:02 TonyLuis 阅读(246) 评论(0) 推荐(0)

2015年6月2日

Java for LeetCode 134 Gas Station

摘要： There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs... 阅读全文

posted @ 2015-06-02 10:44 TonyLuis 阅读(243) 评论(0) 推荐(0)

Java for LeetCode 133 Clone Graph

摘要： Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled u... 阅读全文

posted @ 2015-06-02 10:41 TonyLuis 阅读(612) 评论(0) 推荐(0)

2015年6月1日

Java for LeetCode 132 Palindrome Partitioning II

摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ... 阅读全文

posted @ 2015-06-01 20:51 TonyLuis 阅读(217) 评论(0) 推荐(0)

Java for LeetCode 131 Palindrome Partitioning

摘要： Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example,... 阅读全文

posted @ 2015-06-01 18:18 TonyLuis 阅读(237) 评论(0) 推荐(0)

Java for LeetCode 130 Surrounded Regions

摘要： Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded ... 阅读全文

posted @ 2015-06-01 17:26 TonyLuis 阅读(290) 评论(0) 推荐(0)

2015年5月30日

Java for LeetCode 129 Sum Root to Leaf Numbers

摘要： Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which... 阅读全文

posted @ 2015-05-30 21:38 TonyLuis 阅读(272) 评论(0) 推荐(0)

公告