Dictionary
Sozdayte Dictionary<string, int> s imenem bin cherez new Dictionary<string, int>(). Dobav'te paru "oak" k 3, zatem "pine" k 8 cherez Add. Napishete bin["oak"], zatem bin.Count. Rabotu derzhite v Pine s Main. Pod using System; ostav'te using System.Collections.Generic;. Zapuskayte cherez dotnet run. Ekran dolzhen pokazat' dve stroki: 3 zatem 2. Slovar' khranit klyuch, ukazyvayushchiy na znachenie. Indeksator chitaet po klyuchu, a ne po nomeru slota spiska. Count — skol'ko par v karte. Imya publichnogo startovogo klassa ostav'te Pine.
Klyuch, kotoryy nakhodit znachenie
Na stranitse list-methods vy sprashivali meshok cherez Contains, ubrali znachenie cherez Remove i nashli slot cherez IndexOf. U Dictionary drugaya forma. Vy khranite pary. Iskhaete znachenie po klyuchu, kotoryy vybrali, a ne cherez bag[0]. Imya bin — eta karta na etoy stranitse. Klyuchi — korotkie slova. Znacheniya — int, chtoby ekran byl legko chitaem.
Otkroyte fayl Pine. Imya startovogo klassa ostayotsya Pine. Eta stranitsa ne pereimenovyvaet starter. Udalite ostatki demo List<int> bag, gde tol'ko Remove i pechat' bag[0] i bag.Count. Udalite ostatki Box b = new Box(4);. Udalite lyuboy ReadLine. Ostavshiyesya fayl ne zhdet vvoda. Chistyy Main delaet dvukhstrochnyy ekran slovarya nadezhnym.
Sverkhu ostav'te using System;. Ostav'te using System.Collections.Generic;. V Main napishete Dictionary<string, int> bin = new Dictionary<string, int>();. Zatem bin.Add("oak", 3);. Dlya pervoy proverki napishete Console.WriteLine(bin["oak"]);. Sokhranite i zapustite korotkuyu formu, zatem rasshir'te do dvukh Add i Count kak sohranennuyu demo. Progon s odnim Add — lish' kontrol'naya tochka; sohranennyy otvet vse ravno 3 zatem 2.
Dictionary nuzhdayetsya v dvukh tipovykh argumentakh: tip klyucha i tip znacheniya. Zdes' eto <string, int>. V uchebnom fayle ne pishet prostoy Dictionary bin bez uglovykh skobok. Uglovye skobki — chast' imeni tipa v redaktore.
using System;
using System.Collections.Generic;
public class Pine
{
public static void Main()
{
Dictionary<string, int> bin = new Dictionary<string, int>();
bin.Add("oak", 3);
Console.WriteLine(bin["oak"]);
}
}
Pine dobavlyaet dve pary i pishet Count
V Main posle pustoy karty napishete bin.Add("oak", 3);, zatem bin.Add("pine", 8);. Snachala napishite bin["oak"], chtoby ekran pokazal znachenie etogo klyucha. Zatem bin.Count, chtoby uvidet', skol'ko par vy sohranili. Na etoy stranitse ne vyzyvayte bag.Remove(3); — eto byla lektsiya list-methods.
using System;
using System.Collections.Generic;
public class Pine
{
public static void Main()
{
Dictionary<string, int> bin = new Dictionary<string, int>();
bin.Add("oak", 3);
bin.Add("pine", 8);
Console.WriteLine(bin["oak"]);
Console.WriteLine(bin.Count);
}
}
Prochitayte sohranennyy fayl sverkhu. using System; gotovit imena konsoli. using System.Collections.Generic; gotovit Dictionary. public class Pine — starter. public static void Main() — tochka zapuska runtime. new Dictionary<string, int>() stroit pustuyu kartu. Pervyy Add khranit klyuch "oak" so znacheniem 3. Vtoroy — "pine" so znacheniem 8. Zapis' bin["oak"] pechatayet 3. Zapis' bin.Count pechatayet 2.
Zapustite dotnet run. Programma pishet dve stroki i ostanavlivaetsya. Ona ne zhdet vvoda. Esli dotnet run zhdet, v fayle eshche est' ReadLine — udalite i ostav'te rabotu so slovaryom. Ekran pokazyvaet 3 zatem 2. Esli vidite 8 zatem 1, vozmozhno, eshche rabotaet demo list-methods. Esli sborka ne nakhodit Dictionary, vernite using System.Collections.Generic;.
Esli napishete bin[0], ozhidaya slot spiska, sborka padaet ili smysl lomaetsya — poisk v slovare trebuet tip klyucha, zdes' string. Esli prochitaete bin["oak"] do Add dlya etogo klyucha, zapusk mozhet vybrasyvat' oshibku — klyucha net. Snachala dobav'te paru. Povtornyy Add s tem zhe klyuchom vybrasyvaet — na etoy stranitse dva raznykh klyucha.
ContainsKey kak spokoynaya proverka
Mozhno sprosit', est' li klyuch, prezhde chem chitat'. Posle dvukh Add vyrazhenie bin.ContainsKey("pine") daet true. Korotkiy fayl pechatayet etu proverku, chtoby na ekrane uvidet' otvet da.
using System;
using System.Collections.Generic;
public class Pine
{
public static void Main()
{
Dictionary<string, int> bin = new Dictionary<string, int>();
bin.Add("oak", 3);
bin.Add("pine", 8);
Console.WriteLine(bin.ContainsKey("pine"));
}
}
Zapustite fayl ContainsKey cherez dotnet run. Ekran pokazyvaet True. Etot zapusk — vtoraya kontrol'naya tochka, ne sohranennyy dvukhstrochnyy otvet. Kogda nuzhny 3 zatem 2, ispol'zuyte fayl s dvumya Add i indeksatorom. Ne putayte ContainsKey s Count — Count vse ravno chislo par. ContainsKey otvechaet tol'ko, est' li odin klyuch.
Zapis' bin["pine"] posle dvukh Add pechatayet 8. Eto verno, no sohranennaya demo pechatayet snachala bin["oak"], chtoby otvet viktoriny ostalsya 3 zatem 2. Esli vidite tol'ko True, vy na fayle ContainsKey — vernites' k forme s dvumya Add dlya glavnoy kontrol'noy tochki.
Sravnenie s List i privychkoy fiksirovannogo massiva
Spisok derzhit znacheniya po poryadku pod indeksami. Slovar' derzhit pary pod klyuchami, kotoryye vy vybirayete. Ostatok bag.Remove(3); Console.WriteLine(bag[0]); — drugaya lektsiya. Na etoy stranitse ostav'te Dictionary<string, int> bin i vyzovy Add so strokovymi klyuchami.
Spiski vse ravno nuzhny, kogda vazhen poryadok slotov. Eta stranitsa ne zamenyaet kazhdyy spisok. Ona pokazyvaet kartu s klyuchami, ot kotoroy vy otoydete na stranitse hashset, gde uchatsya unikal'nyye znacheniya bez vtorogo tipa na zapisi. Ostav'tes' zdes' so strokovymi klyuchami i int-znacheniyami, chtoby indeksator i Count chitalis' na ekrane legko.
Chto ostaetsya dlya hashset
Eta stranitsa sozdayet slovar', dobavlyaet pary, chitaet po klyuchu i chitaet Count. Sleduyushchaya — hashset — khranit unikal'nyye znacheniya bez vtorogo tipa na kazhdoy zapisi. Ostav'tes' zdes' u sozdaniya, Add, indeksatora i Count. Ne izobretayte vse metody slovarya srazu; tsel' lektsii — sam keyed bin. Kogda dotnet run iz fayla s dvumya Add pechatayet 3 zatem 2, u vas kontrol'naya tochka etoy stranitsy.
Ne vlozhite vtoroy Main. Ne ostavlyayte demo List i Remove v fayle. Esli sborka ne nakhodit Dictionary, prover'te using System.Collections.Generic;. Esli na ekrane odna stroka, vozmozhno, zabyli vtoroy WriteLine — v demo s dvumya Add derzhite i bin["oak"], i bin.Count. Esli tol'ko True, vy na ContainsKey; dlya ekrana viktoriny vernites' k forme s dvumya Add.
Mozhno napisat' Dictionary<string, int> bin = new Dictionary<string, int>();, vyzvat' bin.Add("oak", 3); i bin.Add("pine", 8);, zatem napisat' bin["oak"] i bin.Count. Zapustite dotnet run. Ekran pokazyvaet 3 zatem 2. Na karte bylo dve pary. Klyuch nashel znachenie. Count soobshchil dlinu. Dumayte o Dictionary kak o yashchike s etiketkami: pod slovom lezhit chislo, potom snova sprashivayete to zhe slovo. Pine ostayetsya dveryu, kotoruyu otkryvayete cherez dotnet run. Sleduyushchaya stranitsa — hashset, gde hranenie sdvigaetsya ot par s klyuchami k unikal'nomu mnozhestvu.
Sokhranyte using System.Collections.Generic;. Sokhranyte <string, int> na type slovarya. Uberte iz Main demo list-methods, chtoby ekran sluchayno ne pokazal 8 zatem 1. Eti privychki — kontrol'naya tochka pered hashset.
🧠 Проверьте Свои Знания
Проверьте Свои Знания
Бросьте себе вызов с помощью этой интерактивной викторины и узнайте, насколько хорошо вы понимаете тему
📝 Инструкции
- Внимательно прочитайте каждый вопрос
- Выберите лучший ответ на каждый вопрос
- Вы можете пересдавать тест столько раз, сколько захотите
- Ваш прогресс будет показан вверху