<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[weixin_48314398的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/weixin_48314398</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; weixin_48314398]]></copyright><item><title><![CDATA[雨课堂 项目管理 期末答案]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/135361605</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/135361605</guid><author>weixin_48314398</author><pubDate>Wed, 03 Jan 2024 13:41:14 +0800</pubDate><description><![CDATA[项目管理答案]]></description><category></category></item><item><title><![CDATA[第三章总结]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/121107500</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/121107500</guid><author>weixin_48314398</author><pubDate>Tue, 02 Nov 2021 19:48:53 +0800</pubDate><description><![CDATA[算法第三章总结实战训练
动态规划算法通常用于求解具有某种最有性质的问题。
适用动态规划策略解决的问题具有以下3个性质：
1.最优化原理，也称最优子结构：如果问题的最优解包含的子问题的解也是最优的，就称该问题具有最优子结构，既满足最优化原理。
2.无后向性，即某阶段一旦确定，就不受这个状态以后决策的影响。也就是说，某状态以后的过程不会影响以前的状态，只与当前状态有关，这种特性被称为无后向性。
3.重叠子问题；即子问题之间是不独立的，一个子问题在下一阶段决策中可能被多次使用。对有分解过程的问题还表现在；自顶向下]]></description><category></category></item><item><title><![CDATA[算法第二章思维导图]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/120714241</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/120714241</guid><author>weixin_48314398</author><pubDate>Mon, 11 Oct 2021 23:37:07 +0800</pubDate><description><![CDATA[算法第二章思维导图

//真没有被迫营业
//FFT解决大数乘法
#include&lt;cmath&gt;
#include&lt;cstdio&gt;
#include&lt;vector&gt;
#include&lt;queue&gt;
#include&lt;cstring&gt;
#include&lt;iomanip&gt;
#include&lt;stdlib.h&gt;
#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#define l]]></description><category></category></item><item><title><![CDATA[数据结构，代码填空]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/116204730</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/116204730</guid><author>weixin_48314398</author><pubDate>Tue, 27 Apr 2021 16:46:18 +0800</pubDate><description><![CDATA[本函数的功能是从有N个元素的线性表A中查找第K小的元素。函数的初始调用为Qselect(A, K, 0, N-1)。请完成下列填空。
ElementType Qselect( ElementType A[], int K, int Left, int Right )
{
    ElementType Pivot = A[Left];
    int L = Left, R = Right+1;

    while (1) {
        while ( A[++L] &lt; Pivot ) ;
 ]]></description><category></category></item><item><title><![CDATA[数据结构 编程题7.1]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111598378</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111598378</guid><author>weixin_48314398</author><pubDate>Wed, 23 Dec 2020 20:24:11 +0800</pubDate><description><![CDATA[7-1 一元多项式的乘法与加法运算 (20分)

设计函数分别求两个一元多项式的乘积与和。

输入格式:
输入分2行，每行分别先给出多项式非零项的个数，再以指数递降方式输入一个多项式非零项系数和指数（绝对值均为不超过1000的整数）。数字间以空格分隔。
输出格式:
输出分2行，分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔，但结尾不能有多余空格。零多项式应输出0 0。
输入样例:
4 3 4 -5 2  6 1  -2 0
3 5 20  -7 4  3 1
输出样例:
1]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.20]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111559250</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111559250</guid><author>weixin_48314398</author><pubDate>Tue, 22 Dec 2020 15:38:12 +0800</pubDate><description><![CDATA[6-20 No Less Than X in BST (20分)
You are supposed to output, in decreasing order, all the elements no less than X in a binary search tree T.
Format of function:

void Print_NLT( Tree T,  int X );

where Tree is defined as the following:

typedef struct Tre]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.19]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111558950</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111558950</guid><author>weixin_48314398</author><pubDate>Tue, 22 Dec 2020 15:35:18 +0800</pubDate><description><![CDATA[6-19 Count Connected Components (20分)
Write a function to count the number of connected components in a given graph.
Format of functions:

int CountConnectedComponents( LGraph Graph );

where LGraph is defined as the following:

typedef struct AdjVNode *Pt]]></description><category></category></item><item><title><![CDATA[数据结构函数题6.18]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111552425</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111552425</guid><author>weixin_48314398</author><pubDate>Tue, 22 Dec 2020 14:55:05 +0800</pubDate><description><![CDATA[6-18 Two Stacks In One Array (20分)
Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used.
Format of functions:

Stack CreateStack( int MaxElements );
int IsEmp]]></description><category></category></item><item><title><![CDATA[数据结构 函数题 6.17]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111550309</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111550309</guid><author>weixin_48314398</author><pubDate>Tue, 22 Dec 2020 14:41:56 +0800</pubDate><description><![CDATA[6-17 Shortest Path [2] (25分)
Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. It is guaranteed that all the weights are positive.
Format of functions:

void ShortestDist( MGraph Graph, int dist[]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.16]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111545822</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111545822</guid><author>weixin_48314398</author><pubDate>Tue, 22 Dec 2020 14:15:32 +0800</pubDate><description><![CDATA[6-16 Topological Sort (25分)
Write a program to find the topological order in a digraph.
Format of functions:

bool TopSort( LGraph Graph, Vertex TopOrder[] );

where LGraph is defined as the following:

typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNo]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.15]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111536561</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111536561</guid><author>weixin_48314398</author><pubDate>Tue, 22 Dec 2020 13:15:40 +0800</pubDate><description><![CDATA[6-15 求单链表结点的阶乘和 (15分)
本题要求实现一个函数，求单链表L结点的阶乘和。这里默认所有结点的值非负，且题目保证结果在int范围内。
函数接口定义：

int FactorialSum( List L );

其中单链表List的定义如下：

typedef struct Node PtrToNode;
struct Node {
int Data; / 存储结点数据 /
PtrToNode Next; / 指向下一个结点的指针 /
};
typedef PtrToNode List; / 定]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.14]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111478960</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111478960</guid><author>weixin_48314398</author><pubDate>Mon, 21 Dec 2020 17:09:58 +0800</pubDate><description><![CDATA[6-14 Add Two Polynomials (20分)
Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation with a dummy head node. Note: The zero polynomial is represented by an empty list with only the dummy head node.
Format of fu]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.13]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/111400067</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/111400067</guid><author>weixin_48314398</author><pubDate>Sat, 19 Dec 2020 09:06:39 +0800</pubDate><description><![CDATA[6-13 Percolate Up and Down (20分)

Write the routines to do a “percolate up” and a “percolate down” in a binary min-heap.

Format of functions:

void PercolateUp( int p, PriorityQueue H );
void PercolateDown( int p, PriorityQueue H );

where int p is the po]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.12]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/110822959</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/110822959</guid><author>weixin_48314398</author><pubDate>Mon, 07 Dec 2020 17:16:09 +0800</pubDate><description><![CDATA[6-12 二叉搜索树的操作集 (30分)

本题要求实现给定二叉搜索树的5种常用操作。

函数接口定义：
BinTree Insert( BinTree BST, ElementType X );
BinTree Delete( BinTree BST, ElementType X );
Position Find( BinTree BST, ElementType X );
Position FindMin( BinTree BST );
Position FindMax( BinTree BST );
]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.11]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/110822189</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/110822189</guid><author>weixin_48314398</author><pubDate>Mon, 07 Dec 2020 16:52:41 +0800</pubDate><description><![CDATA[6-11 Level-order Traversal (25分)

Write a routine to list out the nodes of a binary tree in “level-order”. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time.

Format of functions:

void Level_ord]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.10]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/110495380</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/110495380</guid><author>weixin_48314398</author><pubDate>Wed, 02 Dec 2020 19:07:58 +0800</pubDate><description><![CDATA[6-10 二叉树的遍历 (25分)

本题要求给定二叉树的4种遍历。

函数定义接口

void InorderTraversal( BinTree BT );
void PreorderTraversal( BinTree BT );
void PostorderTraversal( BinTree BT );
void LevelorderTraversal( BinTree BT );

裁判测试程序样例：
#include &lt;stdio.h&gt;
#include &lt;stdlib.h&]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.9]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/110282089</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/110282089</guid><author>weixin_48314398</author><pubDate>Sat, 28 Nov 2020 15:41:28 +0800</pubDate><description><![CDATA[#6-9 求二叉树高度 (20分)

本题要求给定二叉树的高度。
函数接口定义：
int GetHeight( BinTree BT );
其中BinTree结构定义如下：
typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
要求函数返回给定二叉树BT的高度值。
裁判测试程序样例：
#include &lt;stdio]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.8]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/110001463</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/110001463</guid><author>weixin_48314398</author><pubDate>Mon, 23 Nov 2020 16:57:49 +0800</pubDate><description><![CDATA[#6-8 先序输出叶结点 (15分)

本题要求按照先序遍历的顺序输出给定二叉树的叶结点。
函数接口定义：
void PreorderPrintLeaves( BinTree BT );

其中BinTree结构定义如下：

typedef struct TNode *Position;
typedef Position BinTree;
struct TNode{
ElementType Data;
BinTree Left;
BinTree Right;
};
裁判测试程序样例：

#include &]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.7]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/109799093</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/109799093</guid><author>weixin_48314398</author><pubDate>Thu, 19 Nov 2020 08:07:35 +0800</pubDate><description><![CDATA[#6-7 Deque (25分)

A “deque” is a data structure consisting of a list of items, on which the following operations are possible:

Push(X,D): Insert item X on the front end of deque D.
Pop(D): Remove the front item from deque D and return it.
Inject(X,D): Ins]]></description><category></category></item><item><title><![CDATA[数据结构 函数题6.6]]></title><link>https://blog.youkuaiyun.com/weixin_48314398/article/details/109743726</link><guid>https://blog.youkuaiyun.com/weixin_48314398/article/details/109743726</guid><author>weixin_48314398</author><pubDate>Tue, 17 Nov 2020 15:21:29 +0800</pubDate><description><![CDATA[#6-6 带头结点的链式表操作集 (20分)

本题要求实现带头结点的链式表操作集。

函数接口定义：

List MakeEmpty();
Position Find( List L, ElementType X );
bool Insert( List L, ElementType X, Position P );
bool Delete( List L, Position P );

List MakeEmpty()
{
	List L=(List)malloc(sizeof(struct LNode]]></description><category></category></item></channel></rss>