worms eat leaves|Uneaten Leaves – HackerEarth - Zenefits


https://crypticarticles.wordpress.com/2015/08/10/uneaten-leaves-hackerearth-interview-question/
K caterpillars are eating their way through N leaves. Each caterpillar falls from leaf to leaf in a unique sequence.All caterpillars start at a twig in position 0 and fall onto the leaves at positions between 1 and N. Each caterpillar i has an associated ‘jump-number’ A . A caterpillar with jump number j eats leaves at positions that are multiples of j. It will proceed in the order j, 2j, 3j, … till it reaches the end of the leaves, then it stops and builds its cocoon.
Given a set A of K elements, K ≤ 15, N ≤ 10 , we need to determine the number of uneaten leaves.
Input Format:
N = number of leaves
K = number of caterpillars
A = Array of integer jump numbers (one per line).
Output Format:
An integer denoting the number of uneaten leaves.
Sample Input:
10
3

2

4

5

Sample Output:

4
Explanation
[2,4,5] is the 3-member set of jump numbers. All leaves which are multiples of 2, 4, and 5 are eaten. Leaves 1,3,7,9 are left, and they number 4.
    public static void main(String[] args) {
        // Read Input
        Scanner scanner = new Scanner(System.in);
        System.out.println("Input Total Number of Leaves");
        int N = scanner.nextInt();
        int balanceN = N;
        System.out.println("Enter total number of Caterpillars");
        int K = scanner.nextInt();
        int[] A = new int[K];
 
        System.out.println("Array of integer jump numbers (one per line).");
        for (int i = 0; i < K; i++) {
            A[i]=scanner.nextInt();
            int gcd=A[i];
            for (int j = 0; j <=i && balanceN>0; j++) {
                gcd = findGCD(A[j],A[i]);
                if (gcd>1&& gcd<A[i]){
                    break;
                }
            }
            if (gcd==A[i]){
                balanceN=balanceN-(N/A[i]);
                HashSet<Integer> commonMultiples = new HashSet<Integer>();
                for (int j = 0; j <i ; j++) {
                   int lcm = lcm(A[j],A[i]);
 
                     while (lcm<=N){
                        commonMultiples.add(lcm);
                        lcm+=lcm;
                         
                    }
                }
                balanceN+=commonMultiples.size();
            }
 
        }
        System.out.println("Balance " + balanceN);
 
 
    }
 
    private static int lcm(int a, int b)
    {
        return a * (b / findGCD (a, b));
    }
 
    private static int findGCD(int number1, int number2) {
    //base case
        if(number2 == 0)
        {
            return number1;
        }
 
        return findGCD(number2, number1%number2);
    }

http://www.1point3acres.com/bbs/thread-145290-1-1.html
第二题就是虫吃叶子的题 给定一个int作为叶子的数量,再给一个数组,其中每个数代表一个虫行走的步数, 求没有被吃掉的叶子数量。 比如n = 100, bug = {2,5}, 那么一百片叶子中号码是2或者5的倍数的叶子全部被吃掉了。

  1. int numberOfUneaten(int n, int[] p){
  2.                 // find non divisible numbers in p
  3.                 Arrays.sort(p);
  4.                 for (int i = 0; i < p.length; i++){
  5.                         for (int j = 0; j < i; j++){-google 1point3acres
  6.                                 if (p[j] != 0 && p[i] % p[j] == 0){
  7.                                         p[i] = 0;. from: 1point3acres.com/bbs 
  8.                                         break;
  9.                                 }
  10.                         }
  11.                 }
  12.                 // find lcm of numbers in p
  13.                 int l = 1;
  14.                 for (int i = 0; i < p.length; i++){. from: 1point3acres.com/bbs 
  15.                         if (p[i] != 0){
  16.                                 l = lcm(l, p[i]);
  17.                         }
  18.                 }
  19.                 int res = n % l;
  20.                 // find undivisible numbers from 1 to min(lcm, n)
  21.                 int[] mark = new int[Math.min(l, n) + 1];. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
  22.                 for (int i = 0; i < p.length; i++){. Waral 鍗氬鏈夋洿澶氭枃绔�,
  23.                         if (p[i] != 0){. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
  24.                                 for (int j = p[i]; j <= Math.min(l, n); j += p[i]){
  25.                                         mark[j] = 1;
  26.                                 }. Waral 鍗氬鏈夋洿澶氭枃绔�,
  27.                         }
  28.                 }
  29.                 int count = 0;
  30.                 int count1 = 0;
  31.                 for (int i = 1; i < Math.min(l, n); i++){
  32.                         if (mark[i] == 0){
  33.                                 count++;. 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
  34.                                 if (i <= res) count1++;. Waral 鍗氬鏈夋洿澶氭枃绔�,
  35.                         }
  36.                 }.1point3acres缃�
  37.                 . 1point 3acres 璁哄潧
  38.                 // find undivisible numbers from 1 to n
  39.                 if (n < l) return count;. 1point 3acres 璁哄潧
  40.                 else{
  41.                         return n / l * count + count1;
  42.                 }
  43.         }.鏈枃鍘熷垱鑷�1point3acres璁哄潧
  44.         int lcm(int a, int b){
  45.                 return a * b / gcd(a, b);
  46.         }
  47.         int gcd(int a, int b){. 1point 3acres 璁哄潧
  48.                 if (a < b) return gcd(b, a);
  49.                 return b == 0 ? a : gcd(b, a % b);. visit 1point3acres.com for more.
  50.         }
http://www.1point3acres.com/bbs/thread-133522-1-1.html
此题一开始用暴力法超时,后来用最小公因数最大公倍数的方法还是有几个case超时, 最后实在不想写就直接提交了。自己觉得这题代码写得很烂
        public static int eat2(int n, int[] b) {
                HashSet<Integer> set = new HashSet<Integer>();
                for (int x : b) {
                        boolean test = false;
                        for (int y : set) { 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. 
                                if (x % y == 0){
                                        test = true;
                                        break;
                                }
                                if (y % x == 0){
                                        test = true;
                                        set.remove(y);
                                        set.add(x);
                                        break;
                                }
                        }
                        if (!test) set.add(x);. more info on 1point3acres.com
                }
                
                int cm = 1;
                while (true) {
                        boolean test = true;
                        for (int x : set) {
                                if (x > cm || cm % x != 0) {
                                        test = false;
                                        break;
                                }
                        }
                        if (test) break;. visit 1point3acres.com for more.
                        cm++;
                }-google 1point3acres
                int count = 0;
                for (int i = 1; i <= cm; i++) {. more info on 1point3acres.com
                        boolean test = false;
                        for (int x : set) {. 鐗涗汉浜戦泦,涓€浜╀笁鍒嗗湴
                                if (i >= x && (i % x == 0)) {
                                        test = true;
                                        break;
                                }                
                        }
                        if (test) count++;
                }
                int time = n / cm;
                int rest = n % cm;. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
                int sum = time * count;
                
                for (int i = 1; i <= rest; i++) {. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
                        boolean test = false;
                        for (int x : set) {
                                if (i >= x && i % x == 0) {
                                        test = true;
                                        break;. 鍥磋鎴戜滑@1point 3 acres
                                }
. 鐣欏鐢宠璁哄潧-涓€浜╀笁鍒嗗湴
                        }
                        if (test) sum++; 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. 
                }
                return n - sum;
        }
https://github.com/xieqilu/Qilu-leetcode/blob/master/B227.UneatenLeaves.cs
public static int UneatenLeaves(int[] a, int num){
  int res = 0;
  int numOfSubsets = 1<<a.Length;
  for(int i=1;i<numOfSubsets;i++){
    int product=1;
    int s = CountOne(i) & 1==1? 1:-1;
    for(int j=0;j<a.Length;j++){
      if(1<<j & i==1)
        product*=a[j];
    }
    res+= s*num/product;
  }
  return num-res;
}

private static int CountOne(int n){
  int count=0;
  while(n>0){
    n = n & (n-1);
    count++;
  }
  return count;
}

Labels

LeetCode (1432) GeeksforGeeks (1122) LeetCode - Review (1067) Review (882) Algorithm (668) to-do (609) Classic Algorithm (270) Google Interview (237) Classic Interview (222) Dynamic Programming (220) DP (186) Bit Algorithms (145) POJ (141) Math (137) Tree (132) LeetCode - Phone (129) EPI (122) Cracking Coding Interview (119) DFS (115) Difficult Algorithm (115) Lintcode (115) Different Solutions (110) Smart Algorithm (104) Binary Search (96) BFS (91) HackerRank (90) Binary Tree (86) Hard (79) Two Pointers (78) Stack (76) Company-Facebook (75) BST (72) Graph Algorithm (72) Time Complexity (69) Greedy Algorithm (68) Interval (63) Company - Google (62) Geometry Algorithm (61) Interview Corner (61) LeetCode - Extended (61) Union-Find (60) Trie (58) Advanced Data Structure (56) List (56) Priority Queue (53) Codility (52) ComProGuide (50) LeetCode Hard (50) Matrix (50) Bisection (48) Segment Tree (48) Sliding Window (48) USACO (46) Space Optimization (45) Company-Airbnb (41) Greedy (41) Mathematical Algorithm (41) Tree - Post-Order (41) ACM-ICPC (40) Algorithm Interview (40) Data Structure Design (40) Graph (40) Backtracking (39) Data Structure (39) Jobdu (39) Random (39) Codeforces (38) Knapsack (38) LeetCode - DP (38) Recursive Algorithm (38) String Algorithm (38) TopCoder (38) Sort (37) Introduction to Algorithms (36) Pre-Sort (36) Beauty of Programming (35) Must Known (34) Binary Search Tree (33) Follow Up (33) prismoskills (33) Palindrome (32) Permutation (31) Array (30) Google Code Jam (30) HDU (30) Array O(N) (29) Logic Thinking (29) Monotonic Stack (29) Puzzles (29) Code - Detail (27) Company-Zenefits (27) Microsoft 100 - July (27) Queue (27) Binary Indexed Trees (26) TreeMap (26) to-do-must (26) 1point3acres (25) GeeksQuiz (25) Merge Sort (25) Reverse Thinking (25) hihocoder (25) Company - LinkedIn (24) Hash (24) High Frequency (24) Summary (24) Divide and Conquer (23) Proof (23) Game Theory (22) Topological Sort (22) Lintcode - Review (21) Tree - Modification (21) Algorithm Game (20) CareerCup (20) Company - Twitter (20) DFS + Review (20) DP - Relation (20) Brain Teaser (19) DP - Tree (19) Left and Right Array (19) O(N) (19) Sweep Line (19) UVA (19) DP - Bit Masking (18) LeetCode - Thinking (18) KMP (17) LeetCode - TODO (17) Probabilities (17) Simulation (17) String Search (17) Codercareer (16) Company-Uber (16) Iterator (16) Number (16) O(1) Space (16) Shortest Path (16) itint5 (16) DFS+Cache (15) Dijkstra (15) Euclidean GCD (15) Heap (15) LeetCode - Hard (15) Majority (15) Number Theory (15) Rolling Hash (15) Tree Traversal (15) Brute Force (14) Bucket Sort (14) DP - Knapsack (14) DP - Probability (14) Difficult (14) Fast Power Algorithm (14) Pattern (14) Prefix Sum (14) TreeSet (14) Algorithm Videos (13) Amazon Interview (13) Basic Algorithm (13) Codechef (13) Combination (13) Computational Geometry (13) DP - Digit (13) LCA (13) LeetCode - DFS (13) Linked List (13) Long Increasing Sequence(LIS) (13) Math-Divisible (13) Reservoir Sampling (13) mitbbs (13) Algorithm - How To (12) Company - Microsoft (12) DP - Interval (12) DP - Multiple Relation (12) DP - Relation Optimization (12) LeetCode - Classic (12) Level Order Traversal (12) Prime (12) Pruning (12) Reconstruct Tree (12) Thinking (12) X Sum (12) AOJ (11) Bit Mask (11) Company-Snapchat (11) DP - Space Optimization (11) Dequeue (11) Graph DFS (11) MinMax (11) Miscs (11) Princeton (11) Quick Sort (11) Stack - Tree (11) 尺取法 (11) 挑战程序设计竞赛 (11) Coin Change (10) DFS+Backtracking (10) Facebook Hacker Cup (10) Fast Slow Pointers (10) HackerRank Easy (10) Interval Tree (10) Limited Range (10) Matrix - Traverse (10) Monotone Queue (10) SPOJ (10) Starting Point (10) States (10) Stock (10) Theory (10) Tutorialhorizon (10) Kadane - Extended (9) Mathblog (9) Max-Min Flow (9) Maze (9) Median (9) O(32N) (9) Quick Select (9) Stack Overflow (9) System Design (9) Tree - Conversion (9) Use XOR (9) Book Notes (8) Company-Amazon (8) DFS+BFS (8) DP - States (8) Expression (8) Longest Common Subsequence(LCS) (8) One Pass (8) Quadtrees (8) Traversal Once (8) Trie - Suffix (8) 穷竭搜索 (8) Algorithm Problem List (7) All Sub (7) Catalan Number (7) Cycle (7) DP - Cases (7) Facebook Interview (7) Fibonacci Numbers (7) Flood fill (7) Game Nim (7) Graph BFS (7) HackerRank Difficult (7) Hackerearth (7) Inversion (7) Kadane’s Algorithm (7) Manacher (7) Morris Traversal (7) Multiple Data Structures (7) Normalized Key (7) O(XN) (7) Radix Sort (7) Recursion (7) Sampling (7) Suffix Array (7) Tech-Queries (7) Tree - Serialization (7) Tree DP (7) Trie - Bit (7) 蓝桥杯 (7) Algorithm - Brain Teaser (6) BFS - Priority Queue (6) BFS - Unusual (6) Classic Data Structure Impl (6) DP - 2D (6) DP - Monotone Queue (6) DP - Unusual (6) DP-Space Optimization (6) Dutch Flag (6) How To (6) Interviewstreet (6) Knapsack - MultiplePack (6) Local MinMax (6) MST (6) Minimum Spanning Tree (6) Number - Reach (6) Parentheses (6) Pre-Sum (6) Probability (6) Programming Pearls (6) Rabin-Karp (6) Reverse (6) Scan from right (6) Schedule (6) Stream (6) Subset Sum (6) TSP (6) Xpost (6) n00tc0d3r (6) reddit (6) AI (5) Abbreviation (5) Anagram (5) Art Of Programming-July (5) Assumption (5) Bellman Ford (5) Big Data (5) Code - Solid (5) Code Kata (5) Codility-lessons (5) Coding (5) Company - WMware (5) Convex Hull (5) Crazyforcode (5) DFS - Multiple (5) DFS+DP (5) DP - Multi-Dimension (5) DP-Multiple Relation (5) Eulerian Cycle (5) Graph - Unusual (5) Graph Cycle (5) Hash Strategy (5) Immutability (5) Java (5) LogN (5) Manhattan Distance (5) Matrix Chain Multiplication (5) N Queens (5) Pre-Sort: Index (5) Quick Partition (5) Quora (5) Randomized Algorithms (5) Resources (5) Robot (5) SPFA(Shortest Path Faster Algorithm) (5) Shuffle (5) Sieve of Eratosthenes (5) Strongly Connected Components (5) Subarray Sum (5) Sudoku (5) Suffix Tree (5) Swap (5) Threaded (5) Tree - Creation (5) Warshall Floyd (5) Word Search (5) jiuzhang (5)

Popular Posts