lacker - 博客园

2017年11月22日

摘要： ``` / Source : https://oj.leetcode.com/problems/gas station/ There are N gas stations along a circular route, where the amount of gas at station i is 阅读全文

posted @ 2017-11-22 08:19 lacker 阅读(133) 评论(0) 推荐(0) 编辑

leetcode — clone-graph

摘要： ``` import java.util.*; /** * Source : https://oj.leetcode.com/problems/clone-graph/ * * * Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. * * OJ... 阅读全文

posted @ 2017-11-22 08:18 lacker 阅读(164) 评论(0) 推荐(0) 编辑

2017年11月21日

leetcode — palindrome-partitioning-ii

摘要： ``` import java.util.Arrays; /** * * Source : https://oj.leetcode.com/problems/palindrome-partitioning-ii/ * * Given a string s, partition s such that every substring of the partition is a palind... 阅读全文

posted @ 2017-11-21 20:47 lacker 阅读(191) 评论(0) 推荐(0) 编辑

leetcode — palindrome-partitioning

摘要： ``` import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Source : https://oj.leetcode.com/problems/palindrome-partitioning/ * * * Given a string s, partition s such t... 阅读全文

posted @ 2017-11-21 20:47 lacker 阅读(111) 评论(0) 推荐(0) 编辑

leetcode — surrounded-regions

摘要： ``` import java.util.Arrays; import java.util.Stack; / Source : https://oj.leetcode.com/problems/surrounded regions/ Given a 2D board containing 'X' a 阅读全文

posted @ 2017-11-21 20:23 lacker 阅读(150) 评论(0) 推荐(0) 编辑

leetcode — sum-root-to-leaf-numbers

摘要： ``` import java.util.Stack; / Source : https://oj.leetcode.com/problems/sum root to leaf numbers/ Given a binary tree containing digits from 0 9 only, 阅读全文

posted @ 2017-11-21 08:30 lacker 阅读(185) 评论(0) 推荐(0) 编辑

leetcode — longest-consecutive-sequence

摘要： ``` import java.util.HashSet; import java.util.Set; / Source : https://oj.leetcode.com/problems/longest consecutive sequence/ Given an unsorted array 阅读全文

posted @ 2017-11-21 08:29 lacker 阅读(154) 评论(0) 推荐(0) 编辑

2017年11月20日

leetcode — word-ladder-ii

摘要： ``` import java.util.*; /** * Source : https://oj.leetcode.com/problems/word-ladder-ii/ * * * Given two words (start and end), and a dictionary, find all shortest transformation * sequence(s) fr... 阅读全文

posted @ 2017-11-20 08:27 lacker 阅读(150) 评论(0) 推荐(0) 编辑

leetcode — word-ladder

摘要： ``` import java.util. ; / Source : https://oj.leetcode.com/problems/word ladder/ Given two words (start and end), and a dictionary, find the length of 阅读全文

posted @ 2017-11-20 08:26 lacker 阅读(153) 评论(0) 推荐(0) 编辑

2017年11月17日

leetcode — valid-palindrome

摘要： ``` / Source : https://oj.leetcode.com/problems/valid palindrome/ Given a string, determine if it is a palindrome, considering only alphanumeric chara 阅读全文

posted @ 2017-11-17 09:00 lacker 阅读(128) 评论(0) 推荐(0) 编辑

lack

the quieter you become，the more you are able to hear

公告