zoukankan      html  css  js  c++  java
  • Java小程序1(2015-8-13)

    1、

    public class Test1{      

      public static void main(String [] args){          

    /*                        int sum=0;           

    for(int i=0;i<=100;i++){                 

    if(i%2!=0){                    

    sum+=i*i;                 

    }           

    }           

    System.out.println("求1*1+3*3+5*5+7*7+9*9...+99*99之和是:"+sum);           */                

       int sum=0;          

    for(int i=1;i<100;i+=2){                           

       sum+=i*i;          

    }         

      System.out.println(sum);             

    }}

    2、

    public class Test2{      

      public static void main(String [] args){          

    //关键处:sum是double类型,否则会丢失精度。。                  

       /*    double sum=0;

               for(int i=0;i<=40;i++){             

         if(i%2!=0){                

         sum=sum+1.0/i;               

       }         

       }         

       System.out.println("1+1/3+1/5+...的前20项之和是:"+sum);    */

             double sum = 0;  

     for(double i=1;i<=40;i=i+2){    

    sum = sum +1/i;  

     }  

     System.out.println("sum:"+sum);

    }}

  • 相关阅读:
    LeetCode-49. Group Anagrams
    LeetCode-242.Valid Anagram
    LeetCode-239.Sliding Window Maximum
    LeetCode-703. Kth Largest Element in a Stream
    LeetCode-225.Implement Stack using Queues
    LeetCode-232.Implement Queue using Stacks
    LeetCode-25. Reverse Nodes in k-Group
    LeetCode-142.Linked List Cycle II
    LeetCode-141. Linked List Cycle
    LeetCode-24.Swap Nodes in Pairs
  • 原文地址:https://www.cnblogs.com/Ly426/p/4726650.html
Copyright © 2011-2022 走看看