<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zool66的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zool66</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zool66]]></copyright><item><title><![CDATA[【正则表达式从字符串中截取不以什么字符结尾的子串】]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/144341004</link><guid>https://blog.youkuaiyun.com/zool66/article/details/144341004</guid><author>zool66</author><pubDate>Mon, 09 Dec 2024 10:56:46 +0800</pubDate><description><![CDATA[你好！ 这是你第一次使用 Markdown编辑器 所展示的欢迎页。如果你想学习如何使用Markdown编辑器, 可以仔细阅读这篇文章，了解一下Markdown的基本语法知识。
我们对Markdown编辑器进行了一些功能拓展与语法支持，除了标准的Markdown编辑器功能，我们增加了如下几点新功能，帮助你用它写博客：撤销：Ctrl/Command + Z
重做：Ctrl/Command + Y
加粗：Ctrl/Command + B
斜体：Ctrl/Command + I
标题：Ctrl/Command + ]]></description><category></category></item><item><title><![CDATA[2021-11-10]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/121249221</link><guid>https://blog.youkuaiyun.com/zool66/article/details/121249221</guid><author>zool66</author><pubDate>Wed, 10 Nov 2021 15:23:43 +0800</pubDate><description><![CDATA[从两个袋子里摸球
详情请见[蓝桥杯2016决赛]随意组合
 static void bfs(array a[], array b[], int c, List&lt;int[]&gt;lists, List&lt;Integer&gt;list, Map&lt;String,Integer&gt;hashmap){
        if (c==4)
        {
            int t[]=new int[4];
            for (int ti=0;ti&lt;4;ti+]]></description><category></category></item><item><title><![CDATA[2021-11-01]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/121079419</link><guid>https://blog.youkuaiyun.com/zool66/article/details/121079419</guid><author>zool66</author><pubDate>Mon, 01 Nov 2021 14:23:16 +0800</pubDate><description><![CDATA[全排列不重复
static void bfs(List&lt;Integer&gt; a, List&lt;List&lt;Integer&gt;&gt; lists, List&lt;Integer&gt; list, int i) {
        if (i == 8) {
            lists.add(new ArrayList&lt;&gt;(list));
        } else {
            for (int j = 0; j &lt; a.size(); ]]></description><category></category></item><item><title><![CDATA[2021-10-19]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/120855458</link><guid>https://blog.youkuaiyun.com/zool66/article/details/120855458</guid><author>zool66</author><pubDate>Tue, 19 Oct 2021 21:38:16 +0800</pubDate><description><![CDATA[刷题心得2
public class lanjiao {

    public static void main(String args[]){
       char word[]=new char[19];//装着abcdefghijklmnopqrs
       for(int i=97;i&lt;=97+18;i++)
       {
           word[i-97]=(char) i;
       }
       char w[]=new char[2*19];//然后装106]]></description><category></category></item><item><title><![CDATA[2021-10-19]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/120854806</link><guid>https://blog.youkuaiyun.com/zool66/article/details/120854806</guid><author>zool66</author><pubDate>Tue, 19 Oct 2021 21:07:42 +0800</pubDate><description><![CDATA[刷题心得读取空白字符（蓝桥杯常用）
public class lanjiao {

    public static void main(String args[]){
        String s;
        List&lt;Integer&gt;list=new ArrayList&lt;&gt;();
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        for (int i=0;i&l]]></description><category></category></item><item><title><![CDATA[2021-06-07]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/117662701</link><guid>https://blog.youkuaiyun.com/zool66/article/details/117662701</guid><author>zool66</author><pubDate>Mon, 07 Jun 2021 15:17:52 +0800</pubDate><description><![CDATA[回溯=dfs+剪枝
力扣全排列
class Solution {
    public List&lt;List&lt;Integer&gt;&gt; permute(int[] nums) {
        List&lt;List&lt;Integer&gt;&gt; res = new ArrayList&lt;List&lt;Integer&gt;&gt;();

        List&lt;Integer&gt; output = new ArrayList&lt;Integer&gt;()]]></description><category></category></item><item><title><![CDATA[2021-06-07]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/117662267</link><guid>https://blog.youkuaiyun.com/zool66/article/details/117662267</guid><author>zool66</author><pubDate>Mon, 07 Jun 2021 15:10:20 +0800</pubDate><description><![CDATA[`class Solution {
public List&lt;List&gt; permute(int[] nums) {
List&lt;List&gt; res = new ArrayList&lt;List&gt;();
    List&lt;Integer&gt; output = new ArrayList&lt;Integer&gt;();
    for (int num : nums) {
        output.add(num);
    }

    int n = nums]]></description><category></category></item><item><title><![CDATA[2021-05-08]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/116535982</link><guid>https://blog.youkuaiyun.com/zool66/article/details/116535982</guid><author>zool66</author><pubDate>Sat, 08 May 2021 17:37:07 +0800</pubDate><description><![CDATA[求一个自然数的所有因子
#include&lt;iostream&gt;
#define ll long long
using namespace std;
int main(){
    long long b[10000];
    long long  a;
    int  k=0;
    int  count=0;
    cin &gt;&gt; a;
    for(long long  i=1;i*i&lt;=a;i++)
    {
        if(a%i==0)
        ]]></description><category></category></item><item><title><![CDATA[2021-05-08]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/116535861</link><guid>https://blog.youkuaiyun.com/zool66/article/details/116535861</guid><author>zool66</author><pubDate>Sat, 08 May 2021 17:34:33 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#define ll long longusing namespace std;int main(){    long long b[10000];    long long  a;    int  k=0;    int  count=0;    cin &gt;&gt; a;    for(long long  i=1;i*i&lt;=a;i++)    {        if(a%i==0)        {        b[k++]=i;     ]]></description><category></category></item><item><title><![CDATA[2020-12-13]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/111088578</link><guid>https://blog.youkuaiyun.com/zool66/article/details/111088578</guid><author>zool66</author><pubDate>Sun, 13 Dec 2020 09:47:59 +0800</pubDate><description><![CDATA[创建链表简洁易懂版

```  public ListNode create(int n) {

        ListNode head = null;

        ListNode p = null;

        ListNode r=null;

        for(int i=0;i&lt;n;i++) {

            p=new ListNode();

            p.next=null;

            p.val=1;

        ]]></description><category></category></item><item><title><![CDATA[2020-11-19]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109808756</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109808756</guid><author>zool66</author><pubDate>Thu, 19 Nov 2020 13:21:53 +0800</pubDate><description><![CDATA[多个数的最小公倍数
#include&lt;iostream&gt;
using namespace std;
int main()
{
    int a,b,c;
    cin &gt;&gt; a&gt;&gt;b&gt;&gt;c;
    int t=a*b*c;
    for(int i=1;i&lt;=t;i++){
        if(i%a==0&amp;&amp;i%b==0&amp;&amp;i%c==0)
        {
         cout &lt;&lt; i&l]]></description><category></category></item><item><title><![CDATA[2020-11-18]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109782681</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109782681</guid><author>zool66</author><pubDate>Wed, 18 Nov 2020 19:10:52 +0800</pubDate><description><![CDATA[希尔排序
//希尔排序
#include&lt;iostream&gt;
using namespace std;
void shellsort(int* a, int  n)
{
    int t;
    for (int k = 0; k &lt;sizeof(a); k++)
  {
    if(k+n&lt;sizeof(a))
    {
        for(int i = k; i &lt; sizeof(a); i = i + n)
        {
            for]]></description><category></category></item><item><title><![CDATA[2020-11-18]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109782588</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109782588</guid><author>zool66</author><pubDate>Wed, 18 Nov 2020 19:07:17 +0800</pubDate><description><![CDATA[快速排序
void qsort(int* a,int n)
{
    if(n&gt;1)
    {
    int  i=-1;
    int  j=0;
    int  k=n-1;
    int t;
    for(j=0;j&lt;n-1;j++)
    {
        if(a[j]&lt;a[k])
        {
            i++;
            t=a[j];a[j]=a[i];a[i]=t;
        }
    }
    t=a[i+]]></description><category></category></item><item><title><![CDATA[2020-10-30]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109392450</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109392450</guid><author>zool66</author><pubDate>Fri, 30 Oct 2020 20:23:02 +0800</pubDate><description><![CDATA[链表的删除
static student del(student p,int n)

    {



        student t=p;

        student r=null;

        while(t!=null){



        if(t.num==n)

        {

            if(t==p)

                p=p.next;

            else

                r.next=t.next;]]></description><category></category></item><item><title><![CDATA[2020-10-30]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109390832</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109390832</guid><author>zool66</author><pubDate>Fri, 30 Oct 2020 18:35:21 +0800</pubDate><description><![CDATA[辗转相除法求最大公约数
int Euclidean(int a,int b)
{
    int min=a&lt;b?a:b;
    int max=a&gt;b?a:b;
    int n=-1;
    while(n!=0)
    {
        n=max%min;
        max=min;
        min=n;
    }
    return max;
}


]]></description><category></category></item><item><title><![CDATA[2020-10-28]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109340186</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109340186</guid><author>zool66</author><pubDate>Wed, 28 Oct 2020 19:03:15 +0800</pubDate><description><![CDATA[高精加
int* add(int *a,int *b,int a_size,int b_size,int &amp;k)
{
    
    int *c=new int[N];
    int i=N/2+a_size,j=N/2+b_size;int n,d=0;
    int ma=max(a_size,b_size);
    for(k=0;k&lt;ma;k++)
    {
        n=(a[--i]+b[--j]+d);
        c[k]=n%10;
      d=n/]]></description><category></category></item><item><title><![CDATA[2020-10-28]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109339650</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109339650</guid><author>zool66</author><pubDate>Wed, 28 Oct 2020 18:46:34 +0800</pubDate><description><![CDATA[c++局部变量的回收机制
局部变量存放在栈中时离开作用域则被系统自动回收，若在堆中则不受作用域管理，不会被系统自动回收，例如new出来的空间只有在使用delete删除或者整个程序结束后才会释放掉。
#include
using namespace std;
int text()
{
intp=new int[3];
p[1]=2;
cout &lt;&lt; p[1] &lt;&lt; endl;
return p;
}
int main()
{
int*p=text();
cout &lt;&lt; p[]]></description><category></category></item><item><title><![CDATA[2020-10-27]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/109318245</link><guid>https://blog.youkuaiyun.com/zool66/article/details/109318245</guid><author>zool66</author><pubDate>Tue, 27 Oct 2020 18:57:59 +0800</pubDate><description><![CDATA[存储大数值
int bignum(int a[]){
char n;
int i=0;
n=cin.get();
while(n!=’\n’){
a[i++]=(int)n-48;
n=cin.get();
}
return i;
}

]]></description><category></category></item><item><title><![CDATA[2020-04-14]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/105513425</link><guid>https://blog.youkuaiyun.com/zool66/article/details/105513425</guid><author>zool66</author><pubDate>Tue, 14 Apr 2020 15:48:32 +0800</pubDate><description><![CDATA[#include
using namespace std;class bb;//只声明类而不定义它class yy{private:	int r;	int e;public:	yy()	{		r = 1;	}	friend bool operator &gt;(yy a,bb b);};class bb{private:	int e;public:	bb()	{		e = 2;	}	friend ...]]></description><category></category></item><item><title><![CDATA[2020-03-24]]></title><link>https://blog.youkuaiyun.com/zool66/article/details/105075730</link><guid>https://blog.youkuaiyun.com/zool66/article/details/105075730</guid><author>zool66</author><pubDate>Tue, 24 Mar 2020 17:03:33 +0800</pubDate><description><![CDATA[标题 哪种情况下派生类对象不能访问基类的公有成员
给定三个类a,b,c他们的关系是：a派生b派生c，也就是a是爷爷，b是爸爸，c是儿子，在主函数中定义一个c类对象，而这个对象不能访问a类的公有成员如函数，为什么会出现这种情况？

...]]></description><category></category></item></channel></rss>