leetcode 592. Fraction Addition and Subtraction

Given a string representing an expression of fraction addition and subtraction, you need to return the calculation result in string format. The final result should be irreducible fraction(不可约分数). If your final result is an integer, say 2, you need to change it to the format of fraction that has denominator 1. So in this case, 2 should be converted to 2/1.

Example 1:

Input:"-1/2+1/2"
Output: "0/1"

Example 2:

Input:"-1/2+1/2+1/3"
Output: "1/3"

Example 3:

Input:"1/3-1/2"
Output: "-1/6"

Example 4:

Input:"5/3+1/3"
Output: "2/1"

Note:

1. The input string only contains '0' to '9', '/', '+' and '-'. So does the output.
2. Each fraction (input and output) has format ±numerator/denominator. If the first input fraction or the output is positive, then '+' will be omitted.
3. The input only contains valid irreducible fractions, where the numerator and denominator of each fraction will always be in the range [1,10]. If the denominator is 1, it means this fraction is actually an integer in a fraction format defined above.
4. The number of given fractions will be in the range [1,10].
5. The numerator and denominator of the final result are guaranteed to be valid and in the range of 32-bit int.

我的方法是用数组把符号、分子、分母记录下来，然后再计算。

package leetcode;

public class Fraction_Addition_and_Subtraction_592 {

	public String fractionAddition(String expression) {
		int fenshuPointer=0;
		int fuhaoPointer=0;
		int[] fenzi=new int[11];
		int[] fenmu=new int[11];
		char[] fuhao=new char[11];
		char[] chars=expression.toCharArray();
		if(chars[0]=='-'){
			fuhao[0]='-';			
			expression=expression.substring(1);
		}
		else{
			fuhao[0]='+';
		}
		fuhaoPointer++;
		for(int i=1;i<chars.length;i++){//将所有符号存入fuhao[]，以便之后的计算
			if(chars[i]=='+'||chars[i]=='-'){
				fuhao[fuhaoPointer]=chars[i];
				fuhaoPointer++;
			}
		}
		String[] fenshus=expression.split("\\+|-");
		for(int i=0;i<fenshus.length;i++){
			String[] it=fenshus[i].split("/");
			fenzi[fenshuPointer]=Integer.parseInt(it[0]);
			fenmu[fenshuPointer]=Integer.parseInt(it[1]);
			fenshuPointer++;
		}
		int production=1;
		for(int i=0;i<fenshuPointer;i++){
			production=production*fenmu[i];
		}
		int lastFenzi=0;
		for(int i=0;i<fenshuPointer;i++){
			int theFenzi=production/fenmu[i]*fenzi[i];
			if(fuhao[i]=='+'){
				lastFenzi+=theFenzi;
			}
			else{
				lastFenzi-=theFenzi;
			}
		}
		if(lastFenzi==0){
			return "0/1";
		}
		String lastFuhao="";
		if(lastFenzi<0){
			lastFuhao="-";
			lastFenzi=-lastFenzi;
		}
		if(lastFenzi%production==0){
			return lastFuhao+(lastFenzi/production)+"/1";
		}
		int zuidagongyueshu=maxCommonDivisor2(production, lastFenzi);
		lastFenzi=lastFenzi/zuidagongyueshu;
		production=production/zuidagongyueshu;
		return lastFuhao+lastFenzi+"/"+production;		
	}
	
	//得到两个数的最大公约数
	public int maxCommonDivisor2(int m, int n) {  
		  
        if (m < n) {// 保证m>n,若m<n,则进行数据交换  
            int temp = m;  
            m = n;  
            n = temp;  
        }  
        while (m % n != 0) {// 在余数不能为0时,进行循环  
            int temp = m % n;  
            m = n;  
            n = temp;  
        }  
        return n;// 返回最大公约数  
    }  

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Fraction_Addition_and_Subtraction_592 f=new Fraction_Addition_and_Subtraction_592();
		System.out.println(f.fractionAddition("5/3+1/3"));
	}

}

大神是从左到右，一个个地处理每个分数，往结果上加或减，解法很是简洁。

public String fractionAddition(String expression) {
    String[] fracs = expression.split("(?=[-,+])"); // splits input string into individual fractions
    String res = "0/1";
    for (String frac : fracs) res = add(res, frac); // add all fractions together
    return res;
}

public String add(String frac1, String frac2) {
    int[] f1 = Stream.of(frac1.split("/")).mapToInt(Integer::parseInt).toArray(), 
          f2 = Stream.of(frac2.split("/")).mapToInt(Integer::parseInt).toArray();
    int numer = f1[0]*f2[1] + f1[1]*f2[0], denom = f1[1]*f2[1];
    String sign = "";
    if (numer < 0) {sign = "-"; numer *= -1;}
    return sign + numer/gcd(numer, denom) + "/" + denom/gcd(numer, denom); // construct reduced fraction
}

// Computes gcd using Euclidean algorithm
public int gcd(int x, int y) { return x == 0 || y == 0 ? x + y : gcd(y, x % y); }