Posts 001 Venn Diagram
Post
Cancel

001 Venn Diagram

Introduction

Venn Diagram. Complete each of the methods according to name and comments.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
import java.lang.*;
import java.util.*;
import java.lang.Math;
/**
 * @author  Don Allen
 */
class VennDiagram
{
    int[] numbers;
    
    public VennDiagram(int[] n)
    {
        numbers = n;
    }

    /*
     *   @return the number of values in numbers that are divisible by 2
     */
    public int numDivisibleBy2()
    {
      int ans = 0;
      for(int i = 0; i<numbers.length; i++)
      {
        if(numbers[i]%2==0)
        {
          ans++;
        }
      }

        return ans;
    }

    /*
     *   @return the number of values in numbers that are divisible by 3
     */
    public int numDivisibleBy3()
    {
      int ans = 0;
      for(int i = 0; i<numbers.length; i++)
      {
        if(numbers[i]%3==0)
        {
          ans++;
        }
      }

        return ans;
    }

    
    /*
     *   @return the number of values in numbers that are greater than 50
     */
    public int numGreaterThan50()
    {
      int ans = 0;
      for(int i = 0; i<numbers.length; i++)
      {
        if(numbers[i]>50)
        {
          ans++;
        }
      }

        return ans;
    }

    /*
     *   @return the number of values in numbers that are
     *            divisible by 2 and divisible by 3
     */
    public int numDivisibleBy2AndDivisibleBy3()
    {
        int ans = 0;
        for(int i = 0; i<numbers.length; i++)
        {
          if(numbers[i]%2==0 && numbers[i]%3==0)
          {
            ans++;
          }
        
        }
        
        return ans;
    }

    /*
     *   @return the number of values in numbers that are
     *            divisible by 2 and greater than 50
     */
    public int numDivisibleBy2AndGreaterThan50()
    {

        int ans = 0;
        for(int i = 0; i<numbers.length; i++)
        {
          if(numbers[i]%2==0 && numbers[i]>50)
          {
            ans++;
          }
        
        }
        
        return ans;
    }

    /*
     *   @return the number of values in numbers that are
     *            divisible by 3 and greater than 50
     */
    public int numDivisibleBy3AndGreaterThan50()
    {
        int ans = 0;
        for(int i = 0; i<numbers.length; i++)
        {
          if(numbers[i]%3==0 && numbers[i]>50)
          {
            ans++;
          }
        
        }
        
        return ans;
    }

    /*
     *   @return the number of values in numbers that are
     *            divisible by 2, divisible by 3 and greater than 50
     */
    public int numDivisibleBy2AndDivisibleby3AndGreaterThan50()
    {

        int ans = 0;
        for(int i = 0; i<numbers.length; i++)
        {
          if(numbers[i]%2==0 &&numbers[i]%3==0 && numbers[i]>50)
          {
            ans++;
          }
        
        }
        
        return ans;
    }
}
This post is licensed under CC BY 4.0