# [置顶] 自己创建一个Rest API

2015.10 大三上 面向web的计算课程 在大三上的课程中，海涛老师要求项目中运用rest进行数据采集。我两眼懵逼，啥是rest呀？然后就去网上找了学习资料。然后之后就着手开始自己写一个rest api。为什么要自己写呢？因为我没用框架，第一次使用php做网站，我想先打好基础再考虑高层次的东西，就没有用框架。其他人用的诸如laravel之类的PHP框架自己本身会带rest机制。对于我一个没用...

# Weekly Contest 72 leetcode 786. K-th Smallest Prime Fraction

A sorted list A contains 1, plus some number of primes.  Then, for every p < q in the list, we consider the fraction p/q. What is the K-th smallest fraction considered?  Return your answer as an ...

# Weekly Contest 72 leetcode 787. Cheapest Flights Within K Stops

There are n cities connected by m flights. Each fight starts from city u and arrives at v with a price w. Now given all the cities and fights, together with starting city src and the destinatio...

# Weekly Contest 72 leetcode 785. Is Graph Bipartite?

Given a 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 independent subsets A and B such that every edge in the grap...

# Weekly Contest 72 leetcode 784. Letter Case Permutation

Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string.  Return a list of all possible strings we could create. Examples: Input: S = "a1b2"...

# Weekly Contest 71 leetcode 782. Transform to Chessboard

An N x N board contains only 0s and 1s. In each move, you can swap any 2 rows with each other, or any 2 columns with each other. What is the minimum number of moves to transform the board into...

# Weekly Contest 71 leetcode 780. Reaching Points

A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y). Given a starting point (sx, sy) and a target point (tx, ty), return True if and only if a sequence o...

# Weekly Contest 71 leetcode 781. Rabbits in Forest

In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them(告诉你 有多少只其他兔子跟它颜色一样). Those answers are placed in an...

# Weekly Contest 71 leetcode 783. Minimum Distance Between BST Nodes

Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree. Example : Input: root = [4,2,6,1,3,null,null] O...

# leetcode 54. Spiral Matrix

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order. For example, Given the following matrix: [ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] You...

# Weekly Contest 70 leetcode 778. Swim in Rising Water

On an N x N grid, each square grid[i][j] represents the elevation(高度) at that point (i,j).Now rain starts to fall. At time t, the depth of the water everywhere is t. You can swim from a square to anot......

# Weekly Contest 70 leetcode 777. Swap Adjacent in LR String

In a string composed of 'L', 'R', and 'X' characters, like "RXXLRXRXL", a move consists of either replacing one occurrence of "XL" with "LX", or replacing one occurrence of "RX" with "XR". Giv...

# Weekly Contest 70 leetcode 779. K-th Symbol in Grammar

On the first row, we write a 0. Now in every subsequent row, we look at the previous row and replace each occurrence of 0 with 01, and each occurrence of 1 with 10. Given row N and index K, r...

# 算法-求二进制数中1的个数

410条 共28页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：279072次
• 积分：5856
• 等级：
• 排名：第5225名
• 原创：338篇
• 转载：71篇
• 译文：1篇
• 评论：37条
博客专栏
 leetcode 文章：234篇 阅读：44298
文章分类