 If You are my legend

Problem Description
If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）.WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future.
The castle is so Complex, See the figure below:
The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below:
Input
Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer.Output
Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes.Sample Input
2 4
2 2 3 2
1 1 2 3Sample Output
************++****
***********/ /****
**********+++**
****++ / /+
/ /  ++ /
*+++  + 
**  /  / +
**  +++ /
**++   + 
/ /   / +
+++++ /
     +
    /***
+++++****
If You are my legend _course
20170522Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend 算法实现思想_course
20190922Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend 求解_course
20200101Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend 求正确解答_course
20200101Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend 怎么解答的_course
20191124Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend 是怎么编写的_course
20191207Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend 立方体的问题_course
20200801Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
If You are my legend询问代码的编写问题_course
20190828Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
字符和图形问题的结合，If You are my legend_course
20190908Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
Say love to you once again _course
20170923Problem Description Say love to you once againI remember that day, you're sitting in front of me. Obviously your wishes, waiting for my performance. I said some other day, when I have sufficient time , I would certainly give you a perfect declaration of love. I would like to seize every moment, I am afraid that the story is yesterday. I came to realize that neglect is the largest defect of me, but it was to late. I really want to say love to you once again. I am willing to give up everything only in exchange for you. If time can turn the clock back for you. I will hold your hands once again, say, I love you! It is an old legend. If you can solve this problem, god will give you a chance to say love to your darling once again, so, yifenfei, seize the chance. There are N plane in the sky, and every one can attack each other. Now, we assigned each has a number i (1 <= i <= N), plane i and plane j can produce Aij points of hurt. Your task is to divide N planes into two groups. Each group in itself don’t produce any point of hurt, but plane between two groups will produces hurt. Please maximize sum of all the hurt. Input For each case, first input a N(2 <= N <= 25), represent the number of planes in the sky, then a matrix A, (Aij = Aji, Aii = 0 for all i,j<= N), Aij represents the hurt between plane i and plane j. Output Output the largest hurt between two groups. Sample Input 3 0 150 20 150 0 140 20 140 0 Sample Output 290.
Say love to you once again_course
20170524Problem Description Say love to you once againI remember that day, you're sitting in front of me. Obviously your wishes, waiting for my performance. I said some other day, when I have sufficient time , I would certainly give you a perfect declaration of love. I would like to seize every moment, I am afraid that the story is yesterday. I came to realize that neglect is the largest defect of me, but it was to late. I really want to say love to you once again. I am willing to give up everything only in exchange for you. If time can turn the clock back for you. I will hold your hands once again, say, I love you! It is an old legend. If you can solve this problem, god will give you a chance to say love to your darling once again, so, yifenfei, seize the chance. There are N plane in the sky, and every one can attack each other. Now, we assigned each has a number i (1 <= i <= N), plane i and plane j can produce Aij points of hurt. Your task is to divide N planes into two groups. Each group in itself don’t produce any point of hurt, but plane between two groups will produces hurt. Please maximize sum of all the hurt. Input For each case, first input a N(2 <= N <= 25), represent the number of planes in the sky, then a matrix A, (Aij = Aji, Aii = 0 for all i,j<= N), Aij represents the hurt between plane i and plane j. Output Output the largest hurt between two groups. Sample Input 3 0 150 20 150 0 140 20 140 0 Sample Output 290.
Say love to you once again 怎么才能实现_course
20190922Problem Description Say love to you once againI remember that day, you're sitting in front of me. Obviously your wishes, waiting for my performance. I said some other day, when I have sufficient time , I would certainly give you a perfect declaration of love. I would like to seize every moment, I am afraid that the story is yesterday. I came to realize that neglect is the largest defect of me, but it was to late. I really want to say love to you once again. I am willing to give up everything only in exchange for you. If time can turn the clock back for you. I will hold your hands once again, say, I love you! It is an old legend. If you can solve this problem, god will give you a chance to say love to your darling once again, so, yifenfei, seize the chance. There are N plane in the sky, and every one can attack each other. Now, we assigned each has a number i (1 <= i <= N), plane i and plane j can produce Aij points of hurt. Your task is to divide N planes into two groups. Each group in itself don’t produce any point of hurt, but plane between two groups will produces hurt. Please maximize sum of all the hurt. Input For each case, first input a N(2 <= N <= 25), represent the number of planes in the sky, then a matrix A, (Aij = Aji, Aii = 0 for all i,j<= N), Aij represents the hurt between plane i and plane j. Output Output the largest hurt between two groups. Sample Input 3 0 150 20 150 0 140 20 140 0 Sample Output 290.
使用ascii画出正方体的问题，怎么使用C语言的程序的设计的形式来回答的，代码的实现_course
20190621Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
用字符构成的立体方块图的算法，怎么采用C程序的代码语言的编写的过程实现？_course
20190510Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
由字符串构成的一个立方体的图案的生成，怎么利用C程序语言代码编写的方式来进行的？_course
20190517Problem Description If you are my legendIf your are my legend, let it as long as the heaven and earth endure（Sky Long Earth Nine）. WhereIsHeroFrom loves a girl very much, we call her X Gu Niang. But today they can’t get together because they live in two different provinces and their distance is much farther. Now they want to build a castle for their future. The castle is so Complex, See the figure below: The castle surface is divided into N by M square cells. Some cubes are stacked one upon another over the cells, forming towers. For each cell the number of cubes stacked over it is given in the matrix A. Now, give A to you , please help them construct their castle, the unit cube represented as shown below: Input Input contains integers N , M, (1 <= N, M <= 30)followed by matrix A, rowbyrow. The first row describes the cube tower furthest from the viewer, left to right, and the last row  nearest to the viewer. Output Output must contain a string representation of the table view, with minimal number of lines required to show all cubes. Each line must contain a string of equal length, which is the minimal width required to show all cubes. Sample Input 2 4 2 2 3 2 1 1 2 3 Sample Output ************++**** ***********/ /**** **********+++** ****++ / /+ ***/ /  ++ / **+++  +  **  /  / + **  +++ / **++   +  */ /   / + +++++ /*      +**     /*** +++++****
Say love to you once again 的解法求助_course
20191117Problem Description Say love to you once againI remember that day, you're sitting in front of me. Obviously your wishes, waiting for my performance. I said some other day, when I have sufficient time , I would certainly give you a perfect declaration of love. I would like to seize every moment, I am afraid that the story is yesterday. I came to realize that neglect is the largest defect of me, but it was to late. I really want to say love to you once again. I am willing to give up everything only in exchange for you. If time can turn the clock back for you. I will hold your hands once again, say, I love you! It is an old legend. If you can solve this problem, god will give you a chance to say love to your darling once again, so, yifenfei, seize the chance. There are N plane in the sky, and every one can attack each other. Now, we assigned each has a number i (1 <= i <= N), plane i and plane j can produce Aij points of hurt. Your task is to divide N planes into two groups. Each group in itself don’t produce any point of hurt, but plane between two groups will produces hurt. Please maximize sum of all the hurt. Input For each case, first input a N(2 <= N <= 25), represent the number of planes in the sky, then a matrix A, (Aij = Aji, Aii = 0 for all i,j<= N), Aij represents the hurt between plane i and plane j. Output Output the largest hurt between two groups. Sample Input 3 0 150 20 150 0 140 20 140 0 Sample Output 290.
 11.19MB
Android支付宝支付demo
20181016快捷简洁的集成了安卓端支付宝支付demo只需三个参数，
21天通关Python（仅视频课）
20190521本页面购买不发书！！！仅为视频课购买！！！ 请务必到https://edu.csdn.net/bundled/detail/49下单购买课+书。 本页面，仅为观看视频页面，如需一并购买图书，请务必到https://edu.csdn.net/bundled/detail/49下单购买课程+图书！！！ 疯狂Python精讲课程覆盖《疯狂Python讲义》全书的主体内容。 内容包括Python基本数据类型、Python列表、元组和字典、流程控制、函数式编程、面向对象编程、文件读写、异常控制、数据库编程、并发编程与网络编程、数据可视化分析、Python爬虫等。 全套课程从Python基础开始介绍，逐步步入当前就业热点。将会带着大家从Python基础语法开始学习，为每个知识点都提供对应的代码实操、代码练习，逐步过渡到文件IO、数据库编程、并发编程、网络编程、数据分 析和网络爬虫等内容，本课程会从小案例起，至爬虫、数据分析案例终、以Python知识体系作为内在逻辑，以Python案例作为学习方式，最终达到“知行合一”。
 373KB
2020数学建模A题
202009112020数学建模国赛A题及其数据 2020数学建模国赛A题及其数据2020数学建模国赛A题及其数据 2020数学建模国赛A题及其数据 2020数学建模国赛A题及其数据 2020数学建模国赛A题及其数据
Java学习指南（Java入门与进阶）
20170809这是Java学习指南系列课程的第1篇，介绍Java语言的入门语法，引领希望学习Java语言编程的初学者进入Java大门。 本课程不需要其他语言作为基础，可以直接学习。 课程从Java开发平台的下载和安装开始，从浅到深、从易到难，循序渐进地进行语法讲解。 为了让学员更好的掌握Java语言，本课程配套在线的Java题库及答案解析。 相比于其他语言，Java语言更科学、更容易掌握，快来和大家一起学习Java吧。
 42KB
81个Python爬虫源代码
2018121381个Python爬虫源代码，内容包含新闻、视频、中介、招聘、图片资源等网站的爬虫资源
Google开发专家带你入门神经网络
20200609限时秒杀，先到先得！！！ 购买后添加“助手小姐姐”微信，还可有不定期直播活动和老师答疑哦！ 【授课老师】 彭靖田 Google Developer Experts。 曾为 TensorFlow Top 40 的贡献者，著书《深入理解TensorFlow》，是国内第一本深度剖析 Google AI 框架的畅销书。 曾从0到1深入参与了华为 2012 实验室深度学习平台和华为深度学习云服务的设计与研发工作。 【课程会讲哪些知识？】 整个课程以理论加实战为核心，通过从基础原理、代码案例带你手把手入门神经网络。下面是课程的知识概览思维导图。
 71.49MB
jboss4.2.3.GA
20190327此版本在其余地方已经下载不到了哟，但是这个版本还是很好的，jboss4.2.3.GA,此jboss支持jboss 4.x 开发，jdk需满足5.0及以上的版本，不然会运行出错的，需要的自行下载哈，无
 41.83MB
Python高级编程.pdf
20130801《Python高级编程》通过大量的实例，介绍了Python语言的最佳实践和敏捷开发方法，并涉及整个软件生命周期的高级主题，诸如持续集成、版本控制系统、包的发行和分发、开发模式、文档编写等。《Pytho
微信公众平台开发入门
20150106本套课程的设计完全是为初学者量身打造，课程内容由浅入深，课程讲解通俗易懂，代码实现简洁清晰。通过本课程的学习，学员能够入门微信公众平台开发，能够胜任企业级的订阅号、服务号、企业号的应用开发工作。 通过本课程的学习，学员能够对微信公众平台有一个清晰的、系统性的认识。例如，公众号是什么，它有什么特点，它能做什么，怎么开发公众号。 其次，通过本课程的学习，学员能够掌握微信公众平台开发的方法、技术和应用实现。例如，开发者文档怎么看，开发环境怎么搭建，基本的消息交互如何实现，常用的方法技巧有哪些，真实应用怎么开发。
 下载 不错的Javascript表格翻页效果
 下载 用C语言数组实现《贪吃蛇》大作战游戏
 下载 全国各省市和坐标信息mysql脚本
 博客 学习HTML的第一天
 学院 基于vue.js的uniapp家具家居商城APP（使用教程）
 学院 saprk大数据分析与实战zookeeper
 学院 AI工程师Python数据分析实战就业系列
 下载 在ASP.NET中使用Session常见问题集锦
 学院 Java+FFmpeg开发音视频流媒体直播等
 下载 js 事件小结 表格区别
 博客 JAVA学习日记:Math类和Random类
 学院 IDEA版Java小白入门课程
 学院 “重大活动”网络安全保障中的攻守实践
 博客 软件测试：面试题整理附答案，一点点小总结
 学院 Git使用详解
 博客 windows 创建虚拟网卡 修改MAC地址
 博客 还在用 if(obj != null)做非空判断？
 学院 重学Vue：Vue3.0全家桶入门到实战
 下载 基于Frp的内网穿透
 博客 gitee上传代码
 博客 #筛选法求100内素数#
 下载 手慢无！软件架构师精品课程，速度领取
 博客 Windows Server 2019 (updated Oct 2020)(x64) English
 学院 FFmpeg4.3开发系列之12：RTSP+Live555直播点播详解
 博客 vue全局组件初体验
 博客 公钥证书方式下如何使用HTTP方式调用支付宝接口
 学院 基于vue.js的uniapp鲜花礼品商城APP（使用教程）
 学院 Web安全攻防
 博客 #87 JetBrains GoLand 2020.1 新特性介绍
 博客 fputs函数详解