<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[m0_46449049的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/m0_46449049</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; m0_46449049]]></copyright><item><title><![CDATA[滑动按钮样式]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/120476565</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/120476565</guid><author>m0_46449049</author><pubDate>Sat, 25 Sep 2021 20:19:43 +0800</pubDate><description><![CDATA[最近工作时一直写一下公共的按钮模板样式，既然是通用的我们可以想想办法，一直用封装好的插件模板今天也尝试一下，给它抽象一下。
若不统一的时候
  #select-button{
            display: none;
        }
        .dot-button{
            width: 80px;
            display: inline-block;
            height: 35px;
            border-radiu]]></description><category></category></item><item><title><![CDATA[文件压缩和备份命令]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/118072700</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/118072700</guid><author>m0_46449049</author><pubDate>Sun, 20 Jun 2021 22:08:24 +0800</pubDate><description><![CDATA[文件压缩和备份命令
1，bzip2命令
bzip2 [命令]  [压缩文件]
说明：.bz2文件的压缩程序。bzip2采用新的压缩算法，若未加任何参数，bzip2压缩完文件后会产生.bz2的压缩文件，并删除原始的文件。

常用选项

-c或--stdout:将压缩或解压缩的结果送到标准输出
-d或--decompress：执行解压缩
-f或--force：压缩或者解压时，若输出文件与现有文件同名，覆盖现有文件
-k或--keep：bzip2在解压或解压缩后保留原始文件

2，gzip命令
gzip[命令] ]]></description><category></category></item><item><title><![CDATA[Linux文件系统的目录结构]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/118068900</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/118068900</guid><author>m0_46449049</author><pubDate>Sun, 20 Jun 2021 13:55:58 +0800</pubDate><description><![CDATA[Linux文件系统的目录结构按照发行版本不同会有一些小差异，但总体来说差异不大。

/bin目录：存放二进制可执行文件
/home目录：用户主目录的基点目录，默认情况下每隔用户的主目录都在该目录下，如用户1 ./home/user1
/lib：存放表村程序设计库目录
/dev：存放设备文件目录，例如声卡，磁盘文件
/usr:为最庞大的目录
&nbsp;&nbsp;/usr/local/bin:存放本地增加的命令目录
&nbsp;&nbsp;/usr/local/lib:存放本地增加的库目录
&nbsp;&n]]></description><category></category></item><item><title><![CDATA[蛇形填数]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/111713730</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/111713730</guid><author>m0_46449049</author><pubDate>Sat, 26 Dec 2020 00:23:22 +0800</pubDate><description><![CDATA[/**
 * 在java中数组初始化为0，C需要初始化赋值；
 * 先定一个其实的坐标，这里以arr[0][0]开始
 * 通过while循环先判断，（数组未越界）再移动
 */
class Main {
    private static final Scanner scanner=new Scanner(System.in);
    public static void main(String[] args) {
        int n=scanner.nextInt();
        i.]]></description><category></category></item><item><title><![CDATA[leetcode 1009.十进制的反码]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/109757775</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/109757775</guid><author>m0_46449049</author><pubDate>Tue, 17 Nov 2020 23:20:32 +0800</pubDate><description><![CDATA[public class Main {
    public static void main(String[] args){
        int d=birnay(2);
        System.out.println(d);
    }
    //可以先从8来他反码与补码的规律
    //  8的原码    1000
    //  8的反码    0111
    //  将补码与原码相加会得到  1111
    //  我们思考每次增加2的n方增加1后小于n后就n++;这就好比左移运]]></description><category></category></item><item><title><![CDATA[Java创建 多人聊天室]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/109545920</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/109545920</guid><author>m0_46449049</author><pubDate>Sat, 07 Nov 2020 13:40:32 +0800</pubDate><description><![CDATA[先运行服务器端再运行客户端
//这是客户端
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.*;
import java.net.Socket;
import java.net.SocketException;
import]]></description><category></category></item><item><title><![CDATA[1027 打印沙漏 (20分)]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/109135700</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/109135700</guid><author>m0_46449049</author><pubDate>Sat, 17 Oct 2020 17:18:31 +0800</pubDate><description><![CDATA[import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        char s=in.next().charAt(0);
        in.close();
        int cnt=(n-1)/2;
        int i=3;
    ]]></description><category></category></item><item><title><![CDATA[c顺序栈 -实现迷宫]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/106676700</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/106676700</guid><author>m0_46449049</author><pubDate>Wed, 10 Jun 2020 22:38:55 +0800</pubDate><description><![CDATA[第一次写迷宫记录一下哈 以下是全部程序没有将每个步骤分成单个方法



#include&lt;stdio.h&gt;
#include&lt;iostream&gt;
using namespace std;
#define MAXSIZE 100
#define M 8
#define N 8

int mg[N + 2][M + 2] = { {1,2,1,1,1,1,1,1,1,1},
       {1,0,0,1,0,0,0,1,0,1},
 ...]]></description><category></category></item><item><title><![CDATA[实验11-2-4 删除单链表偶数节点 (20分)]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/106378012</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/106378012</guid><author>m0_46449049</author><pubDate>Wed, 27 May 2020 11:40:36 +0800</pubDate><description><![CDATA[struct ListNode createlist(){
&nbsp;&nbsp; struct ListNodehead=NULL,*xp,yp;
&nbsp;&nbsp; yp=head;
&nbsp;&nbsp;&nbsp; int number;
&nbsp;&nbsp;&nbsp; while(1){
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; scanf("%d",&amp;number);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;]]></description><category></category></item><item><title><![CDATA[实验7-1-6 求一批整数中出现最多的个位数字 (20分)]]></title><link>https://blog.youkuaiyun.com/m0_46449049/article/details/105768426</link><guid>https://blog.youkuaiyun.com/m0_46449049/article/details/105768426</guid><author>m0_46449049</author><pubDate>Sun, 26 Apr 2020 14:27:24 +0800</pubDate><description><![CDATA[实验7-1-6 求一批整数中出现最多的个位数字 (20分)

**
#include&lt;stdio.h&gt;
int main(int argc,char *argv[]){
    int n,no;
    int m;    
    ("%d",&amp;n);
    int a[10];    
    for(int i=0;i&lt;10;i++){        
    ...]]></description><category></category></item></channel></rss>