Posts by Tag

algorithm

LeetCode 85. Maximal Rectangle

6 minute read

This problem is a very hard problem, and I spend a lot of time to understand it. Im afraid someday may forgot the solution, so decide to record it.

Backtracking

13 minute read

A backtracking algorithm tries to build a solution to a computational problem incrementally.Whenever the algorithm needs to decide between multiple alternati...

Record A Tree Algorithm

11 minute read

In computer science, a binary tree is type of data structure, in which each node has at most two children, and it is also a very common testing centre in pos...

Dynamic Programming Summarize

11 minute read

Dynamic programming algorithms is a way to break down the problem into smaller and simpler pieces, that is we wish to find a solustion to given problem which...

Back to top ↑

leetcode

LeetCode 85. Maximal Rectangle

6 minute read

This problem is a very hard problem, and I spend a lot of time to understand it. Im afraid someday may forgot the solution, so decide to record it.

Backtracking

13 minute read

A backtracking algorithm tries to build a solution to a computational problem incrementally.Whenever the algorithm needs to decide between multiple alternati...

Record A Tree Algorithm

11 minute read

In computer science, a binary tree is type of data structure, in which each node has at most two children, and it is also a very common testing centre in pos...

Back to top ↑

backtracking

Backtracking

13 minute read

A backtracking algorithm tries to build a solution to a computational problem incrementally.Whenever the algorithm needs to decide between multiple alternati...

Back to top ↑

principles of computer composition

Back to top ↑

postgraduate

Back to top ↑

major408

Back to top ↑

Frontend

Infinite Scroll

15 minute read

Infinite scrollers pop up all over the internet. Google Music’s artist list is one, Facebook’s timeline is one and Twitter’s live feed is one as well. You sc...

Back to top ↑

Dom

Infinite Scroll

15 minute read

Infinite scrollers pop up all over the internet. Google Music’s artist list is one, Facebook’s timeline is one and Twitter’s live feed is one as well. You sc...

Back to top ↑

google

Infinite Scroll

15 minute read

Infinite scrollers pop up all over the internet. Google Music’s artist list is one, Facebook’s timeline is one and Twitter’s live feed is one as well. You sc...

Back to top ↑

medium

Infinite Scroll

15 minute read

Infinite scrollers pop up all over the internet. Google Music’s artist list is one, Facebook’s timeline is one and Twitter’s live feed is one as well. You sc...

Back to top ↑

machine learning

【译】深度学习前言

19 minute read

开始阅读Ian Goodfellow、Yoshua Bengio、Aaron Courville三位大佬写的deep learning book,这次不能烂尾了,决定每天花3-4个小时阅读英文原版,再用周末的时间把看过的部分理解并翻译一下,争取12月份之前完成整本书。

Back to top ↑

deep learning

【译】深度学习前言

19 minute read

开始阅读Ian Goodfellow、Yoshua Bengio、Aaron Courville三位大佬写的deep learning book,这次不能烂尾了,决定每天花3-4个小时阅读英文原版,再用周末的时间把看过的部分理解并翻译一下,争取12月份之前完成整本书。

Back to top ↑

工作

前端面试题总结

71 minute read

总结一下面试题,考研考不上了吧55555555555,开始准备前端春招了,争取到了头条白金码,加油吧

再见,美团

1 minute read

转眼间,两个月的美团实习就要结束了,即将在这周日离开北京,回武汉;用浩哥的话讲,暂别美团,用哲哥的话讲,继续深造:joy:;可能真的不会再回美团了,想着真的有点舍不得。

Back to top ↑

dynamic problem

LeetCode 85. Maximal Rectangle

6 minute read

This problem is a very hard problem, and I spend a lot of time to understand it. Im afraid someday may forgot the solution, so decide to record it.

Back to top ↑

hello world

Hello world

2 minute read

This is my first page in this blog, and I will try to write in English in this blog.

Back to top ↑

startup

Hello world

2 minute read

This is my first page in this blog, and I will try to write in English in this blog.

Back to top ↑

dynamic programming

Dynamic Programming Summarize

11 minute read

Dynamic programming algorithms is a way to break down the problem into smaller and simpler pieces, that is we wish to find a solustion to given problem which...

Back to top ↑

binary-tree

Record A Tree Algorithm

11 minute read

In computer science, a binary tree is type of data structure, in which each node has at most two children, and it is also a very common testing centre in pos...

Back to top ↑

math

Back to top ↑

recurrent problems

Back to top ↑

the tower of hanoi

Back to top ↑

lines in the plane

Back to top ↑

the josephus problem

Back to top ↑

applied math

Back to top ↑

实习

再见,美团

1 minute read

转眼间,两个月的美团实习就要结束了,即将在这周日离开北京,回武汉;用浩哥的话讲,暂别美团,用哲哥的话讲,继续深造:joy:;可能真的不会再回美团了,想着真的有点舍不得。

Back to top ↑

listNode

Back to top ↑

reverse

Back to top ↑

pointer

Back to top ↑

前端

前端面试题总结

71 minute read

总结一下面试题,考研考不上了吧55555555555,开始准备前端春招了,争取到了头条白金码,加油吧

Back to top ↑

MacBook

2018年十大···

3 minute read

2018年真如白驹过隙啊,这一年似乎是记事以来最饱满的一年了,那么用我心中的年度十大记录一下。 盘点 1. 年度最佳成就:没有挂科 真是不容易,今年第一次,不用担心补考,平均成绩还一下提升了10多分(毕竟基数小hhh)

Back to top ↑

tech

2018年十大···

3 minute read

2018年真如白驹过隙啊,这一年似乎是记事以来最饱满的一年了,那么用我心中的年度十大记录一下。 盘点 1. 年度最佳成就:没有挂科 真是不容易,今年第一次,不用担心补考,平均成绩还一下提升了10多分(毕竟基数小hhh)

Back to top ↑

机器学习

Back to top ↑

毕业设计

Back to top ↑

周志华

Back to top ↑