c语言的二叉树和python,重建二叉树（C++和Python实现）

最新推荐文章于 2021-09-21 11:42:57 发布
最新推荐文章于 2021-09-21 11:42:57 发布
阅读量122 收藏
点赞数
文章标签： c语言的二叉树和python

(说明：本博客中的题目、题目详细说明及参考代码均摘自 “何海涛《剑指Offer：名企面试官精讲典型编程题》2012年”)

题目

输入某二叉树前序遍历和中序遍历结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。

进一步详细说明：

例如输入前序遍历序列 {1, 2, 4, 7, 3, 5, 6, 8} 和 中序遍历序列 {4, 7, 2, 1, 5, 3, 8, 6}， 则重建出图2.6所示的二叉树并输出它的头结点。二叉树结点的定义如下：

structBinaryTreeNode

{intm_nValue;

BinaryTreeNode*m_pLeft;

BinaryTreeNode*m_pRight;

};

594821153e6c618baf4709add60f4223.png

算法设计思想

前序遍历序列的第一个元素为根结点的值，然后在中序遍历序列中寻找根节点的值的位置(索引)。

从中序遍历序列的起始位置到根结点的值的位置(不包含)为根结点左子树的中序遍历序列；从中序遍历序列的根结点的值的位置(不包含)到结束位置为根结点右子树的中序遍历序列；相应的，从前序遍历序列的第二个元素开始的根结点左子树结点数个元素的子序列为根结点左子树的前序遍历序列，从下一个元素开始，直到结束位置的子序列为根结点右子树的前序遍历序列。如图 2.7 所示，

2d49325ff5ff25a6dc376c1daa051723.png

C++ 实现

#include #include //exit()

structBinaryTreeNode

{intm_nValue;

BinaryTreeNode*m_pLeft;

BinaryTreeNode*m_pRight;

};

BinaryTreeNode* ConstructCore(int* preorderSta, int* preorderEnd, int* inorderSta, int*inorderEnd)

{//Create binary tree root node

BinaryTreeNode* root = newBinaryTreeNode;

root->m_nValue = *preorderSta;

root->m_pLeft = root->m_pRight =NULL;//Base condition

if (preorderSta ==preorderEnd)

{if (inorderSta == inorderEnd && *preorderSta == *inorderSta) // 易漏点returnroot;else{

printf("Invalid input: line %d in Function %s.", __LINE__, __func__);

exit(-1);

}

}//Find root node position in in-order sequence

int* rootInorder =inorderSta;while (rootInorder < inorderEnd && *rootInorder != *preorderSta) // 易错点，注意比较符号，没有等号。++rootInorder;if (rootInorder == inorderEnd && *rootInorder != *preorderSta) { // 易漏点

printf("Invalid input: line %d in Function %s.", __LINE__, __func__);

exit(-1);

}//Construct left subtree

if (rootInorder >inorderSta)

root->m_pLeft = ConstructCore(preorderSta+1, preorderSta+(rootInorder-inorderSta), inorderSta, rootInorder-1);//Construct right subtree

if (rootInorder

root->m_pRight = ConstructCore(preorderSta+(rootInorder-inorderSta)+1, preorderEnd, rootInorder+1, inorderEnd);returnroot;

}//Re-construct the binary tree, then return the root node pointer

BinaryTreeNode* Construct(int* preorder, int* inorder, intnodesNum)

{if (preorder == NULL || inorder == NULL || nodesNum <= 0) // 易漏点returnNULL;return ConstructCore(preorder, preorder+nodesNum-1, inorder, inorder+nodesNum-1);

}//Destroy Binary Tree

void destroyBinaryTree(BinaryTreeNode* &root)

{if (root !=NULL) // 易漏点

{//Postorder traversalif (root->m_pLeft !=NULL)

destroyBinaryTree(root->m_pLeft);if (root->m_pRight !=NULL)

destroyBinaryTree(root->m_pRight);deleteroot;

root=NULL; // 易漏点

}

}//Print binary tree elements in post-traversal

void printBinaryTree(const BinaryTreeNode*root)

{if(root) // 易漏点

{

printBinaryTree(root->m_pLeft);

printBinaryTree(root->m_pRight);

printf("%d,", root->m_nValue);

}

}voidunitest()

{int preorderArr[] = {1, 2, 4, 7, 3, 5, 6, 8};int inorderArr[] = {4, 7, 2, 1, 5, 3, 8, 6};int nodesNum = sizeof(preorderArr)/sizeof(preorderArr[0]);//Re-construct Binary tree from preorder sequence and inorder sequence

BinaryTreeNode* root =Construct(preorderArr, inorderArr, nodesNum);//Print Binary Tree

printBinaryTree(root);//Destroy Binary Tree

destroyBinaryTree(root);

}intmain()

{

unitest();return 0;

}

Python 实现

#!/usr/bin/python#-*- coding: utf8 -*-

classBinaryTreeNode:def __init__(self, value, left_node=None, right_node=None):

self.value=value

self.left_node=left_node

self.right_node=right_nodedefprint_binarytree_postorder(head):ifhead:

print_binarytree_postorder(head.left_node)

print_binarytree_postorder(head.right_node)print "%d," %head.value,defconstruct(preorder, inorder, nodes_num):if (preorder is None) or (inorder is None) or (nodes_num <=0):returnNonereturn construct_core(preorder, 0, nodes_num-1, inorder, 0, nodes_num-1)defconstruct_core(preorder, start_index_preorder, end_index_preorder,

inorder, start_index_inorder, end_index_inorder):#Create root node

root =BinaryTreeNode(preorder[start_index_preorder])#Base condition

if start_index_preorder ==end_index_preorder:if (start_index_inorder == end_index_inorder) and (preorder[start_index_preorder] ==inorder[start_index_inorder]):returnrootelse:print "Invalid input!"exit(-1)#Recursive condition

root_index_inorder =start_index_inorderwhile (root_index_inorder < end_index_inorder) and (inorder[root_index_inorder] !=preorder[start_index_preorder]):

root_index_inorder+= 1

if (root_index_inorder == end_index_inorder) and (inorder[root_index_inorder] !=preorder[start_index_preorder]):print "Invalid input!"exit(-1)#Construct left subtree

if root_index_inorder >start_index_inorder:

root.left_node= construct_core(preorder, start_index_preorder+1, start_index_preorder+root_index_inorder-start_index_inorder,

inorder, start_index_inorder, root_index_inorder-1)#Construct right subtree

if root_index_inorder

root.right_node= construct_core(preorder, start_index_preorder+root_index_inorder-start_index_inorder+1, end_index_preorder,

inorder, root_index_inorder+1, end_index_inorder)returnrootdefunitest():

preorder_list= [1, 2, 4, 7, 3, 5, 6, 8]

inorder_list= [4, 7, 2, 1, 5, 3, 8, 6]#Reconstruct binary tree, then return root node

root_binarytree =construct(preorder_list, inorder_list, len(preorder_list))#Print Binary Tree

print_binarytree_postorder(root_binarytree)if __name__ == '__main__':

unitest()

参考代码

1. targetver.h (06_ConstructBinaryTree/ 目录)

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

#pragma once

//The following macros define the minimum required platform. The minimum required platform//is the earliest version of Windows, Internet Explorer etc. that has the necessary features to run//your application. The macros work by enabling all features available on platform versions up to and//including the version specified.//Modify the following defines if you have to target a platform prior to the ones specified below.//Refer to MSDN for the latest info on corresponding values for different platforms.

#ifndef _WIN32_WINNT //Specifies that the minimum required platform is Windows Vista.

#define _WIN32_WINNT 0x0600 //Change this to the appropriate value to target other versions of Windows.

#endif

View Code

2. stdafx.h (06_ConstructBinaryTree/ 目录)

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//stdafx.h : include file for standard system include files,//or project specific include files that are used frequently, but//are changed infrequently//

#pragma once#include"targetver.h"#include#include

//TODO: reference additional headers your program requires here

View Code

3. stdafx.cpp (06_ConstructBinaryTree/ 目录)

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//stdafx.cpp : source file that includes just the standard includes//ConstructBinaryTree.pch will be the pre-compiled header//stdafx.obj will contain the pre-compiled type information

#include"stdafx.h"

//TODO: reference any additional headers you need in STDAFX.H//and not in this file

View Code

4. ConstructBinaryTree.cpp

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//ConstructBinaryTree.cpp : Defines the entry point for the console application.//

//《剑指Offer——名企面试官精讲典型编程题》代码//著作权所有者：何海涛

#include"stdafx.h"#include"..UtilitiesBinaryTree.h"#includeBinaryTreeNode* ConstructCore(int* startPreorder, int* endPreorder, int* startInorder, int*endInorder);

BinaryTreeNode* Construct(int* preorder, int* inorder, intlength)

{if(preorder == NULL || inorder == NULL || length <= 0)returnNULL;return ConstructCore(preorder, preorder + length - 1,

inorder, inorder+ length - 1);

}

BinaryTreeNode*ConstructCore

(int* startPreorder, int*endPreorder,int* startInorder, int*endInorder

)

{//前序遍历序列的第一个数字是根结点的值

int rootValue = startPreorder[0];

BinaryTreeNode* root = newBinaryTreeNode();

root->m_nValue =rootValue;

root->m_pLeft = root->m_pRight =NULL;if(startPreorder ==endPreorder)

{if(startInorder == endInorder && *startPreorder == *startInorder)returnroot;else

throw std::exception("Invalid input.");

}//在中序遍历中找到根结点的值

int* rootInorder =startInorder;while(rootInorder <= endInorder && *rootInorder !=rootValue)++rootInorder;if(rootInorder == endInorder && *rootInorder !=rootValue)throw std::exception("Invalid input.");int leftLength = rootInorder -startInorder;int* leftPreorderEnd = startPreorder +leftLength;if(leftLength > 0)

{//构建左子树

root->m_pLeft = ConstructCore(startPreorder + 1, leftPreorderEnd,

startInorder, rootInorder- 1);

}if(leftLength < endPreorder -startPreorder)

{//构建右子树

root->m_pRight = ConstructCore(leftPreorderEnd + 1, endPreorder,

rootInorder+ 1, endInorder);

}returnroot;

}//====================测试代码====================

void Test(char* testName, int* preorder, int* inorder, intlength)

{if(testName !=NULL)

printf("%s begins:", testName);

printf("The preorder sequence is:");for(int i = 0; i < length; ++i)

printf("%d", preorder[i]);

printf("");

printf("The inorder sequence is:");for(int i = 0; i < length; ++i)

printf("%d", inorder[i]);

printf("");try{

BinaryTreeNode* root =Construct(preorder, inorder, length);

PrintTree(root);

DestroyTree(root);

}catch(std::exception&exception)

{

printf("Invalid Input.");

}

}//普通二叉树//1/2 3/// ///4 5 6/7 8

voidTest1()

{const int length = 8;int preorder[length] = {1, 2, 4, 7, 3, 5, 6, 8};int inorder[length] = {4, 7, 2, 1, 5, 3, 8, 6};

Test("Test1", preorder, inorder, length);

}//所有结点都没有右子结点//1/2/3/4/5

voidTest2()

{const int length = 5;int preorder[length] = {1, 2, 3, 4, 5};int inorder[length] = {5, 4, 3, 2, 1};

Test("Test2", preorder, inorder, length);

}//所有结点都没有左子结点//12345

voidTest3()

{const int length = 5;int preorder[length] = {1, 2, 3, 4, 5};int inorder[length] = {1, 2, 3, 4, 5};

Test("Test3", preorder, inorder, length);

}//树中只有一个结点

voidTest4()

{const int length = 1;int preorder[length] = {1};int inorder[length] = {1};

Test("Test4", preorder, inorder, length);

}//完全二叉树//1/2 3/// ///4 5 6 7

voidTest5()

{const int length = 7;int preorder[length] = {1, 2, 4, 5, 3, 6, 7};int inorder[length] = {4, 2, 5, 1, 6, 3, 7};

Test("Test5", preorder, inorder, length);

}//输入空指针

voidTest6()

{

Test("Test6", NULL, NULL, 0);

}//输入的两个序列不匹配

voidTest7()

{const int length = 7;int preorder[length] = {1, 2, 4, 5, 3, 6, 7};int inorder[length] = {4, 2, 8, 1, 6, 3, 7};

Test("Test7: for unmatched input", preorder, inorder, length);

}int _tmain(int argc, _TCHAR*argv[])

{

Test1();

Test2();

Test3();

Test4();

Test5();

Test6();

Test7();return 0;

}

View Code

5. targetver.h (Utilities/ 目录)

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

#pragma once

//The following macros define the minimum required platform. The minimum required platform//is the earliest version of Windows, Internet Explorer etc. that has the necessary features to run//your application. The macros work by enabling all features available on platform versions up to and//including the version specified.//Modify the following defines if you have to target a platform prior to the ones specified below.//Refer to MSDN for the latest info on corresponding values for different platforms.

#ifndef WINVER //Specifies that the minimum required platform is Windows Vista.

#define WINVER 0x0600 //Change this to the appropriate value to target other versions of Windows.

#endif#ifndef _WIN32_WINNT//Specifies that the minimum required platform is Windows Vista.

#define _WIN32_WINNT 0x0600 //Change this to the appropriate value to target other versions of Windows.

#endif#ifndef _WIN32_WINDOWS//Specifies that the minimum required platform is Windows 98.

#define _WIN32_WINDOWS 0x0410 //Change this to the appropriate value to target Windows Me or later.

#endif#ifndef _WIN32_IE//Specifies that the minimum required platform is Internet Explorer 7.0.

#define _WIN32_IE 0x0700 //Change this to the appropriate value to target other versions of IE.

#endif

View Code

6. stdafx.h (Utilities/ 目录)

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//stdafx.h : include file for standard system include files,//or project specific include files that are used frequently, but//are changed infrequently//

#pragma once#include"targetver.h"

#define WIN32_LEAN_AND_MEAN //Exclude rarely-used stuff from Windows headers

//Windows Header Files:

#include #include

//TODO: reference additional headers your program requires here

View Code

7. stdafx.cpp (Utilities/ 目录)

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//stdafx.cpp : source file that includes just the standard includes//Utilities.pch will be the pre-compiled header//stdafx.obj will contain the pre-compiled type information

#include"stdafx.h"

//TODO: reference any additional headers you need in STDAFX.H//and not in this file

View Code

8. BinaryTree.h

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//《剑指Offer——名企面试官精讲典型编程题》代码//著作权所有者：何海涛

#pragma once

structBinaryTreeNode

{intm_nValue;

BinaryTreeNode*m_pLeft;

BinaryTreeNode*m_pRight;

};

__declspec( dllexport ) BinaryTreeNode* CreateBinaryTreeNode(intvalue);

__declspec( dllexport )void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode*pRight);

__declspec( dllexport )void PrintTreeNode(BinaryTreeNode*pNode);

__declspec( dllexport )void PrintTree(BinaryTreeNode*pRoot);

__declspec( dllexport )void DestroyTree(BinaryTreeNode* pRoot);

View Code

9. BinaryTree.cpp

8f900a89c6347c561fdf2122f13be562.png

961ddebeb323a10fe0623af514929fc1.png

//《剑指Offer——名企面试官精讲典型编程题》代码//著作权所有者：何海涛

#include"StdAfx.h"#include"BinaryTree.h"BinaryTreeNode* CreateBinaryTreeNode(intvalue)

{

BinaryTreeNode* pNode = newBinaryTreeNode();

pNode->m_nValue =value;

pNode->m_pLeft =NULL;

pNode->m_pRight =NULL;returnpNode;

}void ConnectTreeNodes(BinaryTreeNode* pParent, BinaryTreeNode* pLeft, BinaryTreeNode*pRight)

{if(pParent !=NULL)

{

pParent->m_pLeft =pLeft;

pParent->m_pRight =pRight;

}

}void PrintTreeNode(BinaryTreeNode*pNode)

{if(pNode !=NULL)

{

printf("value of this node is: %d", pNode->m_nValue);if(pNode->m_pLeft !=NULL)

printf("value of its left child is: %d.", pNode->m_pLeft->m_nValue);elseprintf("left child is null.");if(pNode->m_pRight !=NULL)

printf("value of its right child is: %d.", pNode->m_pRight->m_nValue);elseprintf("right child is null.");

}else{

printf("this node is null.");

}

printf("");

}void PrintTree(BinaryTreeNode*pRoot)

{

PrintTreeNode(pRoot);if(pRoot !=NULL)

{if(pRoot->m_pLeft !=NULL)

PrintTree(pRoot->m_pLeft);if(pRoot->m_pRight !=NULL)

PrintTree(pRoot->m_pRight);

}

}void DestroyTree(BinaryTreeNode*pRoot)

{if(pRoot !=NULL)

{

BinaryTreeNode* pLeft = pRoot->m_pLeft;

BinaryTreeNode* pRight = pRoot->m_pRight;deletepRoot;

pRoot=NULL;

DestroyTree(pLeft);

DestroyTree(pRight);

}

}

View Code

10. 参考代码下载

项目 06_ConstructBinaryTree 下载： 百度网盘

何海涛《剑指Offer：名企面试官精讲典型编程题》 所有参考代码下载：百度网盘

参考资料

[1]  何海涛. 剑指 Offer：名企面试官精讲典型编程题 [M]. 北京：电子工业出版社，2012. 53-58.

综安驾校
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
python 决策树的底层逻辑
cj12345657582255的博客
07-04 288
实验任务（实验题目、目的） Implementing a binary tree and its common operations with VC++ or Python，and then use this tree to make decision or classification. 利用VC++/Python语言实现对二叉树的基本操作设计，用二叉树进行简单的判定或者分类，要求二叉树结点可以插入和删除。 任务分析 实现思路 构造就是生成一棵完整的决策树。简单来说，构造的过程就是选择什么属性作为节点的过
（Python3）数据结构——10.二叉树的原理及实现
1、、的博客
03-21 669
本文介绍了树和结点的相关概念、插入和几种遍历方法的原理，并通过Python3进行实现。
python写一个二叉树
CRUD工程师
07-31 9452
先来设计下怎么实现二叉树，首先一个节点类和树类是需要的，所以需要class node 和class tree class node: def __init__(self): pass class tree: def __init__(self): pass 接下来是看功能，节点和树需要实例化，同时树需要一个add方法来把新的节点加进去,可以确定的是，...
python二叉树简单实现
weixin_30357231的博客
04-07 75
二叉树简单实现： class Node: def __init__(self,item): self.item = item self.child1 = None self.child2 = None class Tree: def __init__(self): self.root = None def...
用python实现二叉树的基本操作
weixin_42906066的博客
10-28 1482
二叉树基本操作： 创建二叉树 （need） 递归遍历二叉树 （need） 1）前序遍历：“根-左-右” 2）中序遍历：“左-根-右” 3）后序遍历：“左-右-根” 非递归遍历二叉树 1）前序遍历 2）中序遍历 3）后序遍历 创建二叉树，如下图： 手动创建二叉树： 方法一: A, B, C, D, E, F = [BinaryTreeNode(x) for x in '123456'...
Python实现重建二叉树的三种方法详解
09-20
主要介绍了Python实现重建二叉树的三种方法,结合实例形式分析了Python重建二叉树的实现方法、操作技巧与注意事项,需要的朋友可以参考下
二叉树的层次遍历(python&C++)
06-07
二叉树的层次遍历，思路与实现
树和二叉树python实现与讲解.docx
最新发布
10-30
二叉树
基于python二叉树的构造和打印例子
12-26
写在最前面： 带你从最简单的二叉树构造开始，深入... '树的实现' def __init__(self,data,left = 0,right = 0): self.left = left self.right = right self.data = data def __str__(self): return str(self.
用C++语言创建一棵二叉树及实现二叉树的各种操作
热门推荐
飞奔的蜗牛
03-11 1万+
本文将为各位读者展示如何实现创建二叉树、二叉树的各种遍历（先序遍历[递归和非递归]、中序遍历、后序遍历）以及求二叉树节点个数、深度、叶子节点、第K层节点等一系列操作。 以下为代码实现部分（部分解析包含在注释中），代码包含测试部分： # define _CRT_SECURE_NO_WARNINGS 1 #include&lt;iostream&gt; using namespace std; ...
c语言的二叉树和python,树和二叉树及python实现
weixin_36422176的博客
05-19 179
1.什么是树属于非线性数据结构结构的一种，树的定义：n个节点组成的有限集合。n=0，空树；n>0,1个根节点，m个互不相交的有限集，每个子集为根的子树。2.树的基本术语路径长度：路径经过节点数目减1二叉树1. 二叉树简介二叉树是n(n>=0)个结点的有限集合，该集合或者为空集(称为空二叉树)，或者由一个根结点和两棵互不相交的、分别称为根结点的左子树和右子树组成。每一个结点中最多拥有一个...
二叉树的三种遍历方式（C++、python）
weixin_41828075的博客
04-21 181
二叉树的前序遍历： # C++ /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), rig
c语言 二叉树基本操作
xiami
03-02 162
#include "BinTree.h" #include <assert.h> #include <malloc.h> #include <stdio.h> #include <string.h> #include "Queue.h" BTNode* BuyBinTeeNode(BTDataType data) { BTNode* pN...
最长的可整合子数组的长度
west_ahu的博客
09-12 467
（一）题目描述 先给出可整合数组的定义。如果一个数组在排序之后，每相邻两个数差的绝对值都为1，则该数组为可整合数组。例如，[5,3,4,6,2]排序之后为[2,3,4,5,6]，符合每相邻两个数差的绝对值都为1，所以这个数组为可整合数组。给定一个整型数组arr，请返回其中最大可整合子数组的长度。例如，[5,5,3,2,6,4,3]中最大可整合子数组为[5,3,2,6,4]，所以返回5。 （二）
剑指 Offer 26. 树的子结构(python/c++)
qq_36421001的博客
09-21 69
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def isSubStructure(self, A: TreeNode, B: TreeNode) -> bool: ...
【C语言】数据结构C语言版 实验6 树
点滴记忆
12-09 1808
/* 编写算法函数void levelorder(tree t)实现树的层次遍历。 */ #include "tree.h" void levelorder(tree t) /* t为指向树根结点的指针*/ { tree queue[100]; int f,r,i; //f,r分别为队头和队尾指针 tree p; f=0; r=1; queue[0...
《数据结构》--数组中升序有序子数组的最大长度
钟真龙的博客
12-22 330
#include <iostream> int GetOrderLen(int arr[], int length) { if (length < 0) return 0; else if (length < 2) return 1; int maxLen = 0; // 记录最长有序子数组 int currentLen = 0; // 当前记录的有序数组长度 for (int i = 0; i < length - 1; i++) { if .
655. Print Binary Tree 解题报告（树）
weixin_33919941的博客
08-13 84
第一部分：搜索、遍历 【例子1】655. Print Binary Tree Example 1: Input: 1 / 2 Output: [["", "1", ""], ["2", "", ""]] Example 2: Input: 1 / \ 2 3 \ 4 Output:...
c语言二叉树 栈和队列实验
10-23
C语言二叉树，栈和队列实验是一个经典且重要的实验项目。这个项目的目的是掌握二叉树、栈和队列的基本概念和操作。 首先，二叉树是一种常见的数据结构，它由节点组成，每个节点最多有两个子节点。树的根节点没有父...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值