DSAA之图论双连通及割点问题(十一)

算法设计手册(第2版)读书笔记, Springer - The Algorithm Design Manual, 2ed Steven S.Skiena 2008 The Algorithm Design Manual, 2ed 跳转至: 导航、 搜索 Springer - The Algorithm Design Manual, 2ed Steven S.Skiena 2008 目录 1 介绍2 算法设计3 数据结构4 排序和搜索5 图遍历6 加权图7 组合搜索与启发式8 DP9 I 阅读详情

1. 定义

  • A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.
  • If a graph is not biconnected, the vertices whose removal would disconnect the graph are known as articulation points.

在理解下面的算法前,再次记忆双连通是指不存在割点的无向连通图。

2. 解决算法

  • Depth-first search provides a linear-time algorithm to find all articulation points in a connected graph.
  • First, starting at any vertex, we perform a depth first search and number the nodes as they are visited. For each vertex v, we call this preorder number num(v).这也是下面的算法assign_num所做的事情,非常简单就是图的DFS遍历及给每个节点赋值
  • Then, for every vertex v in the depth-first search spanning tree, we compute the lowest-numbered vertex, which we call low(v).之前说过不太理解DFS生成树的coding办法,其实DFS生成树是DFS搜索过程的反映,只要在DFS搜索过程中做相应的处理就相当于后序或者中序遍历DFS生成树
    • We can efficiently compute low by performing a postorder traversal of the depth-first spanning tree.
  • By the definition of low, low(v) is the minimum of以下三者中的最小值,所以每条都要计算
    • num(v)
      • The first condition is the option of taking no edges
    • the lowest num(w) among all back edges (v, w)
      • the second way is to choose no tree edges and a back edge就是所有背向边中最小的num(v)
    • the lowest low(w) among all tree edges (v, w)
      • the third way is to choose some tree edges and
        possibly a back edge.
  • Any other vertex v is an articulation point if and only if v has some child w such that low(w) ≥\geq≥ num(v).这里是最关键的割点的判断条件
    • Notice that this condition is always satisfied at the root; hence the need for a special test.

下面的伪代码由DSAA给出,将所有的步骤整合到一起,在DFS框架中给节点编号,并在调用递归之后判断每个节点的low(),同时判断是否有割点出现。这种编程方式将前序遍历和后续遍历整合到一起,值得学习。

3. 伪代码

void find_art( vertex v ){
  vertex w;
  visited[v] = TRUE;
  /* Rule 1 同时也给每个节点一个前序编号*/
  low[v] = num[v] = counter++;
  for each w adjacent to v{
    {/* forward edge 没有访问的节点,一定是当前节点的子代*/
    if( !visited[w] ){
      //标记当前节点w的父代为v
      parent[w] = v;
      find_art( w );
      //通过上面的find_art(w)已经获得low(w)值,判断是否w-v满足割点性质,此时是后序遍历。使用nums[v] !=1 排除root节点
      if( nums[v] != 1 &&low[w] >= num[v] )
        printf ( "%v is an articulation point\n", v );
      //Rule 3 更新当前节点的low值
      low[v] = min( low[v], low[w] ); 
    }
    /* back edge 下面解释*/
    else if( parent[v] != w )
      //Rule 2 更新当前节点的low值
      low[v] = min( low[v], num[w] ); 
    }
}

上面伪代码中最后的else if( parent[v] != w )需要重点考虑下,因为无向图边都是双向的,所以在w已经访问过的时候,一种可能是在之前w-v已经考虑过该边了,而此时再将v-w当成背向边将导致错误,所以这里需要判断下。借助下图可以很容易理解:(比如:CD边与DC边)
这里写图片描述

时间复杂度

由于上面的整体框架还是DFS,遍历每一个边和节点一次,所以整体上的时间复杂度为O(∣E∣+∣V∣)O(|E|+|V|)O(∣E∣+∣V∣)。

4. 最后

留下了个问题,**为什么low(w) ≥\geq≥ num(v)时,当前节点为割点?**这个问题,暂时笔者当算法结论记住。

STM32F103C8T6+TB6612驱动直流电机全攻略(附PWM调速代码) 本文提供了一份基于STM32F103C8T6微控制器和TB6612驱动模块的直流电机驱动完整解决方案。详细解析了硬件连接、STM32CubeMX配置、HAL库驱动代码编写,并附带了PWM调速代码实现。内容涵盖从基础原理到实战调试的全过程,旨在帮助开发者快速构建稳定、可精准调速的电机控制系统,适用于智能车、机器人等嵌入式项目。 阅读详情

相关推荐

单细胞数据分析实战:用scDblFinder快速搞定异质性双细胞检测(附完整R代码)

本文详细介绍了如何使用scDblFinder工具在单细胞RNA测序数据中精准识别异质性双细胞。通过完整的R代码示例,从环境准备、数据加载到核心分析流程和结果可视化,帮助研究人员高效解决双细胞检测问题,提升单细胞数据分析的准确性。scDblFinder的集成算法和鲁棒性设计使其成为处理单细胞数据中技术噪音的理想选择。

weixin_29098117的博客 442

DSAA之图论Euler Circuits问题(九)

1. 从实际演变的问题 A popular puzzle is to reconstruct these figures using a pen, drawing each line exactly once. The pen may not be lifted from the paper while the drawing is being performed. As an extra...

LoveStackover的博客 263

win10+conda+pytorch-gpu安装

pytorch 官网上只有linux和Mac的程序包,没有windows系统的,但是windows系统还是可以用pytorch的。  github: https://github.com/peterjc123/pytorch-scripts 首先要安装anaconda: 推荐清华镜像 https://mirrors.tuna.tsinghua.edu.cn/anaconda/archive/ ...

一摩尔自由的博客 1万+

DSAA之图论DFS生成树和查找强连通分支(十)

1. 回顾   DSAA之图论DFS算法,初识回溯(八)的重点扩展了回溯算法,忽略了DFS生成树的若干问题。研究DFS生成树是必要的,因为其有些比较重要的应用,如:Biconnectivity。 2. 无向图生成树 We graphically illustrate these steps with a depth-first spanning tree. The root ...

LoveStackover的博客 202

【无标题】EXCEL实现刷题

运用Excel开发的刷题工具,具有普遍实用性,可将WORD的试题自动导入并实现刷题。

weixin_44081794的博客 2976

RK3568平台(电源篇)电源域IO配置

在kernel之前需要修改电源域,主控电源域的IO电平要与对接外设芯片的IO电平匹配,还要注意软件的电压配置要跟硬件的电压一致,否则,最坏的情况可能会导致IO的损坏。其实就是管理 IO 输出的电平;假如硬件上 IO 电源域配置为 3.3V,则 IO 输出最大电平为 3.3V;同理 IO 电源域硬件配置为 1.8V,则 IO 输出最大电平是 1.8V;这样有利于 IO 电平的灵活配置;

weixin_49303682的博客 3480

DSAA之图论Prim算法(六)

备注   笔者暂时不记录网络流和关键路径分析法,DSAA这里讲的很粗略。以后根据需要单独补充。 1. Minimum Spanning Tree Informally, a minimum spanning tree of an undirected graph G is a tree formed from graph edges that connects all the v...

LoveStackover的博客 215

基于Simulink的轨道交通信号控制系统仿真详细介绍

轨道交通信号控制系统是确保列车安全、高效运行的核心技术。通过Simulink进行信号控制系统的仿真,可以验证系统的设计、优化调度策略并提高安全性。以下是如何在MATLAB和Simulink中设计并仿真一个轨道交通信号控制系统的详细步骤。通过上述步骤,我们成功设计并实现了基于Simulink的轨道交通信号控制系统仿真。该系统能够根据列车位置、速度和轨道状态生成控制指令,确保列车的安全、高效运行。通过虚拟场景仿真、硬件在环测试和实机测试,验证了系统的性能,并通过参数优化进一步提升了系统的可靠性。引入智能调度。

xiaoheshang_123的博客 463

DSAA之图论DFS算法,初识回溯(八)

1. 回顾 Depth-first search is a generalization of preorder traversal. We implicitly assume that for undirected graphs every edge (v, w) appears twice in the adjacency lists: once as (v, w) and ...

LoveStackover的博客 288

基于 YOLOv26 的食品包装缺陷检测系统:智能视觉质检方案

本文提出了一种基于YOLOv26深度学习的食品包装缺陷智能检测系统。该系统能够自动识别多种常见包装缺陷,包括密封不良、破损、污染、标签错误等8类问题。相比传统人工检测方法,该系统具有高精度、多类别分类、实时推理等优势。文章详细介绍了系统架构,包含数据采集、预处理、YOLOv26检测模型和后处理四个核心模块,并提供了完整的环境配置和数据处理代码实现。该系统为食品包装行业提供了一种高效、准确的智能视觉质检解决方案。

一键难忘的博客 691

SolidWorks_模具设计5_分型线生成

分型线是模具设计的核心要素,直接影响产品质量、脱模可行性和制造成本。本文系统介绍了分型线生成技术,包括三种核心算法:基于凸包的方法适用于简单几何,可见性分析处理复杂曲面,曲率特征优化则能找到自然分界。文章提供了完整的Python实现示例,涵盖点云投影、网格处理和分型线评估等关键技术。通过理解这些原理和方法,工程师可以更高效地设计出满足外观要求、易于加工的分型线方案,显著提升模具设计质量和效率。

H17853509096的博客 181

《DSAA》 9.6.2 双连通性

如果一个连通的无向图的任意顶点删除后,剩下的图仍然连通,该图被称为双连通的。 如果一个图不是双连通的,那么那些将其删除后不再连通的节点,被称为割裂点。 我们可以用深度优先生成树来寻找割裂点,起点为树根,每向前搜索到一个点就会产生一条前向边,但有时会遇到回路,即搜索到经过的点,这时产生的边称为背向边,背向边并不属于生成树,但会在后面用到。 假设每个顶点有两个编号:一个是遍历时的序号,另一个比较

sun_xo的博客 612

深度学习工具包 DeepLearningToolbox

深度学习工具包Deprecation notice.-----This toolbox is outdated and no longer maintained.There are much better tools available for deep learning than this toolbox, e.g. [Theano](http://deeplearning.net/software/theano/), [torch](http://torch.ch/) or [tensorflow](http://www.tensorflow.org/)I would suggest you use one of the tools mentioned above rather than use this toolbox.Best, Rasmus.DeepLearnToolbox================A Matlab toolbox for Deep Learning.Deep Learning is a new subfield of machine learning that focuses on learning deep hierarchical models of data.It is inspired by the human brain's apparent deep (layered, hierarchical) architecture.A good overview of the theory of Deep Learning theory is[Learning Deep Architectures for AI](http://www.iro.umontreal.ca/~bengioy/papers/ftml_book.pdf)For a more informal introduction, see the following videos by Geoffrey Hinton and Andrew Ng.* [The Next Generation of Neural Networks](http://www.youtube.com/watch?v=AyzOUbkUf3M) (Hinton, 2007)* [Recent Developments in Deep Learning](http://www.youtube.com/watch?v=VdIURAu1-aU) (Hinton, 2010)* [Unsupervised Feature Learning and Deep Learning](http://www.youtube.com/watch?v=ZmNOAtZIgIk) (Ng, 2011)If you use this toolbox in your research please cite [Prediction as a candidate for learning deep hierarchical models of data](http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=6284)```@MASTERSTHESIS\{IMM2012-06284, author = "R. B. Palm", title = "Prediction as a candidate for learning deep hierarchical models of data", year = "2012",}```Contact: rasmusbergpalm at gmail dot comDirectories included in the toolbox-----------------------------------`NN/` - A library for Feedforward Backpropagation Neural Networks`CNN/` - A library for Convolutional Neural Networks`DBN/` - A library for Deep Belief Networks`SAE/` - A library for Stacked Auto-Encoders`CAE/` - A library for Convolutional Auto-Encoders`util/` - Utility functions used by the libraries`data/` - Data used by the examples`tests/` - unit tests to verify toolbox is workingFor references on each library check REFS.mdSetup-----1. Download.2. addpath(genpath('DeepLearnToolbox'));Example: Deep Belief Network---------------------```matlabfunction test_example_DBNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit RBM and visualize its weightsrand('state',0)dbn.sizes = [100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);figure; visualize(dbn.rbm{1}.W'); % Visualize the RBM weights%% ex2 train a 100-100 hidden unit DBN and use its weights to initialize a NNrand('state',0)%train dbndbn.sizes = [100 100];opts.numepochs = 1;opts.batchsize = 100;opts.momentum = 0;opts.alpha = 1;dbn = dbnsetup(dbn, train_x, opts);dbn = dbntrain(dbn, train_x, opts);%unfold dbn to nnnn = dbnunfoldtonn(dbn, 10);nn.activation_function = 'sigm';%train nnopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.10, 'Too big error');```Example: Stacked Auto-Encoders---------------------```matlabfunction test_example_SAEload mnist_uint8;train_x = double(train_x)/255;test_x = double(test_x)/255;train_y = double(train_y);test_y = double(test_y);%% ex1 train a 100 hidden unit SDAE and use it to initialize a FFNN% Setup and train a stacked denoising autoencoder (SDAE)rand('state',0)sae = saesetup([784 100]);sae.ae{1}.activation_function = 'sigm';sae.ae{1}.learningRate = 1;sae.ae{1}.inputZeroMaskedFraction = 0.5;opts.numepochs = 1;opts.batchsize = 100;sae = saetrain(sae, train_x, opts);visualize(sae.ae{1}.W{1}(:,2:end)')% Use the SDAE to initialize a FFNNnn = nnsetup([784 100 10]);nn.activation_function = 'sigm';nn.learningRate = 1;nn.W{1} = sae.ae{1}.W{1};% Train the FFNNopts.numepochs = 1;opts.batchsize = 100;nn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.16, 'Too big error');```Example: Convolutional Neural Nets---------------------```matlabfunction test_example_CNNload mnist_uint8;train_x = double(reshape(train_x',28,28,60000))/255;test_x = double(reshape(test_x',28,28,10000))/255;train_y = double(train_y');test_y = double(test_y');%% ex1 Train a 6c-2s-12c-2s Convolutional neural network %will run 1 epoch in about 200 second and get around 11% error. %With 100 epochs you'll get around 1.2% errorrand('state',0)cnn.layers = { struct('type', 'i') %input layer struct('type', 'c', 'outputmaps', 6, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %sub sampling layer struct('type', 'c', 'outputmaps', 12, 'kernelsize', 5) %convolution layer struct('type', 's', 'scale', 2) %subsampling layer};cnn = cnnsetup(cnn, train_x, train_y);opts.alpha = 1;opts.batchsize = 50;opts.numepochs = 1;cnn = cnntrain(cnn, train_x, train_y, opts);[er, bad] = cnntest(cnn, test_x, test_y);%plot mean squared errorfigure; plot(cnn.rL);assert(er<0.12, 'Too big error');```Example: Neural Networks---------------------```matlabfunction test_example_NNload mnist_uint8;train_x = double(train_x) / 255;test_x = double(test_x) / 255;train_y = double(train_y);test_y = double(test_y);% normalize[train_x, mu, sigma] = zscore(train_x);test_x = normalize(test_x, mu, sigma);%% ex1 vanilla neural netrand('state',0)nn = nnsetup([784 100 10]);opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samples[nn, L] = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.08, 'Too big error');%% ex2 neural net with L2 weight decayrand('state',0)nn = nnsetup([784 100 10]);nn.weightPenaltyL2 = 1e-4; % L2 weight decayopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex3 neural net with dropoutrand('state',0)nn = nnsetup([784 100 10]);nn.dropoutFraction = 0.5; % Dropout fraction opts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex4 neural net with sigmoid activation functionrand('state',0)nn = nnsetup([784 100 10]);nn.activation_function = 'sigm'; % Sigmoid activation functionnn.learningRate = 1; % Sigm require a lower learning rateopts.numepochs = 1; % Number of full sweeps through dataopts.batchsize = 100; % Take a mean gradient step over this many samplesnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex5 plotting functionalityrand('state',0)nn = nnsetup([784 20 10]);opts.numepochs = 5; % Number of full sweeps through datann.output = 'softmax'; % use softmax outputopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, train_x, train_y, opts);[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');%% ex6 neural net with sigmoid activation and plotting of validation and training error% split training data into training and validation datavx = train_x(1:10000,:);tx = train_x(10001:end,:);vy = train_y(1:10000,:);ty = train_y(10001:end,:);rand('state',0)nn = nnsetup([784 20 10]); nn.output = 'softmax'; % use softmax outputopts.numepochs = 5; % Number of full sweeps through dataopts.batchsize = 1000; % Take a mean gradient step over this many samplesopts.plot = 1; % enable plottingnn = nntrain(nn, tx, ty, opts, vx, vy); % nntrain takes validation set as last two arguments (optionally)[er, bad] = nntest(nn, test_x, test_y);assert(er < 0.1, 'Too big error');```[![Bitdeli Badge](https://d2weczhvl823v0.cloudfront.net/rasmusbergpalm/deeplearntoolbox/trend.png)](https://bitdeli.com/free "Bitdeli Badge")

DSAA之图论Kruskal算法(七)

1. 回顾   Kruskal算法需要使用并查集,所以记录该篇前需要回顾DSAA之THE DISJOINT SET ADT(一)和DSAA之THE DISJOINT SET ADT(二)。不相交集合的概念和实现都是比较简单。 2. Kruskal’s Algorithm    A second greedy strategy is continually to select ...

LoveStackover的博客 347

C# WinForm 基于DirectShow.dll编写的程序,可边预览边保存视频,音频和图片

基于微软的DirectShow.dll的二次开发1.自动识别连接的摄像头跟麦克风且可以对其进行选择(默认选中第一个)2.可录制wmv和avi两种格式的视频并且都带有音频,avi可以录制的分辨率和帧数进行选择,wmv默认进行了淸晰度优化如不喜欢可去除代码中有相关提示3.可在预览点开之后进行拍照,也可边录制视频边拍照4.添加了视频和音频的压缩功能(酌情使用)这次二次开发发现C#对DirectShow的相关信息太少,这次做完也不敢藏私共享出来,还望大家指正

VB摄像头监控

该VB模块可对摄像头捕获的画面进行录像等,可在创建的窗口进行控制

DSAA之图论Dijkstra(贪婪算法)(五)

1. 前言   有网友把Dijkstra归为BFS算法,笔者觉得是不准确的,两者的差别在于每个阶段是否是最优选择,也就是是否达到局部最优,当然不保证全局最优。 2. 定义 We keep all of the same information as before. Thus, each vertex is marked as either known or unknown. A ...

LoveStackover的博客 438

ssm框架搭建

这个是一个在idea上成功跑起来的ssm框架项目,保存在这里方便以后使用直接下载

博客里《DSAA》相关文章的代码

《DSAA》,也就是《数据结构与算法分析-C语言描述》原书第二版,有关代码已放到以下位置:  https://github.com/sunxiaoou/dsaa

sun_xo的博客 407

DSAA 第一章 引论

练习(p12) 1.1 /* * date: 2016-01-14 * question: 编写一个程序解决选择问题,令 k = N/2。 */ #include <stdlib.h> // use rand () and srand () 动态生成数组 #include <stdio.h> #include <s...

diaochaigang4181的博客 363

dsaa

asd as

u010196337的博客 1092

《DSAA》 10.2.2 最近点问题

设平面上有N个点,要找出其中两个相距最近的点,被称为最近点问题。如果简单地用蛮力解决:N个点存在N × (N - 1) / 2 条边,我们可以检查所有的边找出其中最短者,但是这样的时间界是O(N ^ 2),比较浪费时间,还应该有更巧妙的办法,比如分治算法。 我们在平面中间画一条竖线,则点集p也被分成两半pL和pR,那么最近的一对点将会: 1)都在pL中,设其距离为dL 2)都在pR中,设其距

sun_xo的博客 363

《DSAA》 9.5.2 Kruskal 算法

如何用最少的电线给一所房子安装电路?本质上就是如何从一个无向图中找出一颗最小生成树。一个无向图中的最小生成树由该图的那些连接所有顶点的边构成的树,且其总价值最小。 有两个解决此问题的算法:Prim 和 Kruskal,这里只讨论后者,因为它比较简明有趣。 和一般处理图的算法不同,Kruskal 实际上是在处理森林,即树的集合,开始时每个顶点是一颗单节点树,添加一条边则意味着将两颗树合并成一棵树

sun_xo的博客 681

DSAA Homework 2

DSAA Homework 2

Sidney_Sun的博客 351

《DSAA》 9.3.2 Dijkstra 算法

用 Dijkstra 算法求有向赋权图中任意节点到其他所有节点的最小路径,示例实现如下:

sun_xo的博客 481

DSAA学习笔记

算法:algorithm。 递归:一个函数用它自己来定义。 递归四原则:基准情形、无需递归;不断推进,接近基准;设计法则:所以递归都能运行;合成效益:切勿在递归中作重复工作。 N%10=N-(N/10)*10

mystruway的专栏 1623

【DSAA】Longest Palindromic Substring

最近刷LeetCode遇到一个比较有意思的题目(Longest Palindromic Substring),求一个字符串的最大回文子串。题目本身并不难,但需要理清思路才好理解,借此文记录下。 题目 Given a string s, find the longest palindromic substring in s. You may assume that the maximum l

JianTao_Yang的专栏 520

《DSAA》 9.2 拓扑排序

曾经下围棋乐此不疲,虽说棋力总也不涨,最近听朋友的建议学学算法,找来一本初级的《DSAA》,按照书上的讲解或伪代码写了一些case,意外地觉得和下围棋的乐趣有些类似。 这回是有向无圈图的拓扑排序,它可以解决类似下面这类问题:设有一堆相关的任务,其中一些任务依赖于另一些任务的完成,所以需要对其排序。 伪代码参见原书,我的case 运行结果如下:

sun_xo的博客 658

DSAA补充之B树、B+树

1. 回顾   以前记录的B树DSAA之B-tree(六),这个定义真是有点四不像啊。是B+树的感觉,又没有底层的link。所以今天有必要重新审视下B树和B+树的概念。本文内容摘自维基百科。 2. B树 定义 According to Knuth’s definition, a B-tree of order m is a tree which satisfies the fol...

LoveStackover的博客 299

《DSAA》 10.5.1 收费公路重建问题

收费公路重建问题得名于对美国西海岸公路上那些收税公路出口的模拟:设一条高速公路从起点到终点之间有若干出入口(包括起点和终点),每个出入口设有一个收费站,每两个出入口的距离已知,收费站根据这些距离收费。某天不知发生了什么灾难,这些出入口及其收费站居然消失了,只有起点和各点之间的距离保存下来,现在要重建收费站,则需要求出这些出入口的位置。

sun_xo的博客 982
上一篇: DSAA之补充冒泡排序和选择排序
下一篇: 从零开始算法篇之贪婪(一)
LoveStackover
博客等级 码龄9年 14粉丝 57原创
评论 1
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明:

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

余额充值