tp7

DEV3.2/TP07/01_Repertoires/Repertoires.java

@@ -0,0 +1,43 @@
+import java.awt.*;
+import java.io.File;
+import java.util.Arrays;
+import java.util.ArrayList;
+
+public class Repertoires {
+
+	private File valeur;
+	private ArrayList<Repertoires> fils;
+
+	public Repertoires(File racine) {
+		if (!racine.isDirectory()) {
+			this.valeur = racine;
+			this.fils = null;
+		} else {
+			this.fils = new ArrayList<>();
+			this.valeur = racine;
+			for (File fichier : racine.listFiles()) {
+				this.fils.add(new Repertoires(fichier));
+			}
+		}
+	}
+
+	public String toString(int nbRecursions) {
+		String aRenvoyer = "";
+		for (int i = 0; i != nbRecursions; i++) {
+			aRenvoyer += "  ";
+		}
+		aRenvoyer += this.valeur.getName() + "\n";
+		if (this.fils != null) {
+			for (Repertoires fichier : this.fils) {
+				aRenvoyer += fichier.toString(nbRecursions + 1);
+			}
+		}
+		return aRenvoyer;
+	}
+
+	public static void main(String[] args) {
+		Repertoires racine = new Repertoires(new File(args[0]));
+		System.out.println(racine.toString(0));
+	}
+
+}

DEV3.2/TP07/02_Prefixe/Main.java

@@ -0,0 +1,38 @@
+import java.awt.*;
+import java.util.ArrayDeque;
+
+public class Main {
+	public static void main(String[] args) {
+		ArrayDeque<String> pile = new ArrayDeque<>(args.length);
+
+		for (int i = 0; i != args.length; i++) {
+			try {
+				Integer.parseInt(args[i]);
+				pile.addFirst(args[i]);
+			} catch (NumberFormatException e) {
+				int n2 = Integer.parseInt(pile.removeFirst());
+				int n1 = Integer.parseInt(pile.removeFirst());
+				System.out.println(n2);
+				System.out.println(n1);
+
+				switch (args[i]) {
+					case "+":
+						pile.addFirst(n1 + n2 + "");
+						break;
+					case "-":
+						pile.addFirst(n1 - n2 + "");
+						break;
+					case "x":
+						pile.addFirst(n1 * n2 + "");
+						break;
+					case "/":
+						pile.addFirst(n1 / n2 + "");
+				}
+			}
+		}
+
+		System.out.println("= " + pile.removeFirst());
+
+
+	}
+}

DEV3.2/TP07/02_Prefixe/Prefixe.java

@@ -0,0 +1,38 @@
+import java.awt.*;
+import java.util.ArrayDeque;
+
+public class Main {
+	public static void main(String[] args) {
+		ArrayDeque<String> pile = new ArrayDeque<>(args.length);
+
+		for (int i = 0; i != args.length; i++) {
+			try {
+				Integer.parseInt(args[i]);
+				pile.addFirst(args[i]);
+			} catch (NumberFormatException e) {
+				int n2 = Integer.parseInt(pile.removeFirst());
+				int n1 = Integer.parseInt(pile.removeFirst());
+				System.out.println(n2);
+				System.out.println(n1);
+
+				switch (args[i]) {
+					case "+":
+						pile.addFirst(n1 + n2 + "");
+						break;
+					case "-":
+						pile.addFirst(n1 - n2 + "");
+						break;
+					case "x":
+						pile.addFirst(n1 * n2 + "");
+						break;
+					case "/":
+						pile.addFirst(n1 / n2 + "");
+				}
+			}
+		}
+
+		System.out.println("= " + pile.removeFirst());
+
+
+	}
+}