输入url,返回该网页的源码
def getURL(url):
res = urllib.request.urlopen(url)
content = res.read().decode('utf-8')
return content
输入content源码,返回lists数据
def resolveHtml(content):
soup = BeautifulSoup(content, "html.parser")
divs = soup.find_all('div', {'class': 'list-main-warp'})
lis=divs[0].find_all('li')
lists=[]
for li in lis:
one=""
yuanxi_title=li.find_all('a')[0].string
yuanxi=yuanxi_title.split("\xa0\xa0")[0]
url=li.find_all('a')[0].get("href")
title=li.find_all('a')[0].get("title")
one=url+","+title+","+yuanxi
lists.append(one)
return lists
saveInfo:
输入:lists,filename
功能: 将lists中数据写入文件filename中
def saveInfo(lists,filename):
with open(filename,"w",encoding="utf-8") as fp:
for i in lists:
fp.write(i+"\n")
def main():
url = "https://www.hist.edu.cn/index/sy/xsbg.htm"
content=getURL(url)
lists=resolveHtml(content)
filename="xueyuandongtai.txt"
saveInfo(lists,filename)
if __name__ == "__main__":
main()
单个函数的时间复杂度内,算法代码的时间复杂度,接下来我们分析函数调用过程的时间复杂度
- 在main方法中,有一个for循环,循环体调用了show方法,由于方法内部只循环了一行代码,所以show方法的时间复杂度为O(1),那main方法的时间复杂度为O(n)
public static void main(String[] args) {
int n=100;
for (int i=0;i<n;i++) {
show(i);
}
}
private static void show(int i) {
System.out.println(i);
}
大O推导规则,去掉n保留最高阶的常数因子2,所以最终main方法的时间复杂度为O(n^2)
public static void main(string[] args) {
int n=100;
show(n);
for (int i=0;i<n;i++) {
show(i);
}
for (int i=0;i<n;i++) {
for (int j=0;j<n,j++) {
System.out.println(j);
}
}
}
private static void show(int i) {
for (int j=0;j<i;j++) {
System.out.println(i);
}
}