IIS 7.5 以下版本 配置多域名同ip SSL 网站
IIS 7.5 以下版本不支持多域名共用443端口 SSL 服务，采用nginx 单独处理来自443端口的请求，从而实现多域名 SSL。
#user nobody;
worker_processes 12;
#error_log logs/error.log;
#error_log logs/error.log notice;
#error_log logs/erro...
iis http ->https,添加例外
版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/iiiiiiiiiiii9/article/details/82784740
PHPCMS 核心代码与 www 分离部署
在PHPCMS中，核心代码以及模板文件都在网站程序的phpcms目录中，为了网站的安全，可以考虑把phpcms目录转移到其他路径下，而不是默认的根目录中，如何操作呢？
先看下默认的目录结构：
默认状态下，phpcms目录就在根目录，一般情况下网站都放在www或者wwwroot目录中，我们可以考虑把phpcms目录移动至于www平级的目录中，如图：
因为我们的域名是解析到www目录的，...
LeetCode算法系列：69. Sqrt(x)
目录
题目描述：
算法实现
他山之石：
题目描述：
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 integer, the dec...
LeetCode算法系列：70. Climbing Stairs
题目描述
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n will be a po...
LeetCode算法系列：71. Simplify Path
目录
题目描述
算法实现
关于字符串分割
题目描述
Given an absolute path for a file (Unix-style), simplify it.
For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"path = "/a/../../b/../c//...
LeetCode算法系列：72. Edit Distance
题目描述；
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
You have the following 3 operations permitted on a word:
Insert a character
Delete ...
LeetCode算法系列：74. Search a 2D Matrix
题目描述：
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 e...
LeetCode算法系列：73. Set Matrix Zeroes
题目描述：
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.
Example 1:
Input:
[
[1,1,1],
[1,0,1],
[1,1,1]
]
Output:
[
[1,0,1],
[0,0,0],
[1,0,1...
LeetCode算法系列：75. Sort Colors
题目描述：
Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
Here, we will use...
LeetCode算法系列：76. Minimum Window Substring
题目描述：
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:
Input: S = "ADOBECODEBANC", T = "ABC"
Output: "BANC"
N...
LeetCode算法系列：77. Combinations
题目描述：
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
Example:
Input: n = 4, k = 2
Output:
[
[2,4],
[3,4],
[2,3],
[1,2],
[1,3],
[1,4],
]
算法实现...
LeetCode算法系列：78. Subsets
题目描述：
Given a set of distinct integers, nums, return all possible subsets (the power set).
Note: The solution set must not contain duplicate subsets.
Example:
Input: nums = [1,2,3]
Output:
[
[3...
LeetCode算法系列：79. Word Search
题目描述：
Given a 2D board and a word, find if the word exists in the grid.
The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or verti...
LeetCode算法系列： 80. Remove Duplicates from Sorted Array II
题目描述：
Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.
Do not allocate extra space for another array, you must do this...
LeetCode算法系列：81. Search in Rotated Sorted Array II
题目描述：
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]).
You are given a target value to search. If...
LeetCode算法系列：82. Remove Duplicates from Sorted List II
题目描述：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
Example 1:
Input: 1->2->3->3->4->4->5
Output...
LeetCode算法系列：83. Remove Duplicates from Sorted List
题目描述：
Given a sorted linked list, delete all duplicates such that each element appear only once.
Example 1:
Input: 1->1->2
Output: 1->2
Example 2:
Input: 1->1->2->3->3
Outp...
LeetCode算法系列：84. Largest Rectangle in Histogram
题目描述
The largest rectangle is shown in the shaded area, which has area = 10 unit.
Example:
Input: [2,1,5,6,2,3]
Output: 10
算法实现：
关键在于思路，具体实现并不难。
首先考虑到如果是一个顺序排列，问题会比较简单，如2，3，4，5只需要比较2*4，3*3，...
今日推荐
周排行