LeetCode -- Factorial Trailing Zeroes

public class Solution {
    public int TrailingZeroes(int n) {
        var c = 0;
        var factor = 5;
		var end = int.MaxValue / 5;
        while(n >= factor && factor != int.MaxValue){
            c += n/factor;
			if(factor > end){
				factor = int.MaxValue;
			}
			else{
				factor *= 5;
			}
        }
		
		return c;
    }
}

LeetCode -- Factorial Trailing Zeroes

原文：http://blog.csdn.net/lan_liang/article/details/48896997