璨璨要好好学习

2017年3月6日

摘要： Given a 2D grid, each cell is either a wall 2, an house 1or empty 0 (the number zero, one, two), find a place to build a post office so that the sum o 阅读全文

posted @ 2017-03-06 05:38 璨璨要好好学习阅读(891) 评论(0) 推荐(0) 编辑

Binary Tree Serialisation Lintcode

摘要： Design an algorithm and write code to serialize and deserialize a binary tree. Writing the tree to a file is called 'serialization' and reading back f 阅读全文

posted @ 2017-03-06 04:10 璨璨要好好学习阅读(139) 评论(0) 推荐(0) 编辑

2017年3月5日

Zombie in Matrix Lintcode

摘要： Given a 2D grid, each cell is either a wall 2, a zombie 1or people 0 (the number zero, one, two).Zombies can turn the nearest people(up/down/left/righ 阅读全文

posted @ 2017-03-05 13:44 璨璨要好好学习阅读(1047) 评论(0) 推荐(0) 编辑

Knight Shortest Path Lintcode

摘要： Given a knight in a chessboard (a binary matrix with 0 as empty and 1 as barrier) with a source position, find the shortest path to a destinationposit 阅读全文

posted @ 2017-03-05 12:57 璨璨要好好学习阅读(467) 评论(0) 推荐(0) 编辑

Search Graph Nodes Lintcode

摘要： Given a undirected graph, a node and a target, return the nearest node to given node which value of it is target, return NULL if you can't find. There 阅读全文

posted @ 2017-03-05 07:12 璨璨要好好学习阅读(821) 评论(0) 推荐(0) 编辑

Bomb Enemy Leetcode

摘要： Given a 2D grid, each cell is either a wall 'W', an enemy 'E' or empty '0' (the number zero), return the maximum enemies you can kill using one bomb.T 阅读全文

posted @ 2017-03-05 06:05 璨璨要好好学习阅读(164) 评论(0) 推荐(0) 编辑

2017年3月3日

Word Break Leetcode

摘要：要注意因为数组长度是长一个的，所以最外层要有等号。未完待续。。。阅读全文

posted @ 2017-03-03 03:34 璨璨要好好学习阅读(88) 评论(0) 推荐(0) 编辑

Alien Dictionary Leetcode

摘要：未完待续阅读全文

posted @ 2017-03-03 03:33 璨璨要好好学习阅读(129) 评论(0) 推荐(0) 编辑

2017年3月2日

Unique Paths Leetcode

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

posted @ 2017-03-02 04:37 璨璨要好好学习阅读(111) 评论(0) 推荐(0) 编辑

2017年3月1日

Minimum Path Sum Leetcode

摘要： 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. 阅读全文

posted @ 2017-03-01 09:31 璨璨要好好学习阅读(108) 评论(0) 推荐(0) 编辑

璨璨要好好学习

公告