Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js

Array

Description

13. Klasse Informatik (Datenstrukturen) Note on Array, created by Ann-Kathrine Buchmakowsky on 14/03/2020.
Ann-Kathrine Buchmakowsky
Note by Ann-Kathrine Buchmakowsky, updated more than 1 year ago
Ann-Kathrine Buchmakowsky
Created by Ann-Kathrine Buchmakowsky about 5 years ago
7
0
1 2 3 4 5 (0)

Resource summary

Page 1

Initialisierung

eindimensional: Datentyp[ ] = meinArray; meinArray = new Datentyp[int];

zweidimensional: Datentyp[ ][ ] = meinArray; meinArray = new Datentyp[rows] [columns] ;

Page 2

Durchlaufen eines Arrays

Eindimensional: for (int i = 0; i < meinArray.length(); i++){    System.out.println(meinArray[i].getContent(); ) }

Zweidimensional: for (int i = 0; i < meinArray[i][0].getRowCount(); i++){    for (int j = 0; j < meinArray[0][j].getColumnCount(); j++) {       System.out.println(meinArray[i][j].getContent()    } }

Page 3

Methoden eines Strings

length() indexof (String str) substring (int beginIndex) substring (int beginIndex, int endIndex) charAt(int index) equals (Object anobject) compareTo (String anotherstring) startsWith(String prefix)

Show full summary Hide full summary

0 comments

There are no comments, be the first and leave one below:

Similar

minimale Spannbäume und ihre Algorithmen
Ann-Kathrine Buchmakowsky
Informatik
Tom Kühling
PHP Grundlagen
chrisi.0605
Wirtschaftsinformatik Teil 2
Sabrina Heckler
Informatik 1 - Einführung
Svenja
Codierung
Tom Kühling
Wirtschaftsinformatik Teil 1
Sabrina Heckler
Einführung in das Studium Informatik
Daniel Doe
Lernplan
Sandra K
Infromatik Basiswissen
Simon Hefti