zoukankan      html  css  js  c++  java
  • gravity

    1. #include <stdio.h>
      
      #include<stdlib.h>
      
      #include<string.h>
      
      int num[10];
      
      int test_main(int data[9]);
      
      //void build_data(int data[100])
      
      //{
      
      // for(int i=0;i<100;i++)
      
      // {
      
      //  data[i]=rand()%101;
      
      // }
      
      //}
      
      void main(void) {
      
         int data[9]={7,4,2,0,0,6,0,7,0};
      
         for(int l=0;l<10;l++)  {  
      
       //build_data(data);   
      
        printf("%d
      ",test_main(data));  }
      
      }
      
       
      
      int test_main(int data[9]) {  
      
        int m,n,a,max;  
      
        memset(num,0,sizeof(num));  
      
        for(m=0;m<9;m++)  {   
      
            /*n=m+1;*/   
      
            /*while(data[m]>data[n])   {    
      
            n++;   
      
            num[m]++;   }*/   
      
            for( n=m+1;n<9;n++)   {   
      
              if(data[m]>data[n])     
      
              num[m]++;   }  }
      
         for(a=0,max=0;a<10;a++)  {   
      
          if(num[a]>max)   {    
      
          max=num[a];   }   
      
          else{max=max;}
      
       }  
      
      return max; }

      there is a room where boxes are stacked.If a room is rotated 90 degrees to the right,boxes will fall,affected by gravity.Write a c function which finds out a box which will have the longest 'fall distance',and returns the value of the longest 'fall distance'.

    2. 找出数组里最大的数
  • 相关阅读:
    论语言思维的差异
    lua经典问题
    跳槽的故事
    未来一年计划
    腾讯面试题 找重复的数
    nodejs学习
    node记录
    mysql 常用总结
    ubuntu 服务器搭建汇总
    ubuntu下安装golang
  • 原文地址:https://www.cnblogs.com/ZzznOoooo/p/6626562.html
Copyright © 2011-2022 走看看