• Home

  • Tags

  • Categories

  • Archives

服务计算 - 5 Go语言net/http源码解读

Posted on 2018-11-16 | In 服务计算
Words count in article: 2.7k | Reading time ≈ 13
背景要提net/http标准库可以分为客户端和服务器两个部分。以下是net/http标准库的各个组成部分的关于客户端和服务端的一个划分: 图片来源 - 《Go Web编程》 如何开始阅读源码,首先我们需要了解一下http包的执行流程: 主要步骤: 创建Listen Socket, 监听指定的端 ...
Read more »

134. Gas Station

Posted on 2018-11-15 | In 算法 | leetcode
Words count in article: 613 | Reading time ≈ 3
题目There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it co ...
Read more »

210. Course Schedule II

Posted on 2018-11-15 | In 算法 | leetcode
Words count in article: 738 | Reading time ≈ 3
题目There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have t ...
Read more »

785. Is Graph Bipartite?

Posted on 2018-11-14 | In 算法 | leetcode
Words count in article: 596 | Reading time ≈ 3
题目Given an undirected graph, return true if and only if it is bipartite. Recall that a graph is bipartite if we can split it’s set of nodes into two i ...
Read more »

207. Course Schedule

Posted on 2018-11-14 | In 算法 | leetcode
Words count in article: 1.6k | Reading time ≈ 7
题目There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have t ...
Read more »

332. Reconstruct Itinerary

Posted on 2018-11-13 | In 算法 | leetcode
Words count in article: 742 | Reading time ≈ 3
题目Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the ti ...
Read more »

310. Minimum Height Trees

Posted on 2018-11-13 | In 算法 | leetcode
Words count in article: 1.3k | Reading time ≈ 6
题目 For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible ro ...
Read more »

64. Minimum Path Sum

Posted on 2018-11-12
Words count in article: 305 | Reading time ≈ 1
题目 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 pat ...
Read more »

50. Pow(x, n)

Posted on 2018-11-12 | In 算法 | leetcode
Words count in article: 398 | Reading time ≈ 2
题目Implement pow(x, n), which calculates x raised to the power n (xn). Example 1: 12Input: 2.00000, 10Output: 1024.00000 Example 2: 12Input: 2.10000 ...
Read more »

22. Generate Parentheses

Posted on 2018-11-11 | In 算法 | leetcode
Words count in article: 315 | Reading time ≈ 1
题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is: ...
Read more »
<i class="fa fa-angle-left"></i>1…4567<i class="fa fa-angle-right"></i>

65 posts
14 categories
19 tags
RSS
GitHub
© 2023 liuyt49
Powered by Hexo
|
Theme — NexT.Mist v5.1.4
访问人数 访问总量 次