[LintCode] Trailing Zeros

阿新 • • 發佈：2017-06-02

time clas content esc ont nbsp cnblogs ret panel

Write an algorithm which computes the number of trailing zeros in n factorial.

Example

11! = 39916800, so the out should be 2

Challenge O(log N) time

 1 class Solution {
 2     public long trailingZeros(long n) {
 3         long cnt = 0;
 4         while(n != 0){
 5             cnt += n / 5;
 
 6             n = n / 5;
 7         }
 8         return cnt;
 9     }
10 }

[LintCode] Trailing Zeros

time clas content esc ont nbsp cnblogs ret panel Write an algorithm which computes the number of trailing zeros in n factorial. Exa

[Algorithm] 2. Trailing Zeros

Description Write an algorithm which computes the number of trailing zeros in n factorial. Example 11! = 39916800, s

LintCode - Move Zeros

解法一 class Solution { public: void moveZeroes(vector<int>& nums) { int left = 0, right = 0; while (right < nums.size

[CareerCup] 17.3 Factorial Trailing Zeros 求階乘末尾零的個數

解法一： int trailing_zeros(int n) { int res = 0; while (n) { res += n / 5; n /= 5; } return res; } 解法二：

[LintCode] Set Matrix Zeros

b- ems gin cor counter best which bool rect Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in plac

【LintCode】060.Search Insert Position

spa posit art you sta ger har duplicate earch 題目： Given a sorted array and a target value, return the index if the target is found. If no

【Lintcode】074.First Bad Version

ota class base found sed follow ntc art spa 題目： The code base version is an integer start from 1 to n. One day, someone committed a bad v

【Lintcode】038.Search a 2D Matrix II

ger class duplicate ntc sts ram public win param 題目： Write an efficient algorithm that searches for a value in an m x n matrix, return th

【Lintcode】069.Binary Tree Level Order Traversal

vector pub i++ pre oot order ptr values logs 題目： Given a binary tree, return the level order traversal of its nodes‘ values. (ie, from le

【Lintcode】098.Sort List

col || lin lex strong span tro con pre 題目： Sort a linked list in O(n log n) time using constant space complexity. Example Given 1->3-

【Lintcode】102.Linked List Cycle

node false col lint tro head -s tno cycle 題目： Given a linked list, determine if it has a cycle in it. Example Given -21->10->4->

【Lintcode】099.Reorder List

ive strong linked size reorder right find lan second 題目： Given a singly linked list L: L0 → L1 → … → Ln-1 → Ln reorder it to: L0 → Ln → L

【Lintcode】105.Copy List with Random Pointer

map class node link listnode span public point turn 題目： A linked list is given such that each node contains an additional random pointer

[LintCode] 618 Search Graph Nodes 解題報告

and value integer search values tee esc mapping ppi DescriptionGiven a undirected graph, a node and a target, return the nearest node to

[LintCode] 574 Build Post Office II

emp span oid short one sem his code it is Problem Given a 2D grid, each cell is either a wall 2, an house 1 or empty 0 (the number zero,

[LintCode] 599 Insert into a Cyclic Sorted List 解題報告

blog same ted next rom list ron div ger DescriptionGiven a node from a cyclic linked list which has been sorted, write a function to inse

【Lintcode】029.Interleaving String

ngs logs eth str tro determine span lintcode return 題目： Given three strings: s1, s2, s3, determine whether s3 is formed by the interlea

LintCode刷題筆記(九章ladder PartOne)--BugFree

-c bin urn return sea get light integer ram 九章ladder的前半部分刷題筆記，在這次二刷的時候補上~ @ 2017.05.21 141 - sqrtx 二分答案 --- binarySearch二分法 --- cla

【Lintcode】046.Majority Number

his oot log light ntc else white hit lte 題目： Given an array of integers, the majority number is the number that occurs more than half o

[LintCode] Decode Ways

ron ane con eterm number panel pre str using A message containing letters from A-Z is being encoded to numbers using the following mapp

[LintCode] Trailing Zeros

相關推薦