Cse-30872大三课程，解决不同数据结构的常见逻辑问题，不需要文档，因为我们正在解决给定的问题，并在圣母院的自定义Redhat Linux服务器上运行检查脚本-下面的网站显示了所有作业描述（课程中获得的a级）
Cse-30872 Junior year course that tackled common logical problems with different data structures, documentation was not needed as we were solving given problems and running a check script on Notre Dame s custom Redhat Linux servers - the website below shows all the assignment descriptions (grade of A earned in course) (2023-10-31, Python, 0KB, 下载0次)
几年来，我一直是一名有竞争力的编码器，并且对数据结构和算法有很好的掌握。我为我的实现维护GitHub存储库。这个报告包含了我发现对提高我的数据结构和算法概念非常有用的所有编码问题。自6月以来，我一直在不断将我的解决方案添加到此回购中...
I ve been a competitive coder for a couple of years, and have a good grasp on Data Structures and Algorithms. I maintain a GitHub repository for my implementations. This repo contains all the coding question that I find very useful to boost my concept of data structure & Algorithm. I have been constantly adding my solution to this repo since (2023-04-22, Python, 0KB, 下载0次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-06-图2 Saving James Bond - Easy Version
编译器-python2
This time let us consider the situation in the movie Live and Let Die in which James Bond, the world s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land at the center of a lake filled with crocodiles. There he performed the most daring action to escape he jumped onto the head of the nearest crocodile! Before the animal realized what was happening, James jumped again onto the next big head... Finally he reached the bank before the last crocodile could bite him (actually the stunt man was caught by the big mouth and barely escaped with his extra thick boot). (2016-04-12, Python, 1KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-06-图1 列出连通集
给定一个有NNN个顶点和EEE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。
编译器：python2
Given a free E N vertices and edges of the graph, please list the set of all of its communication with the DFS and BFS. Assume that the vertices 0 to N-1N-1N-1 number. When you search, we always assume the smallest number of vertices in ascending numerical order adjacent access points. (2016-04-12, Python, 1KB, 下载4次)