leetcode
文章平均质量分 63
cfp008
念念不忘,必有回响...
展开
-
Minimum Depth of Binary Tree
//Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.//求二叉树的最小深度,与求最大深度非常类似,但需要增加左右子树的判断,原创 2017-05-15 21:59:10 · 167 阅读 · 0 评论 -
word-break
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens ="leetcode",dict =["leet",原创 2017-08-16 23:03:24 · 215 阅读 · 0 评论 -
linked-list-cycle-ii
Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using extra space? public class LinkedListCycle { //节点数据结构 static class ListNode {原创 2017-07-30 19:41:38 · 197 阅读 · 0 评论 -
linked-list-cycle
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space? 思路: 1)使用快慢指针方法,判定是否存在环,并记录两指针相遇位置(Z);原创 2017-07-17 22:17:09 · 186 阅读 · 0 评论 -
二叉树的后序遍历BTPostorderTraversal
/* * 后序遍历二叉树 * 核心思想是用栈做辅助空间,先从根节点往左一直入栈,直到为空,然后判断栈顶元素的右孩子, * 如果为空或被访问过,说明此时栈顶为要访问的节点,出栈然后访问即可; * 否则从它开始重复左孩子入栈的过程,接下来再判断栈顶元素的右孩子...直到栈空。 */public class BTPostorderTraversal { static原创 2017-06-11 21:07:43 · 249 阅读 · 0 评论 -
reorder-list
Given a singly linked list L: L 0→L 1→…→Ln-1→L n,reorder it to: L 0→L n →L1→L n-1→L 2→Ln-2→… You must do this in-place without altering the nodes' values. For example,Given{1,2,3,4}, reo原创 2017-06-30 23:29:07 · 192 阅读 · 0 评论 -
二叉树的先序遍历BTPreorderTraversal
public class BTPreorderTraversal { //节点数据结构 static class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) {原创 2017-06-20 22:28:27 · 350 阅读 · 0 评论 -
insertion-sort-list
//Sort a linked list using insertion sort//单链表的插入排序/** * Definition for singly-linked list. * public class ListNode *{ * int val; * ListNode next; * ListNode(int x) {原创 2017-06-06 20:50:47 · 168 阅读 · 0 评论 -
sorl-list
/** * 单链表的排序 * 归并排序的基本思想:找到链表的中间节点,然后递归对前半部分和后半部分分别进行归并排序,最后对两个以排好序的链表进行合并 * @author cfp008 * */public class SortList { class ListNode { int val; ListNode nex原创 2017-05-20 16:40:18 · 244 阅读 · 0 评论 -
max-points-on-a-line
//Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.class Point { int x; int y; Point() { x = 0; y = 0; } Point(int a, int b)原创 2017-05-17 21:58:49 · 228 阅读 · 0 评论 -
evaluate-reverse-polish-notation
Evaluate the value of an arithmetic expression inReverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another expression.Some examples:["2", "1", "+", "3", "原创 2017-05-15 22:12:07 · 172 阅读 · 0 评论 -
wordBreak-ii
Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences. For example, givens ="ca原创 2017-08-20 19:10:49 · 327 阅读 · 0 评论