Tham kho nhanh v Java

Ngun: Internet | Dch: KhoaNV

Biu thc Cp ngoc trn () c 3 tc dng: 1. Nhm iu khin th t tnh ton, hoc biu thc r rng. VD: (a + b) * (c - d) 2. t sau tn phng thc cha cc tham s. VD: x = sum(a, b); 3. Cha tn kiu d liu khi tin hnh p kiu. VD: i = (int)x; u tin ca cc ton t 1. Ton t c u tin cao hn s c thc hin trc. 2. Th t s t tri qua phi nu cc ton t c cng u tin, ngoi tr: mt ngi, gn, iu kin. Ch cn nh th t sau 1. cc ton t mt ngi 2. * / % 3. + 4. cc ton t so snh 5. && || 6. = cc ton t gn S dng cp ( ) cho tt c nhng ton t

Cc cu trc iu khin Lnh if // lnh if vi mnh true if(biu_thc){ Cc lnh // thc hin nu biu thc cho kt qu true } // lnh if vi mnh true v false if(biu_thc){ Cc lnh // thc hin nu biu thc cho kt qu true }else{ Cc lnh // thc hin nu biu thc cho kt qu false }

Ch thch (Comment) // Mi ni dung trong dng ny s b b qua. y l loi ch thch c s dng ph bin. /* Mi th (c th gm nhiu dng) trong khi ny s b b qua */. Khng ph bin. S dng ch thch bn ngoi m ngun. /** c s dng gip t ng to ra javadoc di dng HTML. */ nh danh\t tn Cc nh danh phi bt u vi k t bng ch ci Alphabetic (a-z hoc A-Z), v cc k t tip theo l ch ci, ch s (0-9), hoc du gch di (_). Khng s dng k t $. Cc t tip theo trong nh danh (nu c) nn bt u vi k t ch ci in hoa. Khng s dng cc t kha ca Java.

// Lnh if vi nhiu iu kin kim tra song song if(biu_thc_1){ Tn lp v giao tip (interface) nn bt u vi k t ch ci in hoa Cc lnh // thc hin nu biu thc 1 l true Cc ton t S hc }else if(biu_thc_2){ (Graphics, String, Car, Motorbike, ... ). Cc lnh // thc hin nu biu thc 2 l true Tn bin v phng thc nn bt u vi k t ch ci in thng Kt qu ca cc ton t S hc l double nu c mt ton hng l double, tri li l float nu c }else if(biu_thc_3){ mt ton hng l float, tri li l long nu c mt ton hng l long, tri li l int. (repaint(), x, ...). Cc lnh // thc hin nu biu thc 3 l true i++ Cng thm 1 cho i }else{ Cc hng gi tr nn s dng ton b ch in hoa v dng du gch di (_) phn cch cc i-- Bt 1 t i Cc lnh // thc hin khi cc biu thc trn l false t n + m Php cng. VD 7 + 5 bng 12, 3 + 0.14 bng 3.14 } (BoxLayout.X_AXIS, Math.PI, ...). n - m Php tr n * m Php nhn. VD 3 * 6 bng 18 Lnh switch Bin cc b, Bin i tng, Bin tnh n / m Php chia. VD 3.0 / 2 bng 1.5, 3 / 2 bng 1 switch cho php chn mt trng hp no ph thuc vo gi tr nhn c (thng l s Bin c th l bin cc b (local), bin i tng (instance),hoc bin tnh (static hay cn gi l n % m Php chia ly phn d (Mod). VD 7 % 3 bng 1 nguyn) t bin hoc biu thc. bin lp). Cc tham s c coi l nhng bin cc b, chng c gn gi tr khi phng thc switch(biu_thc){ So snh cc gi tr nguyn thy c triu gi. case c1: Kt qu ca cc ton t so snh l boolean (true hoc false). Cc lnh // thc hin khi biu thc = c1 = =, !=, <, <=, >, >= break; Bin cc b Bin i tng Bin tnh case c2: Cc ton t L gc Trong lp, nhng Trong lp v s Ni khai bo? Trong phng thc. Cc lnh // thc hin khi biu thc = c2 khng trong phng dng thm t kha break; Cc ton h ng ph i c kiu l boolean. K t qu l boolean . thc. static. case c3: b && c V. K t qu l true n u c hai ton hng u l true, tri l i s l false. Gi tr khi to Phi c gn gi tr tr Kiu s: 0 Kiu s: 0 case c4: nh gi on mch. VD (false && anything) cho kt qu false. trc khi s dng v i tng: null i tng: null b || c Hoc. Kt qu l true nu bt c ton hng no true, tri li s l false. case c5: // cc trng hp cng chung x l. trnh bin dch s bo l i Boolean: false Boolean: false nh gi on mch. VD(true || anything) cho kt qu l true. // thc hin khi biu thc = c3, c4 hoc c5 nu khng lm vic ny. Hoc c khi to Hoc c khi to !b Ph nh. Kt qu l true nu b l false, l false nu b l true. Cc lnh gi tr trong hm trong khi khi to break; to. tnh. Cc ton t Gn default: Phm vi s dng Ch trong phng thc private: Ch cc Ging vi Bin i Cc lnh cha n. Khng c kh phng thc ca lp. tng. = V tri bt buc phi l mt nh danh\bin. nng hin th c th (Mc nh): Tt c cc // thc hin khi m biu thc khng bng gi tr no trn += -= *= ... c khai bo. phng thc thuc cc } Tt c cc ton t hai ngi (ngoi tr && v || ) u c th kt hp vi ton t gn. lp cng gi VD: a += 1 tng t nh a = a + 1 (package). Lnh lp while public: Bt c u u p kiu c th truy xut. while(biu_thc){ protected: Lp cha p kiu c s dng khi thu hp di gi tr no . Phm vi t hp nht n rng nht ca // thc hin lp li cc mnh lnh cho ti khi n v tt c cc lp kiu d liu nguyn thy l: byte, short, char, int, long, float, double. Cc i tng c th c // biu thc cho kt qu false con (subclass). gn m khng cn p kiu ln cp cao hn trong cy phn cp k tha. p kiu ch cn khi p } xung cp thp hn trong cy phn cp (p xung). c to ra khi Khi phng thc c Khi mt i tng ca Khi chng trnh c no? s dng. lp c to mi. np. Vng nh "Bn vng" Khi chng trnh kt thc. (t)x p kiu ca x sang kiu t Ton t i tng Stack Heap c lu tr u? Khi no c gii Khi phng thc tr v Khi khng cn tham kt qu. chiu no dnh cho phng? i tng. Cc kiu d liu nguyn thy boolean (vi ch hai gi tr true/false) Cc kiu s hc: byte, short, char, int, long, float, double co.f Thnh phn. Thuc tnh hoc phng thc f ca i tng hoc lp co. x instanceof co Cho kt qu true nu i tng tham chiu bi x l th hin ca lp co. s+t Ton t cng chui nu mt hoc c hai ton t c kiu l String. x == y Cho kt qu l true nu c x v y cng tham chiu ti mt i tng, tri li s l false (thm ch c khi gi tr ca cc i tng ny ging nhau!). x != y Ph nh ca ton t trn. Lu : So snh cc i tng s dng phng thc .equals() hoc .compareTo() x=y Sao chp tham chiu i tng ch khng phi sao chp i tng. Lnh lp for for(Khi to bin m; iu kin lp; thay i bin m) { // thc hin lp li cc mnh lnh cho ti khi // biu thc iu kin lp cho kt qu false } while v for c th thay th cho nhau:
int i = 0; while(i<5){ System.out.print("Hi!"); i++; } for (i=0; i<5; i++) { System.out.print("Hi!"); }

Nhng iu khin lp khc Tt c cc lnh lp u c th c t nhn, v vy c th dng lnh break v continue cho bt c cp lng nhau no ca vng lp. break; //thot khi vng lp hoc lnh switch gn nht cha n break label; // thot khi vng lp c t nhn (label) continue; //tin hnh lt lp tip theo continue label; //tin hnh lt lp tip theo vi vng lp c t nhn (label). Nhn c t trc vng lp cng du hai chm, v d: outer: for (. . .) { . . . continue outer; }

b = s.equalsIgnoreCase(t) tng t nh trn nhng khng phn bit k t in hoa, in thng b = s.startsWith(t) cho kt qu true nu chui s cha chui t u b = s.endsWith(t) cho kt qu true nu chui s cha chui t cui Tm kim trong chui (tt c cc phng thc "indexOf" u tr v -1 nu khng tm thy kt qu) i i i i

// S dng vng lp for chun. int[] scores = new int[12];

...Khi to cc gi tr cho mng scores

// S dng vng lp for nng cao. int[] scores = new int[12];

...Khi to cc gi tr cho mng scores

int total = 0; for (int i = 0; i <scores.length; i++) { total += scores[i]; }

int total = 0; for(int scr : scores){ total += scr; }

= s.indexOf(t) tr v v tr u tin xut hin chui t trong chui s. Mng hai chiu = s.indexOf(t, i) tr v v u tin tr tnh t i xut hin chui t trong chui s. = s.lastlndexOf(t) tr v v tr cui cng xut hin chui t trong chui s. Hu ht c x l vi vng lp for lng nhau. V d: = s.lastIndexOf(t, i) tr v v tr cui cng tnh t i xut hin chu i t trong chu i s. static final int ROWS = 2; static final int COLS = 4; Ly mt phn ca chui c = s.charAt(i) tr v k t ti v tr i trong chui s. int[][] a2 = new int[ROWS][COLS]; Ngoi l (Exception) sl= s.substring(i) tr v mt chui con ca chui s tnh t v tr i n cui. // ... Hin th cc phn t mng trong khung hnh ch nht sl= s.substring(i, j) tr v mt chui con ca s tnh t v tr i n ngay trc v tr j. for(int i =0; i < ROWS; i++){ S dng try...catch cho cc ngoi l for(int j = 0; j < COLS; j++){ try{ To mi mt chui t chui ban u Systern.out.print(" " + a2[i][j]); . . . // cc lnh c th dn ti ngoi l } }catch(Kiu_ngoi_l x){ sl= s.toLowerCase() to mt chui mi dng in hoa ton b . . . // cc lnh x l khi c ngoi l Systern.out.println(""); sl= s.toUpperCase() to mt chui mi dng in thng ton b } } sl= s.trim() ct b cc k t trng u v cui chui sl= s.replace(cs2, cs3) thay th tt c cc chui con cs2 trong s bng chui cs3 throw Scanner StringBuilder throw i_tng_ngoi_l; Tc dng chnh ca java.util.Scanner l gip c cc gi tr t System.in hoc t tp tin. S dng nhiu mnh catch v mnh finally sc = new Scanner(System.in); S dng c d liu t System.in Kh nng sa i nhanh hn so vi String, s dng b nh v CPU hiu qu hn. sc = new Scanner(s); S dng c gi tr t chui s. Thc hin mnh catch u tin tng ng vi ngoi l c ch ra bi lp ngoi l hoc cc lp sb = new StringBuilder() To mt StringBuilder rng ngoi l cha. Mnh finally lun c thc hin (bt k l c hay khng c ngoi l xy ra) v sb = new StringBuilder(s) To mt StringBuilder t chui s. Cc phng thc ly d liu ph bin nht vy cc ti nguyn s dng trc c th c gii phng (v d, ng tp tin): sb = sb.append(x) Thm x (bt k kiu d liu)vo cui sb. try{ sb = sb.insert(offset, x) Chn x (bt k kiu d liu) vo sb ti v tr offset. s = sc.next() Tr v "token" tip theo, nhiu hn hoc t l mt "word". . . . // cc lnh c kh nng xy ra ngoi l sb = sb.setCharAt(index, c) Thay th k t ti v tr index bng k t c. s = sc.nextLine() Tr v ton b mt dng d liu di dng mt chui. }catch(kiu_ngoi_l x){ sb = sb.deleteCharAt(i) Xa k t ti v tr i. x = sc.nextXYZ() Tr v gi tr c kiu l XYZ: . . . // cch lnh x l ngoi l sb = sb.delete(beg, end) Xa cc k t t v tr beg ti v tr end. Int, Double, Boolean, Byte, Float, Short } catch (kiu_ngoi_l x) { sb = sb.reverse() o ngc ni dung. b = sc.hasNext() Tr v true nu cn token c. . . . // cch lnh x l ngoi l sb = sb.replace(beg, end, s) Thay th cc k t t v tr beg ti v tr end bng s. }finally{ b = sc.hasNextLine() Tr v true nu cn dng d liu c. // cc lnh lun lun c thc hin C cc phng thc indexOf, lastlndexOf, charAt, equals, substring ging nh String! b = sc.hasNextXYZ() Tr v true nu loi cn d liu XYZ c. // bt k c xy ra ngoi l hay khng . . . Mng Nhp\Xut tp tin Vn bn } Chui Cng chui S dng thao tc vi nhiu phn t d liu, c th l d liu nguyn thy hoc cc i tng. Tt c cc phn t phi cng kiu d liu.Mng khng c kh nng m rng! V d:
public static void copyFile(File fromFile, File toFile) throws IOException { Scanner freader = new Scanner(fromFile); BufferedWriter writer = new BufferedWriter(new FileWriter(toFile)); //... Lp cho ti khi vn cn dng d liu t tp u vo. String line = null; while (freader.hasNextLine()) { line = freader.nextLine(); writer.write(line); writer.newLine(); // Vit sang dng khc trong tp tin. } //... ng b c v ghi tp tin. freader.close(); // ng b kha i vi tp tin. writer.close(); // ng b kha i vi tp tin v y ton b d liu xung a. }

V d: int [] scores; // Khai bo scores l mng cc s nguyn. Ton t + cho php ni hai chui li vi nhau. Nu mt ton hng l String, ton hng cn li s scores = new int[12]; // Khi to vng nh cho mng vi 12 phn t. c chuyn i sang kiu String v sau c cng vi nhau. y thng l cch dng int[] scores = new int[12]; // Kt hp c khai bo v khi to. chuyn i cc s sang String. Nu mt i tng khng phi l String khi c cng vi String phng thc toString() ca n Khi to mt mng s c triu gi. Mt tin ch dnh cho vic ra sot bug l vit trong cc lp ca bn phng thc toString(). Nu cc phn t ca mng khng c gn gi tr khi to, chng s c khi to l 0 vi cc mng s, null vi cc mng tham chiu i tng, v false vi cc mng boolean. "abc" + "def" "abcdef" To mng vo khi to gi tr cho phn t mng vi mt dng lnh: "abc" + 4 "abc4" String[] names = {"Mickey", "Minnie", "Donald"}; "1" + 2 "12" Hoc c th tch thnh nhiu dng lnh: "xyz" + (2+2 == 4) "xyztrue" String[] names = new String[3]; names[0] = "Mickey"; 1 + "2.5" "12.5" names[1] = "Minnie"; i = s.length() cho php xc nh di ca chui s. names[2] = "Donald"; So snh chui (s dng thay th cho ton t == v !=) Truy cp phn t mng

scores[5] = 86; // Gn cho phn t c ch s l 5 gi tr 86. i = s.compareTo(t) c s dng so snh chui s vi t. scores[i]++; // Tng mt n v cho phn t c ch s l i. tr v <0 nu s < t, 0 nu s == t, >0 nu s > t i = s.compareToIgnoreCase(t) tng t nh trn nhng khng phn bit k t in hoa, Duyt ln lt qua cc phn t mng in thng. Kch thc ca mt mng c th c xc nh bng cch s dng thuc tnh length ca chng, b = s.equals(t) cho kt qu true nu hai chui c cng gi tr. VD, scores.length