- 博客(72)
- 资源 (9)
- 收藏
- 关注
RSS订阅原创 项目复盘的目的和效果
什么是复盘？ 为什么要复盘？复盘是对一个已经完成的活动过程的完整回顾和梳理， 而且是带着对这个已完成的活动的一些观察、问题去进行的，通常是从活动结果的分析开始进行倒推。复盘的目的是通过对活动过程的完整回顾、梳理、讨论，从而形成对活动过程中的正确、错误的活动行为的本质模型认知，用逐步沉淀下来的有共识的认知模型指导下次活动过程，最终达到对活动过程的不断迭代优化。 同时能积累下可复用的各种活动...
2020-04-25 09:31:59
8762
转载 The Anatomy of a Large-Scale Hypertextual Web Search Engine
The Anatomy of a Large-Scale Hypertextual Web Search EngineSergey Brin and Lawrence Page{sergey, page}@cs.stanford.eduComputer Science Department, Stanford University, Stanford, CA 94305Ab
2014-10-05 11:14:55
4073
原创 Word Search
Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically n
2014-05-04 23:32:22
380
原创 Letter Combinations of a Phone Number
Letter Combinations of a Phone Number, leetcode
2014-04-27 17:35:31
822
原创 String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input case
2014-04-25 21:26:54
427
原创 Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.class Solution {public: int reverse(int x) {
2014-04-25 21:22:46
394
原创 Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For
2014-04-20 22:20:13
341
原创 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 of the list.
2014-04-05 13:49:56
396
原创 Scramble String
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.Below is one possible representation of s1 = "great": great / \ gr
2014-04-03 22:57:49
620
原创 Binary Tree Preorder Traversal
leetcode, Binary Tree Preorder Traversal , 两种非递归解法， Morris 遍历讲解
2014-03-29 23:25:29
564
原创 Flatten Binary Tree to Linked List
leetcode, 递归，二叉树， Flatten Binary Tree to Linked List
2014-03-29 00:21:16
667
原创 Longest Valid Parentheses
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", wh
2014-03-28 00:06:10
603
原创 Plus One
Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.用carri
2014-03-26 22:30:46
390
原创 Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example:Given the below binary tree and sum
2014-03-24 23:00:20
362
原创 3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c)
2014-03-22 12:05:51
410
原创 Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive solution is tr
2014-03-21 22:45:47
345
原创 Search in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return it
2014-03-21 22:33:34
359
原创 Reorder List
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reorder it to {1,4
2014-03-20 22:26:59
353
原创 Convert Sorted List to Binary Search Tree
leetcode, 递归， Convert Sorted List to Binary Search Tree 的两种解法
2014-03-19 23:29:53
581
原创 Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at a
2014-03-17 19:56:18
391
原创 Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partially filled sudo
2014-03-15 22:48:00
874
Concepts, Techniques, and Models of Computer Programming
2011-07-05
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人