Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package encapsulation;
- import java.util.ArrayList;
- public class CardDeck {
- ArrayList<Card> cards = new ArrayList<Card>();
- char[] farger = {'S','H','D','C'};
- public CardDeck(int n) {
- for (int i = 0; i < 4; i++) {
- for (int j = 1; j <= n; j++) {
- Card kort = new Card(farger[i], j);
- cards.add(kort);
- }
- }
- }
- public int getCardCount() {
- return cards.size();
- }
- public Card getCard(int n) {
- Card card = cards.get(n);
- return card;
- }
- public void shufflePerfectly() {
- int size = getCardCount();
- int midten = size/2 - 1;
- int teller = 0;
- ArrayList<Card> cardsCopy = new ArrayList<>(cards);
- cards.clear();
- for (int i = 0; i < size; i++) { // Annenhver gang mellom blokkene
- if (i % 2 == 0) {
- Card parKort = cardsCopy.get(teller);
- cards.add(parKort);
- teller++;
- }
- else {
- Card oddKort = cardsCopy.get(midten+teller);
- cards.add(oddKort);
- }
- }
- }
- @Override
- public String toString() {
- String s = "";
- for (int i = 0; i < getCardCount(); i++) {
- s += getCard(i) + "\n";
- }
- return s;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement