Java起步——分數四則運算

來源:互聯網
上載者:User

/*
* 程式的著作權和版本聲明部分
* Copyright (c) 2011, 煙台大學電腦學院學生
* All rights reserved.
* 檔案名稱:                             
* 作    者:        張傳新                    
* 完成日期:2012 年09 月17日
* 版 本 號:  J.1.03   

* 對任務及求解方法的描述部分
* 輸入描述:
* 問題描述:分數運算
* 程式輸出:
* 問題分析:……
* 演算法設計:……
*/

public class TestFractory {/** * @param args */public static void main(String[] args) {// TODO Auto-generated method stubfracAdd(1,5,7,20);//結果為:11/20fracSub(1,5,7,20);//分數相減fracMul(1,5,7,20);//分數相乘fractDiv(1,5,7,20);//分數相除}//分數相加static void fracAdd(int first_numerator,int first_denominator,int second_numrator,int second_denominator){//以下代碼能夠在控制台上顯示結果//需要調用求最大公約數的函數//需要調用求最小公倍數的函數int a = lcm(first_denominator,second_denominator);int numerator,denominator;numerator = first_numerator * ( a / first_denominator) + second_numrator * (a / second_denominator);denominator = a;int b = gcd(numerator,denominator);numerator = numerator / b;denominator = denominator / b;System.out.println(numerator+"/"+denominator);}//分數相減static void fracSub(int first_numerator,int first_denominator,int second_numrator,int second_denominator){int a = lcm(first_denominator,second_denominator);int numerator,denominator;numerator = first_numerator * ( a / first_denominator) - second_numrator * (a / second_denominator);denominator = a;int b = gcd(numerator,denominator);numerator = numerator / b;denominator = denominator / b;System.out.println(numerator+"/"+denominator);}//分數相乘static void fracMul(int first_numerator,int first_denominator,int second_numrator,int second_denominator){int numerator,denominator;numerator = first_numerator * second_numrator;denominator = first_denominator * second_denominator;int b = gcd(numerator,denominator);numerator = numerator / b;denominator = denominator / b;System.out.println(numerator+"/"+denominator);}//分數相除static void fractDiv(int first_numerator,int first_denominator,int second_numrator,int second_denominator){int numerator,denominator;numerator = first_numerator * second_denominator;denominator = first_denominator * second_numrator;int b = gcd(numerator,denominator);numerator = numerator / b;denominator = denominator / b;System.out.println(numerator+"/"+denominator);}//判斷數的大小static int min(int m,int n){if(m > n){    return n;}else{    return m;}}//最大公約數static int gcd(int m,int n){      min(m,n);int s = 1;for(int i = 2;i <= min(m,n);i ++){for(int j = 2;j <= i;j++){    if(m % j == 0 && n % j == 0){    m = m / j;    n = n / j;    s = s * j;    }}}return s;}//最小公倍數static int lcm(int m,int n){                  int b = gcd(m,n) * (m / gcd(m,n)) * (n / gcd(m,n));return b;}}

運行結果:

11/20
-3/20
7/100
4/7

經驗積累:

最近學習很鬆懈,自己越來越懶了。。。。只能期待自己快找回狀態。。。

其實Java並不難,只是學沒學的問題,現在很多不會,是因為沒學,學了就會了。

我決定了一個月內讀完《Java2實用教程》,拼了!!!!!

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.