栈的应用之括号匹配问题

c语言栈的应用之括号匹配问题 括号配对问题 时间限制:3000 ms  |  内存限制:65535 KB 难度:3 描述 现在,有一行括号序列,请你检查这行括号是否配对。 输入 第一行输入一个数N(0 输出 每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No 样例输入 3 [(]) (]) ([[]()]) 样例输出 No No 阅读详情

MatchBrackets.h

#ifndef __MatchBrackets_H__
#define __MatchBrackets_H__
#define OK 0;
#define ERROR 1;
#define STACK_INIT_SIZE 100
#define STACKINCREACE 10

typedef int ElemType;
typedef int Status;
typedef struct stack
{
    ElemType *base;
    ElemType *top;
    int stacksize;
}Stack;
Status InitStack(Stack* S);
Status PushStack(Stack* S , ElemType e);
Status PopStack(Stack* S);
Status GetStackTop(Stack S);
int StackLength(Stack S);
Status StackTraverse(Stack S);
Status ClearStack(Stack* S);
Status DestroyStack(Stack* S);
Status StackEmpty(Stack S);
Status MatchBrackets(Stack *S,char *str);


#endif  //__MatchBrackets_H__

MatchBrackets.c

#include "MatchBrackets.h"
#include <stdio.h>
#include <stdlib.h>

int InitStack(Stack* S)
{
  S->base = (ElemType *)malloc(STACK_INIT_SIZE*sizeof(ElemType));
   if(S->base == NULL)
   {
       printf("开辟栈空间失败\n");
       return ERROR;
   }
   S->stacksize  =  STACK_INIT_SIZE;
   S->top = S->base;
   return OK;
}
Status PushStack(Stack* S , ElemType e)
{
    if((S->top - S->base) == S->stacksize )//判断栈是否已满
    {
        S->base = (ElemType *)malloc(STACK_INIT_SIZE*sizeof(ElemType));
        if(!S->base)
        {
          return ERROR;
        }
        S->top = S->base + S->stacksize;
        S->stacksize += STACKINCREACE;
    }
    //压栈部分
       *(S->top) = e;
       S->top ++;//栈顶指针+1
       return OK;

}
Status StackTraverse(Stack S)
{
    Stack p;
    if(NULL == S.base )
        return ERROR;
    if(S.base == S.top)
        printf("这是空栈\n");    
    p.top = S.top;
    while(p.top > S.base)
    {
       p.top--;
       printf("%d",*(p.top));
    }
    return OK;

}
int PopStack(Stack* S)
{
    ElemType e;
    if(S->top == S->base)
    {
        return ERROR;
    }
    else
    {       
        S->top--;
        e = *(S->top);//说明:元素并没有删除,仍然在S->top中,但如果插入元素,就会被更新,就像是删除了一样
        return e;
    } 
}
Status GetStackTop(Stack S )
{
    ElemType e;
    if(S.top - S.base >= S.stacksize)
    {
        printf("这是空栈\n");
        return ERROR;
    }

    else
    {
        e = *(S.top-1);
        return e;
    }

}
int StackLength(Stack S)
{
    if(S.base == S.top)
    {
      return OK;
    }
    return S.top - S.base;

}
Status StackEmpty(Stack S)
{
    if(S.base == S.top)
    {
      return ERROR;
    }
    else
      return OK;

}
Status ClearStack(Stack* S)
{
    S->top = S->base;
    return OK;
}
Status MatchBrackets(Stack* S, char * str)
{
    int i = 0; 
    int flag = 0;
    ElemType e = 0;
    while(str[i] != '\0')
    {
       switch(str[i])
       {
           case '{':PushStack(S ,str[i]);              
           break;
           case '[':PushStack(S ,str[i]);
           break;
           case '(':PushStack(S ,str[i]);
           break;
           case '}':
               {                 
                  if( PopStack(S)!= '{')
                  {
                   flag++;
                  }            
               }
           break;
           case ']':
               {
                 if( PopStack(S)!= '[')
                  {
                   flag = 1;
                  } 
               }
           break;
           case ')':
               {
                 if( PopStack(S)!= '(')
                  {
                   flag = 1;
                  } 
               }
           break;
           default:
           break;

       }
      if(flag)
      break;
      i++;
    }
    if(!flag && StackEmpty(*S))
        printf("括号匹配成功\n");
    else if (flag && !StackEmpty(*S))
        printf("括号次序匹配不正确\n");
    else if(flag && StackEmpty(*S))
        printf("右括号多于左括号\n");
    else if(!flag && !StackEmpty(*S))
        printf("左括号多于右括号\n");

    return OK;

}

test.c

#include "MatchBrackets.h"
#include <stdio.h>

void test()
{
    Stack stack;
    char ch1[] = "(())abc{[(])}";
    char ch2[] = "(()))abc{[]}";
    char ch3[] = "(()()abc{[]}";
    char ch4[] = "(())abc{[]()}";
    char *p;
    p = ch4;
    InitStack(&stack);
    MatchBrackets(&stack,p);




}
int main()
{
    test();
    return 0;
}
C语言详解括号匹配问题(栈的应用 ) 详细解释括号匹配算法,并用C语言实现 阅读详情

相关推荐

用c语言实现的括号匹配的源代码

void BracketMatch(char *str) { SeqStack S; int i; char ch; InitStack(S); for(i=0;str[i]!='\0';i++) { switch(str[i]) { case '(': case '[': case '{': Push(S,str[i]); break; case ')':if(IsEmpty(S)) { printf("\n右括号)多余!"); return;} else { GetTop(S,&ch); if(ch=='(') Pop(S,&ch); else { printf("\n对应的左右()括号不同类!"); return;} } break; case ']': if(IsEmpty(S)) { printf("\n右括号]多余!"); return;} else { GetTop(S,&ch); if(ch=='[') Pop(S,&ch); else { printf("\n对应的左右[]括号不同类!"); return;} } break; case '}': if(IsEmpty(S)) { printf("\n右括号}多余!"); return;} else { GetTop(S,&ch); if(ch=='{') Pop(S,&ch); else { printf("\n对应的左右{}括号不同类!"); return;} } break; } } if(IsEmpty(S)) printf("\n括号匹配!"); else printf("\n左括号多余!"); }

(C语言)括号匹配问题

题目描述 现在,有一行括号序列,里面只包含"(",")","[","]"四种符号,请你检查这行括号是否配对。 如:  []是匹配的  ([])[]是匹配的  ((]是不匹配的  ([)]是不匹配的  输入 第一行输入一个数N(0 输出 每组输入数据的输出占一行,如果该字符串中所含的括号是配对的,则输出Yes,如果不配对则输出No 样例输入 3 [

YiMo_Fan的博客 1万+

用C语言实现数据结构问题 括号匹配

用C语言实现数据结构问题 括号匹配

简单的括号匹配算法

 typedef char DataType;#include "SeqStack.h"#include#include#include#include#define LEFT_FUHAO "([{#define RIGHT_FUHAO ")]}>"#define  BUFFER_SIZE 1000char Buffer[BUFFER_SIZE];//是否为括号,不是返回-

bluesky12312388的专栏 1445

数学文化赏析MOOC笔记【2023】

深圳大学UOOC课程《数学文化赏析》课程笔记

simplenthpower的博客 1754

【智驾与大模型】端到端与多模态大模型的精彩之旅

智驾和大模型的回顾与展望。开头的笔者自述也说了些心窝子话,边缘计算的监管刻不容缓!

仿生实验室:从0到1,制作人脸表情交互机器人,记录过程,软硬件全部开源,与君共襄盛举! 1323

数据结构之SeqStack---堆栈应用---括号匹配问题

<br />SeqStack.h<br />#include "stdio.h" #include "math.h" typedef struct { DataType stack [MaxStackSize]; int top; } SeqStack; void StackInitiate(SeqStack *S) { S->top = 0; } int StackNotEmpty(SeqStack *S) { if (S->top <= 0) {

zhoulingjie311的专栏 1999

CMMI AIM 人工智能成熟度框架:31个过程域的157项AI实践集成

CMMI AIM人工智能成熟度框架为企业提供了系统化管理AI项目全生命周期的解决方案,包含31个过程域的157项AI实践。该框架通过四个演进阶段(混沌与风险、结构与凝聚、验证与信任、价值与增长),帮助组织建立可持续的AI能力成长路径,降低项目失败率并提升商业价值。

weixin_42613501的博客 362

数据结构之栈的应用:括号匹配问题

栈的应用括号匹配问题:原理:代码实现: 括号匹配问题: 原理: 1、括号匹配成功的情况:栈为空 2、括号匹配失败的情况:   a、下一个为右括号但是和栈顶左括号不匹配   b、下一个是右括号但栈以空   c、所有的空号都匹配完成后栈不空    代码实现: 1、方法一 bool isValid(char * s){ char *stack = (char*)malloc(strlen(s)...

千寻瀑 1826

CVAT实战:从零搭建高效数据标注流水线

本文详细介绍了如何使用CVAT搭建高效的数据标注流水线,从环境部署到团队协作,再到数据流转和质量把控,全面覆盖了数据标注的各个环节。CVAT作为一款开源的数据标注工具,支持多人协作和丰富的标注类型,特别适合遥感图像等复杂场景的标注需求。通过实战案例和技巧分享,帮助读者快速掌握CVAT的核心功能,提升标注效率。

weixin_30555125的博客 401

Code Composer Studio 12.0.0版本 官方例程导入实战指南

本文详细介绍了在Code Composer Studio 12.0.0版本中,如何利用内置的Resource Explorer工具高效导入官方例程的完整实战指南。通过分步讲解定位开发板、导入工程、配置编译器及调试验证等关键操作,帮助开发者快速上手TI微控制器开发,避免常见错误,有效提升学习与开发效率。

weixin_29169899的博客 126

栈的应用——括号匹配问题

栈的应用——括号匹配问题

weixin_45924062的博客 258

别再死磕GAN了!用PyTorch从零实现DDPM图像生成(附CIFAR-10完整代码)

本文详细介绍了如何使用PyTorch从零实现DDPM(Denoising Diffusion Probabilistic Models)图像生成模型,并在CIFAR-10数据集上进行训练和测试。通过对比GAN,DDPM展现出更稳定的训练过程和更高质量的生成效果。文章包含完整的代码实现、训练技巧和优化建议,帮助开发者快速掌握这一前沿的生成模型技术。

weixin_33720078的博客 632

编程基础 - 栈的应用 - 括号匹配问题(Bracket Matching)

使用栈实现括号匹配问题(Bracket Matching)

DarkRabbit的专栏 2008

大模型风电功率预测:短期,超短期,中长期的完整实现与代码详解

本文全面介绍了基于深度学习大模型的风电功率预测方法,涵盖超短期(15分钟-1小时)、短期(1-6小时)和中长期(1天-1周)三种时间尺度。文章详细阐述了数据准备与特征工程,包括数据收集、预处理和可视化分析。针对不同时间尺度,分别介绍了Temporal Fusion Transformer (TFT)、Informer和N-BEATS模型的构建、训练与评估方法,并提供了完整的开源代码实现。此外,文章还探讨了模型部署与生产环境集成,包括模型保存与加载、实时预测API以及模型监控与再训练。最后,文章总结了关键创新

专注AI大模型,软件混淆,授权 1907

【芯片设计- RTL 编译与仿真 1.2 -- Visualizer 常用使用命令】

打开波形后,如果想要看到所有信号的数据,可以点击下图中红框中的按钮,因为默认verdi 默认并不是显示所用信号。如果想统计某一个信号中有多少笔数据时,可以使用 Expression->Edege Count 功能。如下图所示,如果没有打开前导0的功能时,当某一笔数据位0时,只会显示1个0。如果需要将波形的数据导出到文本文件时,可以按照下面步骤进行。打开前导0功能之后,会根据数据位宽来显示对应0的个数。

CodingCos的博客 2051

栈应用之括号匹配问题

问题描述 括号匹配问题,即给定一段文本text,括号是否有正确匹配的问题。括号由一个开括号如"(“和一个闭括号”)“组成,相互对应。这里只考虑三种括号,即”()","[]","{}"。此外括号括起的片段,也可能会嵌套。 解决思路 这样就不难总结出检查括号配对的原则:从左到右遍历text时,遇到的闭括号应该与最近遇到的且尚未匹配的开括号配对。 由于括号的出现可能嵌套,需要逐对匹配,即当前闭括号应该与...

JohnJim的博客 1002

深度学习工具包 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")

栈的简单应用之括号匹配问题

栈的思想,最经典的问题之一——判断括号集是否有效

qq_62306969的博客 1783

Camera2Demo

在Camera2 的基础上进行封装,使得Camera2一堆初始化逻辑与Activity分离,降低耦合度,完成预览拍照并保存的操作

win10 跳过U8环境检测的IE WebControls.rar

win10 安装u8的时候 提示IE WebControls 不通过,这个工具可以欺骗u8的检查。 跳过U8环境检测的IE WebControls。提示导入失败后,重新检测通过。

数据结构之栈及栈的应用(括号匹配问题)

栈简介: 栈是一种特殊的线性表,其只允许在固定的一端进行插入和删除元素操作。进行数据插入和删除操作的一段称为栈顶,另一端称为栈底。不含任何元素的栈称为空栈,其特点为 先进后出。 栈功能:可以将数据从一种序列变为另一种序列 注:图片来自网络 #pragma once #define _CRT_SECURE_NO_WARNINGS 1 #include &lt;stdio.h&gt; ...

qq_39412582的博客 403

RU DOS版、EFI版32bit/64bit BIOS常用工具

DOS版、EFI版的RU工具,可用来查看IO、MEM、PCI、SMBIOS等资源。亲测在EFI SHELL下可用。

括号匹配问题:栈的巧妙应用与代码优化【栈、优化、哈希表】

括号匹配问题是一个典型的使用堆栈解决的问题。通过将左括号压入堆栈,然后在遇到相应的右括号时进行出栈匹配,我们可以有效地判断括号是否正确闭合。原始代码虽然已经完成了任务,但存在着冗长的 if-else 语句,不够优雅。通过使用哈希表存储括号对应关系,我们能够用更简洁的代码完成同样的功能,提高代码的可读性和维护性。括号匹配问题只是栈在算法中的一个小应用,栈还有许多其他强大的用途,如逆波兰表达式求值深度优先搜索等。掌握栈的基本操作和灵活应用,对于提升算法和数据结构的理解能力非常有帮助。

qq_22841387的博客 521

括号匹配问题——栈的应用

括号匹配问题 转自黑马教程 问题描述: 给定一个字符串,里边可能包含“()”和其它字符,编写程序检查字符串中的小括号是否成对出现。 例如: "(上海)(长安)":正确匹配 "上海((长安))":正确匹配 "上海(长安(北京)(深圳)南京):正确匹配 "上海(长安))":错误匹配 "((上海)长安":错误匹配 解题思路 利用栈来解决。遍历字符串,如果遇到"(",则将其压入栈中,如果遇到")",则做一个弹栈的动作,检查弹出的元素是否是"(",如果是则匹配成功,如果是null,则匹配错误。如果字符串遍

Darrennnn的博客 270

【栈的应用】括号匹配问题

{}:yes ():yes {([])}:yes (]:no … /*括号匹配问题*/ #include <iostream> #include <String.h> using namespace std; #define MaxSize 50 #define ElemType char typedef struct { ElemType data[MaxSize]={0}; int top;//栈顶“指针” 就指向栈顶元素,不是栈顶元素的下一位空白区域 }SqS

如是我闻__一时__的博客 257
上一篇: 栈的基本操作
下一篇: 栈的应用之逆波兰表达式求值
dream8834
博客等级 码龄9年 8粉丝 66原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明:

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

余额充值
⌂ 换网址