2019年3月14日
跳跃问题
摘要： Jump Game The Problem Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array 阅读全文
posted @ 2019-03-14 13:51 Archer-Fang 阅读(318) 评论(0) 推荐(0)
图的DFS。。类似树的DFS
摘要： Depth-First Search (DFS) Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (s 阅读全文
posted @ 2019-03-14 12:40 Archer-Fang 阅读(137) 评论(0) 推荐(0)
树的DFS
摘要： Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary n 阅读全文
posted @ 2019-03-14 11:32 Archer-Fang 阅读(146) 评论(0) 推荐(0)
归并算法实现
摘要： A recursive merge sort algorithm used to sort an array of 7 integer values. These are the steps a human would take to emulate merge sort (top-down). C 阅读全文
posted @ 2019-03-14 10:53 Archer-Fang 阅读(313) 评论(0) 推荐(0)