感谢您能看到这段文字~

我想那无数个日夜支撑我继续分享知识的动力来源于你们的支持和鼓励,其实网站大多数访问量都来源于百度搜索到我的某篇文章、看完后就不再记得我……更别说给予任何资金支持了……虽然访问量很高……能看到我的主页About或是置顶文章的更是寥寥无几……感谢您的深度关注,才能得以看到这段文字。我在维护blog上面花费了太多的时间、精力和资金,如果您觉得本站对您真的很有帮助的话请打赏,我会真的很开心的~ // 入不敷出的女大学生QAQ   #听说日行一善PAT能考100哦~#
当然如果是学弟学妹(大神勿扰嘤嘤嘤……)可以在知乎向我私密咨询提问各种问题hhhhhhha(感觉自己知道的还蛮多的233333我知道的一定尽全力回答!~)// 点击左侧About页面有知乎二维码…QAQ

在Windows上安装Python

  • https://www.python.org/downloads/ 上下载Python的安装包
  • 打开安装包进行安装,确保安装了 pip  并且 Python 添加到了你的 PATH
  • 开始菜单 -> 所有程序 -> Python -> IDLE编辑和运行Python代码~

Mac OSX上安装Python的方法

使用Homebrew安装python

  • 如果没有安装Homebrew,先安装Homebrew   /usr/bin/ruby -e "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/master/install)”
  • 安装完Homebrew之后,通过 brew help 检验是否安装完成
  • 输入 brew install python 安装Python 2;或 brew install python3 安装Python 3
  • python 或者 python3 进入Python Shell。使用 control + D 退出shell

使用程序包安装

  • https://www.python.org/downloads/ 下载安装包
  • Finder -> Applications -> python -> IDLE.app中编辑和运行Python代码

http状态码

200系列:OK
300系列:重定向
  • 301 永久移动
  • 302,303,307 临时重定向
  • 304  未被修改
400系列:客户端错误
  • 400 错误的请求
  • 401 未授权
  • 403 被禁止
  • 404 未找到
  • 407 需要代理授权
  • 408 请求超时
  • 409 发生冲突
  • 410 已删除
  • 426 需要升级
500系列:服务器错误
  • 502 无效的网关
  • 503 服务暂时不可用
  • 504 网关超时

LeetCode 553. Optimal Division

Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4.

However, you can add any number of parenthesis at any position to change the priority of operations. You should find out how to add parenthesis to get the maximum result, and return the corresponding expression in string format. Your expression should NOT contain redundant parenthesis.

Example:
Input: [1000,100,10,2]
Output: “1000/(100/10/2)”
Explanation:
1000/(100/10/2) = 1000/((100/10)/2) = 200
However, the bold parenthesis in “1000/((100/10)/2)” are redundant,
since they don’t influence the operation priority. So you should return “1000/(100/10/2)”.

Other cases:
1000/(100/10)/2 = 50
1000/(100/(10/2)) = 50
1000/100/10/2 = 0.5
1000/100/(10/2) = 2
Note:

The length of the input array is [1, 10].
Elements in the given array will be in range [2, 1000].
There is only one optimal division for each test case.

题目大意:给定一个正整数列表,相邻的整数将执行浮点除法。 例如[2,3,4] – > 2/3/4。但是,您可以在任何位置添加任意数量的括号以更改操作的优先级。您应该找到如何添加括号以获得最大结果,并以字符串格式返回相应的表达式,你的表达不应该包含多余的括号。
分析:要想得到最大的结果,只要使除数尽可能大,被除数尽可能小。被除过的数一定会变得更小,所以括号加在第一个数后面,括号内的数按从前到后顺序(不用添加冗余的括号)即可~

 

LeetCode 647. Palindromic Substrings

Given a string, your task is to count how many palindromic substrings in this string.

The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.

Example 1:
Input: “abc”
Output: 3
Explanation: Three palindromic strings: “a”, “b”, “c”.
Example 2:
Input: “aaa”
Output: 6
Explanation: Six palindromic strings: “a”, “a”, “a”, “aa”, “aa”, “aaa”.
Note:
The input string length won’t exceed 1000.

题目大意:给定一个字符串,计算这个字符串中有多少回文子串。(具有不同start下标或end下标的子字符串即使包含相同的字符也会被计为不同的子字符串。)
分析:对于s[i]来说,检测s[i-j]==s[i+j]是否成立,每一次相等就ans++、检测s[i-j-1]==s[i+j]是否成立,每次成立就ans++,最后返回ans的值~

 

LeetCode 547. Friend Circles

There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A is an indirect friend of C. And we defined a friend circle is a group of students who are direct or indirect friends.

Given a N*N matrix M representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are direct friends with each other, otherwise not. And you have to output the total number of friend circles among all the students.

Example 1:
Input:
[[1,1,0],
[1,1,0],
[0,0,1]]
Output: 2
Explanation:The 0th and 1st students are direct friends, so they are in a friend circle.
The 2nd student himself is in a friend circle. So return 2.
Example 2:
Input:
[[1,1,0],
[1,1,1],
[0,1,1]]
Output: 1
Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends,
so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1.
Note:
N is in range [1,200].
M[i][i] = 1 for all students.
If M[i][j] = 1, then M[j][i] = 1.

题目大意:班上有N个学生。 有些是朋友,有些则不是。 他们的友谊本质上是传递性的。 例如,如果A是B的直接朋友,B是C的直接朋友,那么A是C的间接朋友。我们定义了一个朋友圈是一群直接或间接的朋友。给定N * N矩阵M代表班级中学生之间的朋友关系。 如果M[i][j] = 1,那么第i和第j个学生是彼此直接的朋友,否则不是,输出所有学生中的朋友圈的总数
分析:用并查集,cnt一开始为n,每个人的父亲也都是自己,将每一对朋友的父亲结点找到,如果他们的父亲结点不是同一个,那么就合并为一个集合,并将cnt-1,最后输出cnt