likernel

Given an input string, reverse the string word by word. 阅读全文…

Given a string, find the length of the longest substring without repeating characters. 阅读全文…

主要介绍django的工作原理，其中涉及到Middleware(中间件，包括request, view, exception, response)，URLConf(url映射关系)，Template(模板系统)。 阅读全文…

什么是二叉搜索树二叉搜索树，顾名思义，其主要目的用于搜索，它是二叉树结构中最基本的一种数据结构。 阅读全文…

A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum. In many proble... 阅读全文…

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted from left to right. The first integer of each ro... 阅读全文…

Dijkstra’s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijks... 阅读全文…

之前做过一些django项目，但是在那之前没有系统的学过，路子比较野。最近闲下来，觉得很有必要重新系统的学习一下django，这是开篇。 阅读全文…

Python可以使用MySQLdb进行数据库操作，但是每次连接MySQL数据库请求时，都是独立的去请求访问，相当浪费资源，而且访问数量达到一定数量时，对mysql的性能会产生较大的影响。实际使用中，通常会使用数据库的连接池来访问数据库达到资源复用的目的。这里介绍一下在django中如何实现数据库连接池。 阅读全文…

Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a ‘sear... 阅读全文…