![](//s1.studylibfr.com/store/data-gzf/f6986616b7564c65db537d10edaeaa80/1/004635368.htmlex.zip/bg1.jpg)
//−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
// Ex12.java
//−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
class Ex12 {
static int[] t;
static final int nbMaxCases = 100;
static int nbCases;
static void initialiser() {
t = new int[nbMaxCases];
nbCases = 0;
}
static void afficher() {
System.out.print(t.length+", ");
for (int i=0; i<nbCases; i++)
System.out.print(t[i]+" ");
System.out.println();
}
static void saisir(String[] args) {
nbCases = args.length;
for (int i=0; i<nbCases; i++)
t[i] = Integer.parseInt(args[i]);
}
static void ajouter(int n) {
// on suppose pour simplifier nbCases != nbMaxCases, sinon tester
t[nbCases] = n;
nbCases++;
}
static void retirer() {
nbCases−−;
t[nbCases] = 0;
}
public static void main(String[] args) {
initialiser();
afficher();
saisir(args);
afficher();
retirer();
afficher();
ajouter(7);
afficher();
}
}
//−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
/*
java Ex12 1 2 3
100,
100, 1 2 3
100, 1 2
100, 1 2 7
*/
//−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
déc 12, 10 17:57 Page 1/1Ex12.java
Printed by Emmanuel Waller
jeudi décembre 15, 2011 1/1Ex12.java