-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDresser.java
More file actions
155 lines (144 loc) · 3.18 KB
/
Dresser.java
File metadata and controls
155 lines (144 loc) · 3.18 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
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
146
147
148
149
150
151
152
153
154
155
/*
* Jiarong Xu
*/
public class Dresser {
//instance variables
private Clothing [][] clothes;
public static final int DRAWER = 5;
public static final int ITEMS = 10;
//init
public Dresser()
{
init();
}
public void init()
{
clothes = new Clothing[DRAWER][ITEMS];
}
//other methods
// get drawer number
public int getDrawer(Clothing aC)
{
if (aC.getType() == ClothType.Undergarment)
return 0;
else if(aC.getType() == ClothType.Socks || aC.getType() == ClothType.Stockings)
return 1;
else if(aC.getType() == ClothType.Top)
return 2;
else if(aC.getType() == ClothType.Bottom)
return 3;
else
return 4;
}
public void addClothing(Clothing aC)
{
//System.out.println("a");
//check aC is null or not
if(aC == null)
return;
/* int d;//check which drawer it is in
if (aC.getType() == ClothType.Undergarment)
d = 0;
else if(aC.getType() == ClothType.Socks || aC.getType() == ClothType.Stockings)
d = 1;
else if(aC.getType() == ClothType.Top)
d = 2;
else if(aC.getType() == ClothType.Bottom)
d = 3;
else
d = 4;*/
// check whether the drawer is full or not
if (clothes[getDrawer(aC)][ITEMS-1] != null)
return;
// fill in the drawer
for(int i=0; i<clothes[getDrawer(aC)].length-1; i++)
{
if(clothes[getDrawer(aC)][i] == null)
{
clothes[getDrawer(aC)][i] = aC;
//System.out.println("a");
this.sortDresser();
break;
}
}
//System.out.println("a");
}
public void removeClothing(Clothing aC)
{
//check aC is null or not
if(aC == null)
return;
for(int i=0; i<clothes[getDrawer(aC)].length-1; i++)
{
if(clothes[getDrawer(aC)][i].equals(aC))
{
clothes[getDrawer(aC)][i] = null;
this.sortDresser();
return;
}
}
System.out.println("Can't find the cloth");
}
/*
public void print()
{
for(int j=0; j<clothes.length-1; j++)
{
System.out.println("Drawer "+j);
for(int i=0; i<clothes[j].length-1; i++)
{
if(clothes[j][i] != null)
{
System.out.println(clothes[j][i].toString());
System.out.println("1");
}
}
System.out.println();
}
}
*/
public void print() {
for (int j = 0; j < clothes.length; j++) {
System.out.println("Drawer " + j);
for (int i = 0; i < clothes[j].length; i++) {
if (clothes[j][i] != null) {
System.out.println(clothes[j][i].toString());
// System.out.println("1");
}
}
System.out.println();
}
}
public void sortDresser()
{
boolean swapped = true;
while(swapped)
{
swapped = false;
for(int j=0; j<clothes.length-1;j++)
{
for(int i=0; i<clothes[j].length-1;i++)
{
if(clothes[j][i] == null || clothes[j][i+1] == null)
break;
if(clothes[j][i] == null && clothes[j][i+1] != null)
{
Clothing temp = clothes[j][i];
clothes[j][i] = clothes[j][i+1];
clothes[j][i+1] = temp;
swapped = true;
}
}
}
}
}
/*
public void print()
{
for(Clothing[] cloth : clothes)
{ if(cloth == null)
break;
System.out.println(cloth.toString());
}
}*/
}