zoukankan      html  css  js  c++  java
  • 第十四周项目6-阅读程序

    #include <iostream>
    using namespace std;
    int main()
    {
     int a [6]={2,-3,4,-6,-8,10}, i;
     for (i=0;i<6;i++)
      {
        if(a[i]<0) continue;
        cout<<a[i]<<"  ";
      }
      cout<<endl;
      return 0;
    }

    #include <iostream>
    using namespace std;
    int  main( ){
       int  y=53,i=0,j,a[8];
        do
        {  
            a[i++]=y%2; 
            y=y/2;
        }while(y!=0) ;
        for(j=i-1;j>=0;j--) 
           cout<<a[j];
        cout<<endl;
        return 0;
    }




    #include <iostream>
    using namespace std;
    int  main( ){ 
       char  ch[]={"12yue25ri"};
       int   i,s=0;
       for(i=0;ch[i]>='0' && ch[i]<='9';i++)
           s=10*s+ch[i]-'0';
       cout<<s<<endl;
       return 0;
    }

    #include <iostream>
    using namespace std;
    int  main( )
    { 
     int n=0; 
     char str[80]="Beijing-China 2008";
     cout<<str<<endl;
     while(str[n]!='')
       str[n++]=str[n]>='a'&&str[n]<='z'?str[n]-'a'+'A':str[n];
     cout<<str<<endl;
     return 0;
    }


    #include <iostream>
    using namespace std;
    int  main( )
    { 
        int x[2][3]={5,4,6,7,8,9};
        int m[2],i,j;
        for (i=0;i<2;i++)
        {
           m[i]=x[i][0];
           for(j=1;j<3;j++)
                if(x[i][j]<m[i]) m[i]=x[i][j];
        }
        for (i=0;i<2;i++)
            cout<<m[i]<<endl;
        return 0;
    }



    #include <iostream>
    using namespace std;
    int  main( )
    { 
     int a[4][4]={1,2,4,7,2,3,5,8,4,5,6,9,7,8,9,10};
     int i,j,found=0;
     for(i=0;j<4;i++)
     for(j=0;j<=i;j++)
        if(a[i][j]!=a[j][i])
        {
           found=1;
           break;
        }
     if(found)  cout<<"No!"<<endl;
     else  cout<<"Yes!"<<endl;
     return 0;
    }


    #include <iostream>
    #include <iomanip>
    using namespace std;
    int main()
    {
        int a[5][5]={0},i,j,k;
        k=1;
        for (i=0;i<5;i++)
           for (j=i;j>=0;j--)
              a[j][i-j]=k++;
        for (i=0;i<5;i++)
        {
            for (j=0;j<5-i;j++)
               cout<<setw(4)<<a[i][j];
            cout<<endl;
        }
        return 0;
    }


    #include <iostream>
    using namespace std;
    void reverse(int a[],int n);
    int  main( )
    { 
       int  b[10]={1,2,3,4,5,6,7,8,9,10}; 
       int i,s=0;
       reverse(b,8);
       for(i=5;i<10;i++) s+=b[i];
       cout<<s<<endl;
       return 0;
    }
    void reverse(int a[],int n)
    {
       int  i,t;
       for(i=0;i<n/2;i++)
       {
         t=a[i];  a[i]=a[n-1-i];  a[n-1-i]=t;
       }
    }

    #include <iostream>
    using namespace std;
    void f(int a[],int i,int j);
    int  main( )
    { 
       int  b[10]={1,2,3,4,5,6,7,8,9,10}; 
       int i,s=0;
       f(b,0,9);
       for(i=5;i<10;i++) s+=b[i];
           cout<<s<<endl;
       return 0;
    }
    void f(int a[],int i,int j)
    {  
        int  t;
        if(i<j)
        {  
            t=a[i]; a[i]=a[j];a[j]=t;
            f(a,i+1,j-1);
        }
    }


    #include <iostream>
    using namespace std;
    int f(int n);
    int main()
    {
       cout<<f(5)<<”   “;
       cout<<f(8)<<endl;
       return 0;      
    }
    
    
    int f(int n)
    {
       static int a=2;
       int b=0;
       a+=n;
       b+=a;
       return b;
    }



    @ Mayuko

  • 相关阅读:
    平衡二叉树之RB树
    平衡二叉树之AVL树
    实现哈希表
    LeetCode Median of Two Sorted Arrays
    LeetCode Minimum Window Substring
    LeetCode Interleaving String
    LeetCode Regular Expression Matching
    PAT 1087 All Roads Lead to Rome
    PAT 1086 Tree Traversals Again
    LeetCode Longest Palindromic Substring
  • 原文地址:https://www.cnblogs.com/mayuko/p/4567602.html
Copyright © 2011-2022 走看看