From 194336693c5862d754e9254cbc0d20ccdf1254a5 Mon Sep 17 00:00:00 2001 From: Luca Conte Date: Thu, 15 Dec 2022 17:37:42 +0100 Subject: [PATCH] u29 --- uebungen/u29/Pascal.class | Bin 0 -> 1512 bytes uebungen/u29/Pascal.java | 48 ++++++++++++++++++++++++++++++++++++++ 2 files changed, 48 insertions(+) create mode 100644 uebungen/u29/Pascal.class create mode 100644 uebungen/u29/Pascal.java diff --git a/uebungen/u29/Pascal.class b/uebungen/u29/Pascal.class new file mode 100644 index 0000000000000000000000000000000000000000..0736e8019e473bb201803f9fa4a6fa4213dd35ad GIT binary patch literal 1512 zcmaJ>U2hvj6g}fzdmU$+52yL4vrgSMX&sx|)D&9cBuyHc*5D+S98u9o(2c!nx3PCE zdmWMY{077eJmiJv_93kb1o6NNKLd$B5rx8;wZVo&*z(MsJNKS@?wJ|?`u5EcfLqvz zUHd(mm>(^inOM~n2F#ju1QZafj``Rok{2o91?v9<^rLj=)%QtN7g9HM3RId73SG4cmE|mx=v# zn%+aRSvISTP8Ou|T*))bJ8Nd$2hng-K=mi*;=(_vHmtr zMpn`>jHtk{U$y1g)oiJ3I*!%Q@V<@@a7zZ<*6|_c81=}uc5SO_B_3Nua_%HFv~PEVb<3y@0nX^4u-H4#L0?y9bzuK{KAK~F=@lGFH#u8~;2u^!iU&edqcu9{`fZR}}SqmV_{-D%Z%5eo7U zSE^>SX|dMVy}UaZ?c;c0I+d!`oNg!PPZR3#{3~&DuWp?Y-g|-DN0{&JvIDVVR;wl3 zv+^3&1!hk5cNRB+ssE4T3mxRUl^+$nt%!0Q;VRBqa1N$kLA;M0UZX;amA<5f&7Jq zR7QOf`v&TZ*pG-5(~9~-q?A^2in^gL7_kE^r42)UBAteGax}QL7&i`Zk&AfRP%F8( zTFJDH%#)3MMSS8p-P_m%m{)X@Q!Q@*SQXJo#8M07rAp)9RL6T literal 0 HcmV?d00001 diff --git a/uebungen/u29/Pascal.java b/uebungen/u29/Pascal.java new file mode 100644 index 0000000..dc510cd --- /dev/null +++ b/uebungen/u29/Pascal.java @@ -0,0 +1,48 @@ +import java.util.*; +/** + * Klasse zum generieren eines Pasclschen Dreiecks + */ +public class Pascal { + public static void main(String[] args) { + Scanner console = new Scanner(System.in); + + System.out.print("Wieviele Zeilen? "); + int numlines = console.nextInt(); + + printPascal(numlines); + } + + /** + * Gibt ein Paskalsches Dreieck mit numlines Zeilen + * auf der Konsole aus + */ + public static void printPascal(int numlines){ + if (numlines <= 0) return; + int[][] pascal = new int[numlines][]; + pascal[0] = new int[1]; + pascal[0][0] = 1; + + for (int i = 1; i < numlines; i++) { + pascal[i] = new int[i + 1]; + pascal[i][0] = 1; + pascal[i][i] = 1; + for (int j = 1; j < i; j++) { + pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j]; + } + } + + print2dArray(pascal); + } + + public static void print2dArray(int[][] arr) { + for (int i = 0; i < arr.length; i++) { + if (arr[i].length > 0) { + System.out.print(arr[i][0]); + } + for (int j = 1; j < arr[i].length; j++) { + System.out.print(" " + arr[i][j]); + } + System.out.println(); + } + } +}