-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDeck.java
More file actions
83 lines (78 loc) · 1.55 KB
/
Copy pathDeck.java
File metadata and controls
83 lines (78 loc) · 1.55 KB
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
import java.util.ArrayList;
import java.util.List;
public class Deck
{
private int size;
private List<Card> deck;
public Deck(Rank[] rankies, Suit[] suities)
{
size = 52;
deck=new ArrayList<>();
for (Rank r : rankies)
{
for (Suit s : suities)
{
Card appendcard = new Card(r, s);
deck.add(appendcard);
}
}
shuffle();
}
public boolean isEmpty()
{
return size==0;
}
public int getSize()
{
return size;
}
public Card deal()
{
if (size == 0)
{
return null;
}
else
{
return deck.get(--size);
}
}
public void shuffle()
{
}
public void perfectShuffle()
{
size=52;
int k = 0;
int[] cards = new int[52];
int [] shuffled = new int[52];
for (int j = 0; j<=25; j++)
{
shuffled[k]=cards[j];
k=k+2;
}
k=1;
for (int j =26; j<=51; j++)
{
shuffled[k] = cards[j];
k=k+2;
}
}
public void inShuffle()
{
int k = 1;
int[] cards = new int[52];
int [] shuffled = new int[52];
for ( int j = 0; j<=24; j++)
{
shuffled[k] = cards[j];
k=k+2;
}
k = 0;
for (int j = 25; j<=51; j++)
{
shuffled[k] = cards[j];
k = k + 2;
}
}
}