<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DNAXNA的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/DNAXNA</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DNAXNA]]></copyright><item><title><![CDATA[JAVA线程——抽奖问题]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/144286169</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/144286169</guid><author>DNAXNA</author><pubDate>Fri, 06 Dec 2024 11:09:12 +0800</pubDate><description><![CDATA[/ System.out.println("恭喜" + getName() + "抽到了" + prize + "元");System.out.println("抽奖箱1的总额是:"+sum+" 抽奖箱1的最大金额是："+max);System.out.println("抽奖箱2的总额是:"+sum+" 抽奖箱2的最大金额是："+max);System.out.println("抽奖箱1："+list1);System.out.println("抽奖箱2："+list2);]]></description><category></category></item><item><title><![CDATA[JAVA 线程问题——抢红包]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/144286063</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/144286063</guid><author>DNAXNA</author><pubDate>Fri, 06 Dec 2024 11:06:58 +0800</pubDate><description><![CDATA[System.out.println("很遗憾，" + getName() + "没有抢到红包");//第一个红包的金额最大为99.98，因为最小的一个红包金额为0.01。//就不需要，剩下的金额就得到是中奖的金额。//判断共享数据是否已经到了末尾（还没到末尾）//表示此时是最后一个红包。//判断共享数据是否已经到了末尾（已经到了末尾）//抢完了一个红包就少了一个红包。//判断共享数据是否已经到了末尾（还没到末尾）//红包已经为0，已经到了末尾。//100元，3个红包。//共享数据：100块，3个红包。]]></description><category></category></item><item><title><![CDATA[一个简单的布局作业]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/144067573</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/144067573</guid><author>DNAXNA</author><pubDate>Tue, 26 Nov 2024 20:31:55 +0800</pubDate><description><![CDATA[/现在往4个布局中放按钮。]]></description><category></category></item><item><title><![CDATA[GUI基础]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/144067286</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/144067286</guid><author>DNAXNA</author><pubDate>Tue, 26 Nov 2024 20:17:46 +0800</pubDate><description><![CDATA[package AWT_Demmon;

import java.awt.*;
import java.awt.event.WindowAdapter;
import java.awt.event.WindowEvent;

public class GridTest {
    public static void main(String[] args) {
        Frame f=new Frame("GridTest");

        // 创建按钮
        Button b1]]></description><category></category></item><item><title><![CDATA[面向对象：封装，继承，多态，]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/142921153</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/142921153</guid><author>DNAXNA</author><pubDate>Mon, 14 Oct 2024 16:03:35 +0800</pubDate><description><![CDATA[System.out.println(super.getName()+"是"+super.getColor()+"颜色的");System.out.println(super.getName()+"是"+super.getColor()+"颜色的");Animal cat = new Cat("小猫", "母", 2, 654321, "白色");System.out.println(super.getName()+"喜欢喵喵的叫");// 输出: 小狗是棕色颜色的。// 输出: 小猫喜欢喵喵的叫。]]></description><category></category></item><item><title><![CDATA[关于JAVA接口interface基础]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/142920150</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/142920150</guid><author>DNAXNA</author><pubDate>Mon, 14 Oct 2024 15:36:03 +0800</pubDate><description><![CDATA[System.out.println("正方形S1的面积是："+s1.area()+"\n正方形S1的周长是："+s1.perimeter());System.out.println("长方形S2的面积是："+s2.area()+"\n长方形S2的周长是："+s2.perimeter());System.out.println("圆柱体s4的面积是："+s4.area()+"\n圆柱体s4的周长是："+s4.perimeter());//计算正方形的面积和周长。}//该接口的作用：计算图形的面积和周长。]]></description><category></category></item><item><title><![CDATA[线索二叉树]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/140261911</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/140261911</guid><author>DNAXNA</author><pubDate>Mon, 08 Jul 2024 10:38:41 +0800</pubDate><description><![CDATA[NULL && pre->rch == NULL) { // 前驱节点的右孩子为空，设置线索。while (node->rtag == 1) { // 如果有后继线索，则直接访问后继节点。while (node->ltag == 0) { // 找到最左边的节点。if (p->lch == NULL) { // 左孩子为空，设置线索。// 全局变量pre，用于保存中序线索化过程中的前驱节点。// 中序遍历线索二叉树。// 创建线索二叉树。// 线索二叉树的节点结构。// 创建线索二叉树。]]></description><category></category></item><item><title><![CDATA[邻接表（C语言，c++）]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/139632312</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/139632312</guid><author>DNAXNA</author><pubDate>Wed, 12 Jun 2024 17:21:45 +0800</pubDate><description><![CDATA[/一开始是没有头节点的。for (i = 0;i++) {//输入顶点的值。//在数组中它的邻接点位置对应的下标。typedef struct ArcNode {//边节点。#include<iostream>//无向图的邻接表。//将新节点p1插入顶点v1的头部。int vexnum;]]></description><category></category></item><item><title><![CDATA[邻接矩阵（c语言，c++）]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/139632263</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/139632263</guid><author>DNAXNA</author><pubDate>Wed, 12 Jun 2024 17:20:17 +0800</pubDate><description><![CDATA[/输入两个顶点和边的权值,输入这两个点，意味着这两个顶点之间有关系。i++) {//查找顶点，所以要小于顶点个数vexnum。cout<< "边的条数为:" << g.arcnum<<endl;cout << "顶点的个数为:" << g.vexnum<<endl;cout << "顶点：" << g.vex[i]<<endl;//顶点数组，存放顶点的信息。//查找图g中的顶点u，存在则返回顶点表中的下标，否则返回-1。]]></description><category></category></item><item><title><![CDATA[二叉树的非递归遍历]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/139248211</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/139248211</guid><author>DNAXNA</author><pubDate>Mon, 27 May 2024 21:19:25 +0800</pubDate><description><![CDATA[/输出节点q的值，这里是中序遍历的访问地址。//将当前节点指针移动到节点q的右子节点，继续遍历右子树。//将当前辅助指针移动到其左子节点中，继续遍历左子树。// 将当前节点压入栈中 ，以便稍后访问其右子树。//从栈中输出一个节点，将他赋值给q。if (p) {//当前节点p不为空，则还要遍历左子树。else {//如果当前节点为空，表示左子树已经遍历完。cout << "请输入节点的值（#表示空节点）：";// 栈s为空且p为空时，while不工作。]]></description><category></category></item><item><title><![CDATA[二叉树的递归遍历]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/139248183</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/139248183</guid><author>DNAXNA</author><pubDate>Mon, 27 May 2024 21:18:36 +0800</pubDate><description><![CDATA[cout << "请按照前序输入二叉树的节点值（#代表空节点）：" << endl;if (cur->left) // 层次遍历，先输入左节点，再右边。cout << "请输入节点值（#代表空节点）：";cout << endl << "中序遍历：";cout << endl << "后序遍历：";cout << endl << "层级遍历：";]]></description><category></category></item><item><title><![CDATA[链队列及其操作]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/138747914</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/138747914</guid><author>DNAXNA</author><pubDate>Sun, 12 May 2024 10:25:04 +0800</pubDate><description><![CDATA[/q.front和q.rear都是QNode类型的，申请空间时不能用Link。printf("链队列的最大容量max=%d", max);]]></description><category></category></item><item><title><![CDATA[队列的操作]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/137886340</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/137886340</guid><author>DNAXNA</author><pubDate>Wed, 17 Apr 2024 19:52:43 +0800</pubDate><description><![CDATA[/求队列的长度一定是rear-top否则会出问题。//这样判断才不会多输出一个Queue is Empty，因为一开始就是rear=top。]]></description><category></category></item><item><title><![CDATA[两个链表的合并]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/137571127</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/137571127</guid><author>DNAXNA</author><pubDate>Wed, 10 Apr 2024 00:00:08 +0800</pubDate><description><![CDATA[/按照这个写法，lc是指向头节点的，那么输出就不对，因为头结点的date域是没有值的。void combine(list a, list b, list &c) {//因为要对c进行修改，所以不能只传参，而是要引用。//要将list lc = c;void tail(list p, int max) {//不对p进行修改，所以不用&2.主函数中lc 要指向链表c的next的date域才有数据，因为链表c有头指针，为空。cout << "当前i:" << i << '\n';]]></description><category></category></item><item><title><![CDATA[栈的数制转换]]></title><link>https://blog.youkuaiyun.com/DNAXNA/article/details/137537904</link><guid>https://blog.youkuaiyun.com/DNAXNA/article/details/137537904</guid><author>DNAXNA</author><pubDate>Tue, 09 Apr 2024 09:46:29 +0800</pubDate><description><![CDATA[void conversion(stack &s,int n,int m) {//n为输入的十进制的数,m为要转化的进制。4.栈s的top指针指向的是栈顶元素的上一个数，所以  e = *--s.top;//e没有初始化就对它赋值，将其初始化为0；3.在conversion函数中对pop函数调用时，要对e初始化，比如e=0；printf("转化后的数为：%d\n", e);2.判断一个栈是否为空时，只用判断栈顶指针和栈低指针是否相等。//删除栈顶元素，用e返回值。//判断一个栈是否为空。]]></description><category></category></item></channel></rss>