![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 77
limwz
这个作者很懒,什么都没留下…
展开
-
简单实现dijstra算法和floyd算法并打印所有最短路径
#include #include #include #include #include #include #include using namespace std; typedef struct Edge{ int pos;//该边终点的下标 int weight; Edge* next; Edge(int p,int w):pos(p),weight(w),原创 2014-09-12 18:05:42 · 536 阅读 · 0 评论 -
简单实现BST以及简单工厂模式进行测试
#include #include #include #include #include using namespace std; typedef struct TreeNode{ int data; TreeNode* left; TreeNode* right; TreeNode(int t):data(t),left(NULL),right(NULL){}原创 2014-09-12 15:24:12 · 605 阅读 · 0 评论 -
leetcode之Intersection of Two Linked Lists
问题描述如下: Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1 → a2 ↘原创 2014-12-03 14:24:43 · 273 阅读 · 0 评论