joannae - 博客园

Cookie、Session和Token

摘要：一、COOKIE：在网站中，http请求是无状态的。也就是说即使第一次和服务器连接后并且登录成功后，第二次请求服务器依然不能知道当前请求是哪个用户。cookie的出现就是为了解决这个问题，第一次登录后服务器返回一些数据（cookie）给浏览器，然后浏览器保存在本地，当该用户发送第二次请求的时候，就阅读全文

posted @ 2019-07-16 18:01 joannae 阅读(271) 评论(0) 推荐(0) 编辑

87. Scramble String (Java)

摘要： Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively. Below is one possible representati 阅读全文

posted @ 2019-07-04 19:37 joannae 阅读(161) 评论(0) 推荐(0) 编辑

51. N-Queens (JAVA)

摘要： The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all 阅读全文

posted @ 2019-06-28 21:04 joannae 阅读(240) 评论(0) 推荐(0) 编辑

85. Maximal Rectangle (JAVA)

摘要： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文

posted @ 2019-05-30 15:35 joannae 阅读(192) 评论(0) 推荐(0) 编辑

84. Largest Rectangle in Histogram (JAVA)

摘要： Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the hist 阅读全文

posted @ 2019-05-28 17:33 joannae 阅读(142) 评论(0) 推荐(0) 编辑

81. Search in Rotated Sorted Array II (JAVA)

摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]). Y 阅读全文

posted @ 2019-05-28 11:19 joannae 阅读(112) 评论(0) 推荐(0) 编辑

77. Combinations (JAVA)

摘要： Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k = 2, a solution is: 带回溯的递归。（带回溯没法阅读全文

posted @ 2019-05-27 10:55 joannae 阅读(126) 评论(0) 推荐(0) 编辑

76. Minimum Window Substring (JAVA)

摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). Example: Note: If there i 阅读全文

posted @ 2019-05-24 18:33 joannae 阅读(263) 评论(0) 推荐(0) 编辑

72. Edit Distance (JAVA)

摘要： Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2. You have the following 3 operations permitt 阅读全文

posted @ 2019-05-23 18:02 joannae 阅读(180) 评论(0) 推荐(0) 编辑

69. Sqrt(x) (JAVA)

摘要： Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an in 阅读全文

posted @ 2019-05-23 15:08 joannae 阅读(167) 评论(0) 推荐(0) 编辑