LeetCode’un “Top Interview 150” listesinde yer alan ve m\u00fclakatlarda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan “13. Roman to Integer” problemi, Roma rakamlar\u0131n\u0131 modern tam say\u0131lara d\u00f6n\u00fc\u015ft\u00fcrmeyi ama\u00e7layan klasik bir algoritma sorusudur. Bu problem, temel string i\u015fleme, ko\u015fullu mant\u0131k ve veri yap\u0131lar\u0131 bilgisini test ederken, ayn\u0131 zamanda karma\u015f\u0131k g\u00f6r\u00fcnen bir sistemin nas\u0131l basit kurallarla \u00e7\u00f6z\u00fclebilece\u011fini g\u00f6sterir. Bu makalede, Roma rakamlar\u0131 sistemini, problem tan\u0131m\u0131n\u0131, etkili bir \u00e7\u00f6z\u00fcm algoritmas\u0131n\u0131 ve Python dilinde \u00f6rnek bir uygulamay\u0131 detayl\u0131 bir \u015fekilde inceleyece\u011fiz.<\/p>\n
Roma rakamlar\u0131, Antik Roma’da say\u0131lar\u0131 temsil etmek i\u00e7in kullan\u0131lan bir sistemdir. G\u00fcn\u00fcm\u00fczde saat kadranlar\u0131, kitap b\u00f6l\u00fcmleri ve kraliyet isimleri gibi belirli ba\u011flamlarda hala kar\u015f\u0131m\u0131za \u00e7\u0131kabilmektedir. Bu sistemin kendine \u00f6zg\u00fc kurallar\u0131 ve sembolleri vard\u0131r.<\/p>\n
Roma rakamlar\u0131 yedi temel sembol kullan\u0131r ve her birinin belirli bir tam say\u0131 de\u011feri vard\u0131r:<\/p>\n
I<\/code>: 1<\/li>\nV<\/code>: 5<\/li>\nX<\/code>: 10<\/li>\nL<\/code>: 50<\/li>\nC<\/code>: 100<\/li>\nD<\/code>: 500<\/li>\nM<\/code>: 1000<\/li>\n<\/ul>\nToplama ve \u00c7\u0131karma Kurallar\u0131<\/h4>\n
Roma rakamlar\u0131 genellikle soldan sa\u011fa do\u011fru okunur ve sembollerin de\u011ferleri toplan\u0131r. \u00d6rne\u011fin, II<\/code> iki (1+1), VI<\/code> alt\u0131 (5+1) ve LX<\/code> altm\u0131\u015f (50+10) anlam\u0131na gelir. Ancak sistemin en \u00f6nemli \u00f6zelli\u011fi, baz\u0131 durumlarda \u00e7\u0131karma kural\u0131n\u0131n uygulanmas\u0131d\u0131r. E\u011fer k\u00fc\u00e7\u00fck de\u011ferli bir sembol, kendisinden daha b\u00fcy\u00fck de\u011ferli bir sembol\u00fcn solunda yer al\u0131yorsa, k\u00fc\u00e7\u00fck de\u011ferli sembol b\u00fcy\u00fckten \u00e7\u0131kar\u0131l\u0131r.<\/p>\n\u00d6zel Durumlar: \u00c7\u0131karma Kural\u0131<\/h4>\n
\u00c7\u0131karma kural\u0131 sadece belirli sembol \u00e7iftleri i\u00e7in ge\u00e7erlidir:<\/p>\n
\nI<\/code>, V<\/code> (IV=4) ve X<\/code> (IX=9) \u00f6ncesinde yer alabilir.<\/li>\nX<\/code>, L<\/code> (XL=40) ve C<\/code> (XC=90) \u00f6ncesinde yer alabilir.<\/li>\nC<\/code>, D<\/code> (CD=400) ve M<\/code> (CM=900) \u00f6ncesinde yer alabilir.<\/li>\n<\/ul>\nDi\u011fer durumlarda, \u00f6rne\u011fin IL<\/code> gibi bir kombinasyon ge\u00e7erli de\u011fildir. Bu kurallar, Roma rakamlar\u0131n\u0131 tam say\u0131lara \u00e7evirirken dikkat etmemiz gereken kritik noktalard\u0131r.<\/p>\nProblem Tan\u0131m\u0131 ve LeetCode #13<\/h3>\n
LeetCode’daki “13. Roman to Integer” problemi, verilen bir Roma rakam\u0131 stringini kar\u015f\u0131l\u0131k gelen tam say\u0131ya \u00e7evirmemizi ister. Problem, giri\u015fin her zaman ge\u00e7erli bir Roma rakam\u0131 olaca\u011f\u0131n\u0131 garanti eder.<\/p>\n
Girdi Format\u0131 ve Beklenen \u00c7\u0131kt\u0131<\/h4>\n
Girdi, bir string (\u00f6rne\u011fin, \"MCMXCIV\"<\/code>) format\u0131ndad\u0131r. \u00c7\u0131kt\u0131 ise bu Roma rakam\u0131n\u0131n temsil etti\u011fi tam say\u0131 olmal\u0131d\u0131r (\u00f6rne\u011fin, 1994<\/code>).<\/p>\nK\u0131s\u0131tlamalar ve Edge Durumlar<\/h4>\n
Problemin k\u0131s\u0131tlamalar\u0131 genellikle \u015funlar\u0131 i\u00e7erir:<\/p>\n
\n- Girdi stringinin uzunlu\u011fu 1 ile 15 aras\u0131nda olabilir.<\/li>\n
- Girdi sadece
('I', 'V', 'X', 'L', 'C', 'D', 'M')<\/code> sembollerini i\u00e7erir.<\/li>\n- Girdinin ge\u00e7erli bir Roma rakam\u0131 oldu\u011fu garantidir.<\/li>\n
- \u00c7\u0131kt\u0131n\u0131n 1 ile 3999 aras\u0131nda olmas\u0131 beklenir (\u00e7\u00fcnk\u00fc 3999, Roma rakamlar\u0131yla temsil edilebilen en b\u00fcy\u00fck say\u0131d\u0131r:
MMMCMXCIX<\/code>).<\/li>\n<\/ul>\nBu k\u0131s\u0131tlamalar, \u00e7\u00f6z\u00fcm\u00fcm\u00fcz\u00fcn belirli s\u0131n\u0131rlar i\u00e7inde \u00e7al\u0131\u015faca\u011f\u0131n\u0131 ve a\u015f\u0131r\u0131 b\u00fcy\u00fck say\u0131lar veya ge\u00e7ersiz karakterlerle u\u011fra\u015fmam\u0131za gerek kalmayaca\u011f\u0131n\u0131 g\u00f6sterir.<\/p>\n
Neden \u00d6nemli Bir Problem?<\/h4>\n
Bu problem, string i\u015fleme, ko\u015fullu mant\u0131k y\u00fcr\u00fctme ve veri yap\u0131lar\u0131n\u0131 (harita\/s\u00f6zl\u00fck) etkin bir \u015fekilde kullanma becerilerini test etti\u011fi i\u00e7in \u00f6nemlidir. M\u00fclakatlarda, adaylar\u0131n problem \u00e7\u00f6zme yakla\u015f\u0131m\u0131n\u0131, kenar durumlar\u0131 ele alma yetene\u011fini ve temiz kod yazma al\u0131\u015fkanl\u0131klar\u0131n\u0131 de\u011ferlendirmek i\u00e7in idealdir.<\/p>\n
Temel \u00c7\u00f6z\u00fcm Yakla\u015f\u0131m\u0131: Soldan Sa\u011fa Tarama<\/h3>\n
Roma rakamlar\u0131n\u0131 tam say\u0131ya \u00e7evirmenin birden fazla yolu olsa da, en sezgisel ve etkili yakla\u015f\u0131mlardan biri stringi soldan sa\u011fa do\u011fru taramakt\u0131r. Bu y\u00f6ntem, \u00e7\u0131karma kural\u0131n\u0131 ak\u0131ll\u0131ca ele alarak do\u011fru sonucu verir.<\/p>\n
Sembol De\u011ferlerini E\u015fleme<\/h4>\n
\u0130lk ad\u0131m, her Roma rakam\u0131 sembol\u00fcn\u00fcn kar\u015f\u0131l\u0131k gelen tam say\u0131 de\u011ferini h\u0131zl\u0131ca alabilece\u011fimiz bir e\u015fleme (s\u00f6zl\u00fck veya harita) olu\u015fturmakt\u0131r. Bu, her sembol\u00fc i\u015flerken s\u00fcrekli if-else bloklar\u0131 yazmaktan daha verimlidir.<\/p>\n
roman_map = {\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000\n}\n<\/pre>\n<\/code><\/p>\n
Soldan Sa\u011fa Tarama Mant\u0131\u011f\u0131<\/h4>\n
Stringi soldan sa\u011fa tararken, her bir sembol\u00fcn de\u011ferini bir sonraki sembol\u00fcn de\u011feriyle kar\u015f\u0131la\u015ft\u0131r\u0131r\u0131z. E\u011fer mevcut sembol\u00fcn de\u011feri bir sonraki sembol\u00fcn de\u011ferinden k\u00fc\u00e7\u00fckse, bu bir \u00e7\u0131karma durumudur. Bu durumda, mevcut sembol\u00fcn de\u011ferini toplamdan \u00e7\u0131karmam\u0131z gerekir. Aksi takdirde, mevcut sembol\u00fcn de\u011ferini toplama ekleriz.<\/p>\n
Kar\u015f\u0131la\u015ft\u0131rmal\u0131 Analiz<\/h4>\n
\u00d6rne\u011fin, \"IV\"<\/code> i\u00e7in:<\/p>\n\nI<\/code> (1) ve V<\/code> (5) kar\u015f\u0131la\u015ft\u0131r\u0131l\u0131r. 1 < 5 oldu\u011fu i\u00e7in, 1'i toplamdan \u00e7\u0131kar\u0131r\u0131z.<\/li>\nV<\/code> (5) i\u015flenir. Bu son sembol oldu\u011fu i\u00e7in 5'i toplama ekleriz.<\/li>\n<\/ol>\nBa\u015flang\u0131\u00e7ta toplam 0 ise: 0 - 1 + 5 = 4. Bu yakla\u015f\u0131m, \u00e7\u0131karma kural\u0131n\u0131 otomatik olarak do\u011fru bir \u015fekilde ele al\u0131r.<\/p>\n
Algoritma Tasar\u0131m\u0131 ve Ad\u0131mlar<\/h3>\n
\u015eimdi, soldan sa\u011fa tarama yakla\u015f\u0131m\u0131n\u0131 kullanarak Roma rakam\u0131n\u0131 tam say\u0131ya \u00e7evirecek algoritman\u0131n ad\u0131mlar\u0131n\u0131 detayland\u0131ral\u0131m.<\/p>\n
1. Sembol-De\u011fer E\u015flemesi Olu\u015fturma<\/h4>\n
Yukar\u0131da bahsedildi\u011fi gibi, her Roma rakam\u0131 sembol\u00fcn\u00fc kar\u015f\u0131l\u0131k gelen tam say\u0131 de\u011ferine e\u015fleyen bir s\u00f6zl\u00fck (Python'da dict<\/code>, di\u011fer dillerde HashMap<\/code> veya Map<\/code>) tan\u0131mlay\u0131n. Bu, sembol de\u011ferlerine h\u0131zl\u0131 eri\u015fim sa\u011flar.<\/p>\n2. Toplam De\u011fi\u015fkenini Ba\u015flatma<\/h4>\n
Roma rakam\u0131n\u0131n tam say\u0131 kar\u015f\u0131l\u0131\u011f\u0131n\u0131 tutacak bir total<\/code> veya result<\/code> de\u011fi\u015fkeni tan\u0131mlay\u0131n ve ba\u015flang\u0131\u00e7 de\u011ferini 0 olarak ayarlay\u0131n.<\/p>\n3. Diziyi Tarama Stratejisi<\/h4>\n
Verilen Roma rakam\u0131 stringini soldan sa\u011fa, yani ilk karakterden son karaktere kadar d\u00f6ng\u00fc ile taray\u0131n. D\u00f6ng\u00fc, son karakterden bir \u00f6nceki karaktere kadar gitmeli, \u00e7\u00fcnk\u00fc her ad\u0131mda mevcut karakteri bir sonraki karakterle kar\u015f\u0131la\u015ft\u0131raca\u011f\u0131z.<\/p>\n
4. Ko\u015fullu Toplama\/\u00c7\u0131karma Mant\u0131\u011f\u0131<\/h4>\n
D\u00f6ng\u00fcn\u00fcn her ad\u0131m\u0131nda, mevcut karakterin (s[i]<\/code>) de\u011ferini bir sonraki karakterin (s[i+1]<\/code>) de\u011feriyle kar\u015f\u0131la\u015ft\u0131r\u0131n:<\/p>\n\n- E\u011fer
roman_map[s[i]] < roman_map[s[i+1]]<\/code> ise (\u00e7\u0131karma durumu), total -= roman_map[s[i]]<\/code> yap\u0131n.<\/li>\n- Aksi takdirde (toplama durumu),
total += roman_map[s[i]]<\/code> yap\u0131n.<\/li>\n<\/ul>\nD\u00f6ng\u00fc bittikten sonra, son karakterin de\u011feri hen\u00fcz toplama eklenmemi\u015f olacakt\u0131r. Son karakter her zaman toplama eklenmelidir, \u00e7\u00fcnk\u00fc onun sa\u011f\u0131nda kar\u015f\u0131la\u015ft\u0131r\u0131lacak ba\u015fka bir karakter yoktur ve asla bir \u00e7\u0131karma durumunun par\u00e7as\u0131 olamaz.<\/p>\n
total += roman_map[s[len(s)-1]]<\/code><\/p>\nPython ile Kodlama ve Uygulama<\/h3>\n
\u015eimdi bu algoritmay\u0131 Python dilinde nas\u0131l uygulayaca\u011f\u0131m\u0131za bakal\u0131m.<\/p>\n
Yard\u0131mc\u0131 Fonksiyonlar ve Veri Yap\u0131lar\u0131<\/h4>\n
Bu problem i\u00e7in \u00f6zel bir yard\u0131mc\u0131 fonksiyona gerek yoktur, ancak roman_map<\/code> s\u00f6zl\u00fc\u011f\u00fc temel veri yap\u0131m\u0131z olacakt\u0131r.<\/p>\n\u00d6rnek Kodlama (Python)<\/h4>\nclass Solution:\n def romanToInt(self, s: str) -> int:\n roman_map = {\n 'I': 1, 'V': 5, 'X': 10, 'L': 50,\n 'C': 100, 'D': 500, 'M': 1000\n }\n\n total = 0\n n = len(s)\n\n # Son karakterden bir \u00f6nceki karaktere kadar d\u00f6ng\u00fc\n for i in range(n - 1):\n current_val = roman_map[s[i]]\n next_val = roman_map[s[i+1]]\n\n if current_val < next_val:\n total -= current_val\n else:\n total += current_val\n \n # Son karakterin de\u011ferini ekle\n total += roman_map[s[n-1]]\n \n return total\n\n# Test Durumlar\u0131\nsolution = Solution()\nprint(f\"'III' -> {solution.romanToInt('III')}\") # Beklenen: 3\nprint(f\"'LVIII' -> {solution.romanToInt('LVIII')}\") # Beklenen: 58\nprint(f\"'MCMXCIV' -> {solution.romanToInt('MCMXCIV')}\") # Beklenen: 1994\nprint(f\"'IV' -> {solution.romanToInt('IV')}\") # Beklenen: 4\nprint(f\"'IX' -> {solution.romanToInt('IX')}\") # Beklenen: 9\n<\/pre>\n<\/code><\/p>\n
Test Durumlar\u0131 ve Do\u011frulama<\/h4>\n
Yukar\u0131daki kod blo\u011funda verilen test durumlar\u0131, algoritman\u0131n farkl\u0131 senaryolarda (sadece toplama, \u00e7\u0131karma i\u00e7eren, kar\u0131\u015f\u0131k) do\u011fru \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 do\u011frulamak i\u00e7in yeterlidir. LeetCode'da g\u00f6nderdi\u011finizde, platform kendi kapsaml\u0131 test setlerini kullanarak \u00e7\u00f6z\u00fcm\u00fcn\u00fcz\u00fc de\u011ferlendirecektir.<\/p>\n
Performans Analizi: Zaman ve Alan Karma\u015f\u0131kl\u0131\u011f\u0131<\/h3>\n
Bir algoritman\u0131n etkinli\u011fini de\u011ferlendirmenin iki ana yolu, zaman karma\u015f\u0131kl\u0131\u011f\u0131 (ne kadar h\u0131zl\u0131 \u00e7al\u0131\u015ft\u0131\u011f\u0131) ve alan karma\u015f\u0131kl\u0131\u011f\u0131d\u0131r (ne kadar bellek kulland\u0131\u011f\u0131).<\/p>\n
Zaman Karma\u015f\u0131kl\u0131\u011f\u0131 (Time Complexity)<\/h4>\n
Algoritmam\u0131z, Roma rakam\u0131 stringini ba\u015ftan sona tek bir d\u00f6ng\u00fc ile tarar. Stringin uzunlu\u011fu n<\/code> ise, d\u00f6ng\u00fc n-1<\/code> kez \u00e7al\u0131\u015f\u0131r. Her d\u00f6ng\u00fc iterasyonunda s\u00f6zl\u00fckten de\u011fer okuma ve basit aritmetik i\u015flemler yap\u0131l\u0131r ki bunlar sabit zamanl\u0131 (O(1)) i\u015flemlerdir. Dolay\u0131s\u0131yla, algoritman\u0131n zaman karma\u015f\u0131kl\u0131\u011f\u0131 O(n) veya do\u011frusal zamand\u0131r. Bu, m\u00fcmk\u00fcn olan en iyi zaman karma\u015f\u0131kl\u0131klar\u0131ndan biridir, \u00e7\u00fcnk\u00fc t\u00fcm stringi en az bir kez okumak zorunday\u0131z.<\/p>\nAlan Karma\u015f\u0131kl\u0131\u011f\u0131 (Space Complexity)<\/h4>\n
Algoritmam\u0131z, Roma rakam\u0131 sembollerini ve de\u011ferlerini depolamak i\u00e7in bir s\u00f6zl\u00fck (roman_map<\/code>) kullan\u0131r. Bu s\u00f6zl\u00fck, yedi sabit say\u0131da eleman i\u00e7erir. Giri\u015f stringinin uzunlu\u011fundan ba\u011f\u0131ms\u0131z olarak boyutu de\u011fi\u015fmez. Bu nedenle, algoritman\u0131n alan karma\u015f\u0131kl\u0131\u011f\u0131 O(1) veya sabit aland\u0131r. Bu da olduk\u00e7a verimli bir bellek kullan\u0131m\u0131 anlam\u0131na gelir.<\/p>\nSonu\u00e7<\/h3>\n
\"13. Roman to Integer\" problemi, basit ancak incelikli bir string i\u015fleme ve ko\u015fullu mant\u0131k \u00f6rne\u011fidir. Roma rakamlar\u0131n\u0131n kendine \u00f6zg\u00fc \u00e7\u0131karma kurallar\u0131n\u0131, soldan sa\u011fa tarama ve bir sonraki karakterle kar\u015f\u0131la\u015ft\u0131rma stratejisiyle zarif\u00e7e \u00e7\u00f6zebiliriz. Python'daki s\u00f6zl\u00fckler gibi veri yap\u0131lar\u0131n\u0131 kullanarak bu e\u015flemeyi verimli bir \u015fekilde y\u00f6netmek, kodun hem okunabilirli\u011fini hem de performans\u0131n\u0131 art\u0131r\u0131r. O(n) zaman ve O(1) alan karma\u015f\u0131kl\u0131\u011f\u0131 ile bu \u00e7\u00f6z\u00fcm, hem teorik hem de pratik a\u00e7\u0131dan olduk\u00e7a verimlidir. Bu problemi ba\u015far\u0131yla \u00e7\u00f6zmek, m\u00fclakatlarda temel algoritma becerilerinizi sergilemek i\u00e7in harika bir f\u0131rsatt\u0131r.<\/p>\n
S\u0131k\u00e7a Sorulan Sorular (SSS)<\/h3>\nNeden sa\u011fdan sola tarama yerine soldan sa\u011fa tarama daha kolay?<\/h4>\n
Soldan sa\u011fa tarama, mevcut sembol\u00fcn bir sonraki sembolden k\u00fc\u00e7\u00fck olup olmad\u0131\u011f\u0131n\u0131 kontrol ederek \u00e7\u0131karma kural\u0131n\u0131 do\u011frudan uygular. Sa\u011fdan sola taramada ise her zaman toplama yap\u0131l\u0131r, ancak mevcut sembol\u00fcn de\u011feri bir \u00f6nceki sembol\u00fcn de\u011ferinden k\u00fc\u00e7\u00fckse, mevcut sembol\u00fcn de\u011feri negatif olarak eklenir. Her iki yakla\u015f\u0131m da \u00e7al\u0131\u015f\u0131r, ancak soldan sa\u011fa yakla\u015f\u0131m genellikle daha sezgisel bulunur.<\/p>\n
Bu problemde farkl\u0131 veri yap\u0131lar\u0131 kullan\u0131labilir mi?<\/h4>\n
roman_map<\/code> i\u00e7in s\u00f6zl\u00fck (dictionary\/hash map) en uygun veri yap\u0131s\u0131d\u0131r \u00e7\u00fcnk\u00fc O(1) ortalama zamanda arama imkan\u0131 sunar. Alternatif olarak, uzun bir if-elif-else<\/code> zinciri veya sabit boyutlu bir dizi de kullan\u0131labilir, ancak s\u00f6zl\u00fck daha temiz ve geni\u015fletilebilir bir \u00e7\u00f6z\u00fcmd\u00fcr.<\/p>\nRoma rakamlar\u0131 neden bu kadar k\u0131s\u0131tl\u0131 bir aral\u0131kta (1-3999)?<\/h4>\n
Antik Roma sisteminde, 3999'dan daha b\u00fcy\u00fck say\u0131lar i\u00e7in yeni semboller veya farkl\u0131 g\u00f6sterimler (\u00f6rne\u011fin, bir sembol\u00fcn \u00fczerine \u00e7izgi \u00e7ekmek gibi) kullan\u0131l\u0131rd\u0131. Ancak modern bilgisayar bilimlerinde ve bu LeetCode probleminde, genellikle 1'den 3999'a kadar olan standart Roma rakamlar\u0131 kurallar\u0131 uygulan\u0131r.<\/p>\n
Bu problemin ger\u00e7ek d\u00fcnya uygulamalar\u0131 var m\u0131?<\/h4>\n
Do\u011frudan Roma rakamlar\u0131n\u0131 \u00e7evirme ihtiyac\u0131 nadir olsa da, bu problemde kullan\u0131lan temel prensipler (string ayr\u0131\u015ft\u0131rma, sembol tabanl\u0131 kurallar\u0131 yorumlama, ko\u015fullu mant\u0131k) bir\u00e7ok ger\u00e7ek d\u00fcnya uygulamas\u0131nda kar\u015f\u0131m\u0131za \u00e7\u0131kar. \u00d6rne\u011fin, dosya formatlar\u0131n\u0131 ayr\u0131\u015ft\u0131rma, programlama dillerini yorumlama veya \u00f6zel metin formatlar\u0131n\u0131 i\u015fleme gibi durumlarda benzer mant\u0131klar kullan\u0131l\u0131r.<\/p>\n","protected":false},"excerpt":{"rendered":"Roma rakamlar\u0131 yedi temel sembol kullan\u0131r ve her birinin belirli bir tam say\u0131 de\u011feri vard\u0131r:","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1],"tags":[],"class_list":{"0":"post-36720","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-genel","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\n
Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz - Kodlar\u0131n Gizemli D\u00fcnyas\u0131<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz\" \/>\n<meta property=\"og:description\" content=\"Roma rakamlar\u0131 yedi temel sembol kullan\u0131r ve her birinin belirli bir tam say\u0131 de\u011feri vard\u0131r:\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-12-22T00:00:34+00:00\" \/>\n<meta name=\"author\" content=\"Fatih Soysal\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Yazan:\" \/>\n\t<meta name=\"twitter:data1\" content=\"Fatih Soysal\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tahmini okuma s\u00fcresi\" \/>\n\t<meta name=\"twitter:data2\" content=\"10 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz\",\"datePublished\":\"2025-12-22T00:00:34+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\"},\"wordCount\":1713,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\",\"name\":\"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz - Kodlar\u0131n Gizemli D\u00fcnyas\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-12-22T00:00:34+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/\",\"name\":\"Fatihsoysal.com\",\"description\":\"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim\",\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"tr\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\",\"name\":\"Fatih Soysal\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"contentUrl\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"width\":512,\"height\":512,\"caption\":\"Fatih Soysal\"},\"logo\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\"},\"description\":\"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/","og_locale":"tr_TR","og_type":"article","og_title":"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz","og_description":"Roma rakamlar\u0131 yedi temel sembol kullan\u0131r ve her birinin belirli bir tam say\u0131 de\u011feri vard\u0131r:","og_url":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-12-22T00:00:34+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"10 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz","datePublished":"2025-12-22T00:00:34+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/"},"wordCount":1713,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/","url":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/","name":"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-12-22T00:00:34+00:00","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/roma-rakamlarini-tam-sayiya-cevirme-leetcode-13-detayli-analiz\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Roma Rakamlar\u0131n\u0131 Tam Say\u0131ya \u00c7evirme: LeetCode #13 Detayl\u0131 Analiz"}]},{"@type":"WebSite","@id":"https:\/\/fatihsoysal.com\/blog\/#website","url":"https:\/\/fatihsoysal.com\/blog\/","name":"Fatihsoysal.com","description":"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim","publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"tr"},{"@type":["Person","Organization"],"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1","name":"Fatih Soysal","image":{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","contentUrl":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","width":512,"height":512,"caption":"Fatih Soysal"},"logo":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/"},"description":"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.","url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/"}]}},"yoast_meta":{"yoast_wpseo_title":"","yoast_wpseo_metadesc":"","yoast_wpseo_canonical":""},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/36720","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/comments?post=36720"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/36720\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=36720"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=36720"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=36720"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}