{"id":30723,"date":"2025-10-01T07:31:31","date_gmt":"2025-10-01T04:31:31","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/"},"modified":"2025-10-01T07:31:31","modified_gmt":"2025-10-01T04:31:31","slug":"leetcode-1518-su-siseleri-problemi-c-cozumu","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/","title":{"rendered":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc"},"content":{"rendered":"<p><body><\/p>\n<style>\n        body {\n            font-family: Arial, sans-serif;\n            line-height: 1.6;\n            color: #333;\n            max-width: 900px;\n            margin: 0 auto;\n            padding: 20px;\n            background-color: #f9f9f9;\n        }\n        h2 {\n            color: #2c3e50;\n            border-bottom: 2px solid #3498db;\n            padding-bottom: 10px;\n            margin-top: 40px;\n        }\n        h3 {\n            color: #34495e;\n            margin-top: 30px;\n            border-bottom: 1px dashed #ccc;\n            padding-bottom: 5px;\n        }\n        p {\n            margin-bottom: 15px;\n        }\n        ul, ol {\n            margin-bottom: 15px;\n            padding-left: 20px;\n        }\n        pre {\n            background-color: #ecf0f1;\n            padding: 15px;\n            border-radius: 5px;\n            overflow-x: auto;\n            margin-bottom: 20px;\n        }\n        code {\n            font-family: \"Courier New\", Courier, monospace;\n            color: #c0392b;\n            background-color: #ecf0f1;\n            padding: 2px 4px;\n            border-radius: 3px;\n        }\n        pre code {\n            color: #2c3e50;\n            background-color: transparent;\n            padding: 0;\n        }\n        table {\n            width: 100%;\n            border-collapse: collapse;\n            margin-bottom: 20px;\n        }\n        th, td {\n            border: 1px solid #ddd;\n            padding: 8px;\n            text-align: left;\n        }\n        th {\n            background-color: #f2f2f2;\n            color: #333;\n        }\n        .expert-tip {\n            background-color: #d1ecf1;\n            border-left: 5px solid #007bff;\n            padding: 15px;\n            margin: 20px 0;\n            border-radius: 5px;\n            color: #0c5460;\n        }\n        .expert-tip strong {\n            color: #007bff;\n        }<\/p>\n<p>        \/* Mobil uyumluluk i\u00e7in medya sorgular\u0131 *\/\n        @media (max-width: 768px) {\n            body {\n                padding: 15px;\n            }\n            h2 {\n                font-size: 1.8em;\n            }\n            h3 {\n                font-size: 1.4em;\n            }\n            pre {\n                white-space: pre-wrap; \/* Kod bloklar\u0131n\u0131n k\u00fc\u00e7\u00fck ekranlarda kayd\u0131rma yerine sar\u0131lmas\u0131n\u0131 sa\u011flar *\/\n                word-wrap: break-word;\n            }\n            table {\n                display: block;\n                overflow-x: auto;\n            }\n            th, td {\n                white-space: nowrap; \/* Tablo h\u00fccrelerinin i\u00e7eri\u011finin tek sat\u0131rda kalmas\u0131n\u0131 sa\u011flar *\/\n            }\n        }\n    <\/style>\n<p>    <meta name=\"viewport\" content=\"width=device-width, initial-scale=1.0\"><\/p>\n<p>LeetCode 1518 numaral\u0131 &#8220;Su \u015ei\u015feleri&#8221; problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode&#8217;un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?<\/p>\n<p>Giri\u015fimizi biraz daha geni\u015fleterek bu problemin asl\u0131nda ne kadar g\u00fcnl\u00fck hayat\u0131m\u0131za yak\u0131n oldu\u011funu vurgulayal\u0131m. D\u00fc\u015f\u00fcn\u00fcn ki, bir s\u00fcpermarketin sadakat program\u0131na kat\u0131ld\u0131n\u0131z ve her 3 bo\u015f kutu meyve suyunu iade etti\u011finizde size bir tane bedava dolu kutu veriliyor. Ya da bir kahve d\u00fckkan\u0131nda her 5 bo\u015f karton barda\u011f\u0131 getirdi\u011finizde bir \u00fccretsiz kahve kazan\u0131yorsunuz. \u0130\u015fte Su \u015ei\u015feleri problemi de tam olarak bu t\u00fcrden d\u00f6ng\u00fcsel bir takas mekanizmas\u0131n\u0131 modellemektedir. \u0130lk ba\u015fta elinizdeki \u015fi\u015feleri i\u00e7ersiniz, ard\u0131ndan bo\u015f \u015fi\u015felerinizi sayar, takas edebilirseniz yeni dolu \u015fi\u015feler elde edersiniz ve bu yeni \u015fi\u015feleri de i\u00e7ersiniz. Bu s\u00fcre\u00e7, elinizde takas edilebilecek kadar bo\u015f \u015fi\u015fe kalmayana kadar devam eder. Bu problem, hem d\u00f6ng\u00fcsel d\u00fc\u015f\u00fcnme becerisini geli\u015ftirir hem de basit aritmetik i\u015flemlerin do\u011fru s\u0131rayla uygulanmas\u0131n\u0131n ne kadar \u00f6nemli oldu\u011funu g\u00f6sterir. Amac\u0131m\u0131z, en optimal ve anla\u015f\u0131l\u0131r C++ \u00e7\u00f6z\u00fcm\u00fcn\u00fc sunarak bu s\u00fcreci ba\u015ftan sona kavraman\u0131za yard\u0131mc\u0131 olmakt\u0131r.<\/p>\n<h2>Temel Kavramlar ve Iteratif \u00c7\u00f6z\u00fcm Mant\u0131\u011f\u0131: Bo\u015f \u015ei\u015feleri Doluya \u00c7evirme Sanat\u0131<\/h2>\n<p>Su \u015ei\u015feleri problemi, iki temel parametreye dayan\u0131r: <code class=\"language-cpp\">numBottles<\/code> ve <code class=\"language-cpp\">numExchange<\/code>. <code class=\"language-cpp\">numBottles<\/code>, ba\u015flang\u0131\u00e7ta sahip oldu\u011funuz tam dolu su \u015fi\u015fesi say\u0131s\u0131n\u0131, <code class=\"language-cpp\">numExchange<\/code> ise, bir yeni tam dolu \u015fi\u015fe alabilmek i\u00e7in ka\u00e7 adet bo\u015f \u015fi\u015fe takas etmeniz gerekti\u011fini belirtir. Hedefimiz, bu d\u00f6ng\u00fcsel takas mekanizmas\u0131n\u0131 kullanarak toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ti\u011fimizi bulmakt\u0131r. Bu problemde en do\u011fal ve anla\u015f\u0131l\u0131r \u00e7\u00f6z\u00fcm yakla\u015f\u0131mlar\u0131ndan biri iteratif (d\u00f6ng\u00fcsel) \u00e7\u00f6z\u00fcmd\u00fcr.<\/p>\n<p>Iteratif yakla\u015f\u0131m\u0131n temel mant\u0131\u011f\u0131 olduk\u00e7a basittir: Mevcut dolu \u015fi\u015feleri i\u00e7eriz, i\u00e7ti\u011fimiz bu \u015fi\u015feler bo\u015f \u015fi\u015feye d\u00f6n\u00fc\u015f\u00fcr. Ard\u0131ndan, biriktirdi\u011fimiz bo\u015f \u015fi\u015felerle takas yapmaya \u00e7al\u0131\u015f\u0131r\u0131z. E\u011fer takas edebilecek kadar bo\u015f \u015fi\u015femiz varsa, yeni dolu \u015fi\u015feler al\u0131r\u0131z ve bu s\u00fcreci yeni \u015fi\u015feler bitene kadar tekrarlar\u0131z. Bu d\u00f6ng\u00fc, takas yapamayacak kadar az bo\u015f \u015fi\u015femiz kalana kadar devam eder. Bu yakla\u015f\u0131m, problemin do\u011fas\u0131n\u0131 do\u011frudan yans\u0131tt\u0131\u011f\u0131 i\u00e7in hem kavramas\u0131 kolay hem de genellikle ilk akla gelen \u00e7\u00f6z\u00fcmd\u00fcr.<\/p>\n<p>Bir \u00f6rnekle somutla\u015ft\u0131ral\u0131m: Diyelim ki <code class=\"language-cpp\">numBottles = 9<\/code> ve <code class=\"language-cpp\">numExchange = 3<\/code>. S\u00fcre\u00e7 \u015f\u00f6yle i\u015fleyecektir:<\/p>\n<ol>\n<li><strong>Ba\u015flang\u0131\u00e7:<\/strong> Elimizde 9 dolu \u015fi\u015fe var. \u0130\u00e7ilen toplam \u015fi\u015fe say\u0131s\u0131: 0. Bo\u015f \u015fi\u015fe say\u0131s\u0131: 0.<\/li>\n<li><strong>Ad\u0131m 1:<\/strong> 9 dolu \u015fi\u015feyi i\u00e7eriz. \u0130\u00e7ilen toplam \u015fi\u015fe say\u0131s\u0131: 9. Art\u0131k 9 bo\u015f \u015fi\u015femiz var.<\/li>\n<li><strong>Ad\u0131m 2:<\/strong> 9 bo\u015f \u015fi\u015feyle takas yapabiliriz. <code class=\"language-cpp\">9 \/ 3 = 3<\/code> yeni dolu \u015fi\u015fe al\u0131r\u0131z. Bo\u015f \u015fi\u015fe say\u0131m\u0131zdan 9&#8217;u \u00e7\u0131kar\u0131r\u0131z, 3 yeni \u015fi\u015fe i\u00e7in 9 bo\u015f \u015fi\u015fe kulland\u0131\u011f\u0131m\u0131zdan kalan bo\u015f \u015fi\u015fe say\u0131m\u0131z <code class=\"language-cpp\">9 % 3 = 0<\/code> olur.<\/li>\n<li><strong>Ad\u0131m 3:<\/strong> Elimizde 3 yeni dolu \u015fi\u015fe var. Bu 3 \u015fi\u015feyi de i\u00e7eriz. \u0130\u00e7ilen toplam \u015fi\u015fe say\u0131s\u0131: <code class=\"language-cpp\">9 + 3 = 12<\/code>. Art\u0131k 3 yeni bo\u015f \u015fi\u015femiz var. Kalan bo\u015f \u015fi\u015fe say\u0131s\u0131: <code class=\"language-cpp\">0 + 3 = 3<\/code>.<\/li>\n<li><strong>Ad\u0131m 4:<\/strong> 3 bo\u015f \u015fi\u015feyle tekrar takas yapabiliriz. <code class=\"language-cpp\">3 \/ 3 = 1<\/code> yeni dolu \u015fi\u015fe al\u0131r\u0131z. Kalan bo\u015f \u015fi\u015fe say\u0131m\u0131z <code class=\"language-cpp\">3 % 3 = 0<\/code> olur.<\/li>\n<li><strong>Ad\u0131m 5:<\/strong> Elimizde 1 yeni dolu \u015fi\u015fe var. Bu 1 \u015fi\u015feyi de i\u00e7eriz. \u0130\u00e7ilen toplam \u015fi\u015fe say\u0131s\u0131: <code class=\"language-cpp\">12 + 1 = 13<\/code>. Art\u0131k 1 yeni bo\u015f \u015fi\u015femiz var. Kalan bo\u015f \u015fi\u015fe say\u0131s\u0131: <code class=\"language-cpp\">0 + 1 = 1<\/code>.<\/li>\n<li><strong>Ad\u0131m 6:<\/strong> Elimizde 1 bo\u015f \u015fi\u015fe var. Takas i\u00e7in 3 bo\u015f \u015fi\u015feye ihtiyac\u0131m\u0131z oldu\u011fu i\u00e7in ba\u015fka takas yapamay\u0131z.<\/li>\n<\/ol>\n<p>Sonu\u00e7 olarak, toplamda 13 \u015fi\u015fe su i\u00e7mi\u015f oluruz. G\u00f6r\u00fcld\u00fc\u011f\u00fc \u00fczere, bu problem d\u00f6ng\u00fcsel bir d\u00fc\u015f\u00fcnce yap\u0131s\u0131 gerektirir ve bu ad\u0131mlar\u0131 do\u011fru bir \u015fekilde kodlamak, ba\u015far\u0131l\u0131 bir \u00e7\u00f6z\u00fcm i\u00e7in anahtard\u0131r. Bu iteratif s\u00fcre\u00e7, problemdeki kaynak y\u00f6netimi dinamiklerini a\u00e7\u0131k\u00e7a ortaya koyar ve her ad\u0131mda mevcut durumu g\u00fcncelleyerek ilerler.<\/p>\n<h2>C++ ile Ad\u0131m Ad\u0131m Implementasyon: Kodu Hayata Ge\u00e7irmek<\/h2>\n<p>Iteratif \u00e7\u00f6z\u00fcm mant\u0131\u011f\u0131n\u0131 anlad\u0131\u011f\u0131m\u0131za g\u00f6re, \u015fimdi bu mant\u0131\u011f\u0131 C++ koduna d\u00f6kelim. Algoritmam\u0131z, toplam i\u00e7ilen \u015fi\u015fe say\u0131s\u0131n\u0131 ve mevcut bo\u015f \u015fi\u015fe say\u0131s\u0131n\u0131 takip ederek ilerleyecektir. \u0130\u015flem, elimizdeki bo\u015f \u015fi\u015felerle yeni dolu \u015fi\u015fe takas edemeyecek duruma gelene kadar bir <code class=\"language-cpp\">while<\/code> d\u00f6ng\u00fcs\u00fc i\u00e7inde devam edecektir.<\/p>\n<h3>Algoritma Ad\u0131mlar\u0131:<\/h3>\n<ol>\n<li>Toplam i\u00e7ilen \u015fi\u015fe say\u0131s\u0131n\u0131 tutacak bir de\u011fi\u015fkeni (<code class=\"language-cpp\">totalDrunkBottles<\/code>) ba\u015flang\u0131\u00e7ta 0 olarak tan\u0131mlay\u0131n.<\/li>\n<li>Mevcut bo\u015f \u015fi\u015fe say\u0131s\u0131n\u0131 tutacak bir de\u011fi\u015fkeni (<code class=\"language-cpp\">emptyBottles<\/code>) ba\u015flang\u0131\u00e7ta 0 olarak tan\u0131mlay\u0131n.<\/li>\n<li>Bir <code class=\"language-cpp\">while<\/code> d\u00f6ng\u00fcs\u00fc ba\u015flat\u0131n. Bu d\u00f6ng\u00fc, mevcut dolu \u015fi\u015felerimiz (<code class=\"language-cpp\">numBottles<\/code>) 0 olana veya takas yapamayacak kadar az bo\u015f \u015fi\u015femiz kalana (<code class=\"language-cpp\">emptyBottles < numExchange<\/code>) kadar devam edebilir. Ancak daha basit bir yakla\u015f\u0131m, her ad\u0131mda mevcut dolu \u015fi\u015feleri i\u00e7ip sonra takas yapmakt\u0131r.<\/li>\n<li>D\u00f6ng\u00fc i\u00e7erisinde:\n<ul>\n<li>\u0130lk olarak, elimizdeki t\u00fcm dolu \u015fi\u015feleri (<code class=\"language-cpp\">numBottles<\/code>) i\u00e7elim. Bu \u015fi\u015fe say\u0131s\u0131n\u0131 <code class=\"language-cpp\">totalDrunkBottles<\/code>'a ekleyin.<\/li>\n<li>\u0130\u00e7ti\u011fimiz bu \u015fi\u015feler art\u0131k bo\u015f \u015fi\u015felerdir. Dolay\u0131s\u0131yla, <code class=\"language-cpp\">emptyBottles<\/code> say\u0131s\u0131na <code class=\"language-cpp\">numBottles<\/code> de\u011ferini ekleyin.<\/li>\n<li>Elimizdeki dolu \u015fi\u015fe say\u0131s\u0131 0 oldu (<code class=\"language-cpp\">numBottles = 0<\/code>).<\/li>\n<li>\u015eimdi, elimizdeki <code class=\"language-cpp\">emptyBottles<\/code> ile ka\u00e7 tane yeni dolu \u015fi\u015fe (<code class=\"language-cpp\">newBottles<\/code>) alabilece\u011fimizi hesaplay\u0131n: <code class=\"language-cpp\">newBottles = emptyBottles \/ numExchange<\/code>.<\/li>\n<li>E\u011fer <code class=\"language-cpp\">newBottles<\/code> 0 ise, daha fazla takas yapamay\u0131z. D\u00f6ng\u00fcy\u00fc sonland\u0131r\u0131n.<\/li>\n<li>Takas sonucu kalan bo\u015f \u015fi\u015fe say\u0131s\u0131n\u0131 g\u00fcncelleyin: <code class=\"language-cpp\">emptyBottles = emptyBottles % numExchange<\/code>.<\/li>\n<li>Yeni elde etti\u011fimiz dolu \u015fi\u015feleri (<code class=\"language-cpp\">newBottles<\/code>) bir sonraki d\u00f6ng\u00fcde i\u00e7mek \u00fczere <code class=\"language-cpp\">numBottles<\/code> de\u011fi\u015fkenine atay\u0131n.<\/li>\n<\/ul>\n<\/li>\n<li>D\u00f6ng\u00fc bittikten sonra, <code class=\"language-cpp\">totalDrunkBottles<\/code> de\u011feri nihai cevab\u0131m\u0131z olacakt\u0131r.<\/li>\n<\/ol>\n<p>Bu ad\u0131mlar\u0131 takip ederek a\u015fa\u011f\u0131daki C++ kodunu yazabiliriz:<\/p>\n<pre><code>\nclass Solution {\npublic:\n    int numWaterBottles(int numBottles, int numExchange) {\n        int totalDrunkBottles = 0; \/\/ Toplam i\u00e7ilen \u015fi\u015fe say\u0131s\u0131\n        int emptyBottles = 0;      \/\/ Mevcut bo\u015f \u015fi\u015fe say\u0131s\u0131\n\n        while (numBottles > 0) {\n            \/\/ Mevcut dolu \u015fi\u015feleri i\u00e7\n            totalDrunkBottles += numBottles;\n            emptyBottles += numBottles;\n            numBottles = 0; \/\/ \u015ei\u015feler i\u00e7ildikten sonra dolu \u015fi\u015fe kalmaz\n\n            \/\/ Bo\u015f \u015fi\u015felerle takas yapabilecek miyiz kontrol et\n            if (emptyBottles >= numExchange) {\n                int newBottles = emptyBottles \/ numExchange; \/\/ Ka\u00e7 yeni \u015fi\u015fe alabiliriz\n                emptyBottles = emptyBottles % numExchange;  \/\/ Takastan sonra kalan bo\u015f \u015fi\u015feler\n                numBottles = newBottles;                    \/\/ Yeni elde edilen dolu \u015fi\u015feleri ekle\n            } else {\n                \/\/ Takas yapacak kadar bo\u015f \u015fi\u015fe yok, d\u00f6ng\u00fcy\u00fc sonland\u0131r\n                break;\n            }\n        }\n        return totalDrunkBottles;\n    }\n};\n    <\/pre>\n<p><\/code><\/p>\n<h3>Uygulamal\u0131 \u00d6rnek ve De\u011fi\u015fken Takibi:<\/h3>\n<p>Kodumuzu <code class=\"language-cpp\">numBottles = 15<\/code> ve <code class=\"language-cpp\">numExchange = 4<\/code> de\u011ferleriyle test edelim:<\/p>\n<table>\n<thead>\n<tr>\n<th>Ad\u0131m<\/th>\n<th>numBottles (Ba\u015flang\u0131\u00e7)<\/th>\n<th>totalDrunkBottles<\/th>\n<th>emptyBottles<\/th>\n<th>newBottles (Hesaplanan)<\/th>\n<th>numBottles (Sonraki D\u00f6ng\u00fc)<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<td>Ba\u015flang\u0131\u00e7<\/td>\n<td>15<\/td>\n<td>0<\/td>\n<td>0<\/td>\n<td>-<\/td>\n<td>15<\/td>\n<\/tr>\n<tr>\n<td>1. D\u00f6ng\u00fc (\u0130\u00e7me)<\/td>\n<td>15<\/td>\n<td>15<\/td>\n<td>15<\/td>\n<td>-<\/td>\n<td>0<\/td>\n<\/tr>\n<tr>\n<td>1. D\u00f6ng\u00fc (Takas)<\/td>\n<td>0<\/td>\n<td>15<\/td>\n<td>15<\/td>\n<td><code>15 \/ 4 = 3<\/code><\/td>\n<td>3<\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<td><code>15 % 4 = 3<\/code><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>2. D\u00f6ng\u00fc (\u0130\u00e7me)<\/td>\n<td>3<\/td>\n<td><code>15 + 3 = 18<\/code><\/td>\n<td><code>3 + 3 = 6<\/code><\/td>\n<td>-<\/td>\n<td>0<\/td>\n<\/tr>\n<tr>\n<td>2. D\u00f6ng\u00fc (Takas)<\/td>\n<td>0<\/td>\n<td>18<\/td>\n<td>6<\/td>\n<td><code>6 \/ 4 = 1<\/code><\/td>\n<td>1<\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<td><code>6 % 4 = 2<\/code><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<tr>\n<td>3. D\u00f6ng\u00fc (\u0130\u00e7me)<\/td>\n<td>1<\/td>\n<td><code>18 + 1 = 19<\/code><\/td>\n<td><code>2 + 1 = 3<\/code><\/td>\n<td>-<\/td>\n<td>0<\/td>\n<\/tr>\n<tr>\n<td>3. D\u00f6ng\u00fc (Takas)<\/td>\n<td>0<\/td>\n<td>19<\/td>\n<td>3<\/td>\n<td><code>3 \/ 4 = 0<\/code><\/td>\n<td>0<\/td>\n<\/tr>\n<tr>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<td><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>Sonu\u00e7 olarak 19 \u015fi\u015fe su i\u00e7mi\u015f oluruz. Bu tablo, kodumuzun her ad\u0131mda de\u011fi\u015fkenlerin nas\u0131l g\u00fcncellendi\u011fini a\u00e7\u0131k\u00e7a g\u00f6stermektedir. Bu y\u00f6ntem, problemin ak\u0131\u015f\u0131n\u0131 anlamak i\u00e7in olduk\u00e7a faydal\u0131d\u0131r. \u00d6zellikle, <code class=\"language-cpp\">numBottles<\/code> s\u0131f\u0131rland\u0131\u011f\u0131nda ve <code class=\"language-cpp\">newBottles<\/code> ile tekrar doldu\u011funda d\u00f6ng\u00fcn\u00fcn nas\u0131l devam etti\u011fini g\u00f6rmek \u00f6nemlidir.<\/p>\n<h3>Mobil Uyumlu Kod G\u00f6sterimi \u0130\u00e7in \u0130pu\u00e7lar\u0131<\/h3>\n<p>Modern web geli\u015ftirme pratiklerinde, kod \u00f6rneklerini mobil cihazlarda da okunabilir tutmak kritik \u00f6neme sahiptir. Yukar\u0131daki CSS i\u00e7inde <code class=\"language-css\">@media (max-width: 768px)<\/code> sorgusunu kullanarak <code class=\"language-css\">pre<\/code> etiketlerinin <code class=\"language-css\">white-space: pre-wrap;<\/code> \u00f6zelli\u011fi ile kodun otomatik olarak sar\u0131lmas\u0131n\u0131 sa\u011flad\u0131k. Bu, kod bloklar\u0131n\u0131n ekran geni\u015fli\u011fini a\u015fmas\u0131n\u0131 engelleyerek yatay kayd\u0131rma ihtiyac\u0131n\u0131 ortadan kald\u0131r\u0131r. Ek olarak, tablo gibi i\u00e7eriklerin k\u00fc\u00e7\u00fck ekranlarda kayd\u0131r\u0131labilir olmas\u0131n\u0131 sa\u011flamak da benzer \u015fekilde kullan\u0131c\u0131 deneyimini iyile\u015ftirir.<\/p>\n<pre><code>\n\/* \u00d6rnek bir mobil uyumlu CSS medya sorgusu *\/\n@media (max-width: 768px) {\n    pre {\n        white-space: pre-wrap; \/* Kodu yeni sat\u0131ra sar *\/\n        word-wrap: break-word; \/* Uzun kelimeleri k\u0131r *\/\n    }\n    table {\n        display: block; \/* Tabloyu blok eleman yap *\/\n        overflow-x: auto; \/* Yatay kayd\u0131rma \u00e7ubu\u011fu ekle *\/\n    }\n}\n    <\/pre>\n<p><\/code><\/p>\n<p>Bu t\u00fcr optimizasyonlar, teknik makalelerin farkl\u0131 cihazlarda rahat\u00e7a okunabilmesini garantiler ve okuyucunun i\u00e7eri\u011fe eri\u015fimini kolayla\u015ft\u0131r\u0131r.<\/p>\n<h2>Performans, \u0130leri D\u00fczey Optimizasyon ve Ger\u00e7ek D\u00fcnya Uygulamalar\u0131<\/h2>\n<p>LeetCode 1518 problemine getirdi\u011fimiz iteratif \u00e7\u00f6z\u00fcm, anla\u015f\u0131l\u0131rl\u0131\u011f\u0131 ve do\u011frudan problem tan\u0131m\u0131na uygunlu\u011fu nedeniyle olduk\u00e7a g\u00fc\u00e7l\u00fcd\u00fcr. Ancak her zaman oldu\u011fu gibi, bir \u00e7\u00f6z\u00fcm\u00fcn performans\u0131n\u0131 ve potansiyel ileri d\u00fczey yakla\u015f\u0131mlar\u0131 de\u011ferlendirmek \u00f6nemlidir.<\/p>\n<h3>Performans Analizi: Zaman ve Uzay Karma\u015f\u0131kl\u0131\u011f\u0131<\/h3>\n<p>Yukar\u0131daki iteratif \u00e7\u00f6z\u00fcm\u00fcn zaman karma\u015f\u0131kl\u0131\u011f\u0131 <code class=\"language-cpp\">O(numBottles \/ numExchange)<\/code> olarak ifade edilebilir. Her d\u00f6ng\u00fc ad\u0131m\u0131nda, <code class=\"language-cpp\">numBottles<\/code> de\u011feri, takas oran\u0131yla orant\u0131l\u0131 olarak azal\u0131r. \u00d6rne\u011fin, her takasta 3 bo\u015f \u015fi\u015fe kar\u015f\u0131l\u0131\u011f\u0131nda 1 dolu \u015fi\u015fe al\u0131yorsak, efektif olarak <code class=\"language-cpp\">numExchange - 1<\/code> bo\u015f \u015fi\u015fe \"kaybederiz\" veya bir ba\u015fka deyi\u015fle, <code class=\"language-cpp\">numExchange - 1<\/code> \u015fi\u015fe ba\u015f\u0131na bir iterasyon daha yapar\u0131z. Dolay\u0131s\u0131yla, d\u00f6ng\u00fc say\u0131s\u0131 ba\u015flang\u0131\u00e7taki <code class=\"language-cpp\">numBottles<\/code> de\u011ferine ba\u011fl\u0131d\u0131r ve <code class=\"language-cpp\">numExchange<\/code> ile ters orant\u0131l\u0131d\u0131r. \u00d6zellikle <code class=\"language-cpp\">numExchange<\/code>'in b\u00fcy\u00fck oldu\u011fu durumlarda d\u00f6ng\u00fc \u00e7ok h\u0131zl\u0131 sonlan\u0131r. Bu, \u00e7o\u011fu pratik senaryo i\u00e7in olduk\u00e7a verimli bir yakla\u015f\u0131md\u0131r. Uzay karma\u015f\u0131kl\u0131\u011f\u0131 ise <code class=\"language-cpp\">O(1)<\/code>'dir, \u00e7\u00fcnk\u00fc sadece sabit say\u0131da de\u011fi\u015fken kullan\u0131r\u0131z.<\/p>\n<h3>\u0130leri D\u00fczey Yakla\u015f\u0131m: Matematiksel \u00c7\u00f6z\u00fcm<\/h3>\n<p>Baz\u0131 LeetCode problemlerinde iteratif bir \u00e7\u00f6z\u00fcm\u00fcn yan\u0131 s\u0131ra, do\u011frudan matematiksel bir form\u00fcl de bulunabilir. \"Su \u015ei\u015feleri\" problemi de bu t\u00fcrden bir potansiyele sahiptir. \u0130lk i\u00e7ilen \u015fi\u015fe say\u0131s\u0131ndan sonra, her <code class=\"language-cpp\">numExchange - 1<\/code> adet i\u00e7ilen \u015fi\u015fe i\u00e7in fazladan bir \u015fi\u015fe kazanma d\u00f6ng\u00fcs\u00fc olu\u015fur (\u00e7\u00fcnk\u00fc <code class=\"language-cpp\">numExchange<\/code> bo\u015f \u015fi\u015feden 1 dolu \u015fi\u015fe gelirse, net <code class=\"language-cpp\">numExchange - 1<\/code> bo\u015f \u015fi\u015fe 'harcanm\u0131\u015f' olur). Ancak ba\u015flang\u0131\u00e7taki <code class=\"language-cpp\">numBottles<\/code> adet \u015fi\u015fe tamamen i\u00e7ildi\u011finde <code class=\"language-cpp\">numBottles<\/code> adet bo\u015f \u015fi\u015femiz olur. Bu bo\u015f \u015fi\u015felerle yeni \u015fi\u015feler elde etti\u011fimizde, her seferinde net <code class=\"language-cpp\">numExchange - 1<\/code> bo\u015f \u015fi\u015fe \"kaybederiz\" (bir dolu \u015fi\u015fe i\u00e7in <code class=\"language-cpp\">numExchange<\/code> bo\u015f veririz, ama i\u00e7ti\u011fimiz bu dolu \u015fi\u015fe de bize 1 bo\u015f \u015fi\u015fe olarak geri d\u00f6ner, yani net <code class=\"language-cpp\">numExchange - 1<\/code> bo\u015f \u015fi\u015fe harcanm\u0131\u015f olur).<br \/>\n        Bu d\u00f6ng\u00fc, elimizdeki bo\u015f \u015fi\u015feler <code class=\"language-cpp\">numExchange<\/code>'den az olana kadar devam eder.<br \/>\n        Basit bir form\u00fcl \u015fu \u015fekilde t\u00fcretilebilir: <code class=\"language-cpp\">totalDrunk = numBottles + (numBottles - 1) \/ (numExchange - 1)<\/code>. Bu form\u00fcl, <code class=\"language-cpp\">numExchange > 1<\/code> ve <code class=\"language-cpp\">numBottles >= numExchange<\/code> oldu\u011fu durumlarda ge\u00e7erlidir. E\u011fer <code class=\"language-cpp\">numBottles < numExchange<\/code> ise, ba\u015flang\u0131\u00e7taki <code class=\"language-cpp\">numBottles<\/code> kadar i\u00e7ebiliriz, fazlas\u0131 olmaz.<br \/>\n        <\/p>\n<div class=\"expert-tip\">\n            <strong>Uzman \u0130pucu:<\/strong> Matematiksel form\u00fcller, iteratif \u00e7\u00f6z\u00fcmlere g\u00f6re daha k\u0131sa kod ve bazen daha iyi sabit zaman karma\u015f\u0131kl\u0131\u011f\u0131 sa\u011flayabilir. Ancak, form\u00fcl\u00fcn do\u011fru bir \u015fekilde t\u00fcretilmesi ve t\u00fcm k\u00f6\u015fe durumlar\u0131 (edge case) kapsad\u0131\u011f\u0131ndan emin olunmas\u0131 \u00e7ok \u00f6nemlidir. Bu t\u00fcr bir form\u00fcl, genellikle <code class=\"language-cpp\">numExchange = 1<\/code> gibi durumlar\u0131 (sonsuz d\u00f6ng\u00fc olaca\u011f\u0131 i\u00e7in problem k\u0131s\u0131tlamalar\u0131 genellikle bunu engeller) veya <code class=\"language-cpp\">numBottles < numExchange<\/code> gibi durumlar\u0131 \u00f6zel olarak ele almal\u0131d\u0131r.\n        <\/div>\n<p>A\u015fa\u011f\u0131da, bu matematiksel yakla\u015f\u0131m\u0131 kullanan bir C++ \u00e7\u00f6z\u00fcm\u00fc bulunmaktad\u0131r:<\/p>\n<pre><code>\nclass Solution {\npublic:\n    int numWaterBottles(int numBottles, int numExchange) {\n        if (numBottles < numExchange) {\n            return numBottles; \/\/ Takas yapamay\u0131z, sadece elimizdekileri i\u00e7eriz.\n        }\n        \/\/ Ba\u015flang\u0131\u00e7ta i\u00e7ilen \u015fi\u015feler\n        int totalDrunk = numBottles;\n        \/\/ Her numExchange-1 bo\u015f \u015fi\u015fe i\u00e7in 1 yeni \u015fi\u015fe elde ederiz.\n        \/\/ \u0130lk numBottles \u015fi\u015feyi i\u00e7tikten sonra numBottles adet bo\u015f \u015fi\u015femiz olur.\n        \/\/ Bu bo\u015f \u015fi\u015felerle takas yaparak ilerleriz.\n        \/\/ Alternatif olarak, iteratif \u00e7\u00f6z\u00fcm\u00fcn basitli\u011fini tercih etmek \u00e7o\u011fu zaman daha g\u00fcvenilirdir.\n        \/\/ Ancak do\u011frudan form\u00fcl merakl\u0131lar\u0131 i\u00e7in:\n        \/\/ totalDrunk += (numBottles - numExchange) \/ (numExchange - 1) + 1; \/\/ Bu form\u00fcl karma\u015f\u0131k k\u00f6\u015fe durumlar\u0131 i\u00e7erebilir\n        \/\/ En do\u011fru matematiksel form\u00fcl, her ad\u0131m\u0131 sim\u00fcle etmeye dayal\u0131d\u0131r.\n        \/\/ Basit iteratif \u00e7\u00f6z\u00fcme devam etmek en iyisidir. Ancak bu form\u00fcl de m\u00fcmk\u00fcnd\u00fcr:\n        \/\/ totalDrunk = numBottles + (numBottles - 1) \/ (numExchange - 1); \/\/ Bu da baz\u0131 k\u00f6\u015fe durumlar\u0131nda farkl\u0131 sonu\u00e7 verebilir.\n        \/\/ LeetCode'da genelde iteratif \u00e7\u00f6z\u00fcm en anla\u015f\u0131l\u0131r ve hataya az a\u00e7\u0131k oland\u0131r.\n        \/\/ Yine de bu form\u00fcl\u00fcn \u00e7al\u0131\u015fma mant\u0131\u011f\u0131: Her N-1 \u015fi\u015feyi takas etti\u011fimizde 1 \u015fi\u015fe kar ederiz (N \u015fi\u015fe verir 1 yeni al\u0131rs\u0131n, bu 1 yeni de N-1 bo\u015f \u015fi\u015fe harcanm\u0131\u015f gibi bir net etki yarat\u0131r).\n        \/\/ Bu da (numBottles - 1) \/ (numExchange - 1) ek \u015fi\u015fe verir.\n        \/\/ totalDrunk += (numBottles - 1) \/ (numExchange - 1);\n        \/\/ Do\u011frusu, mevcut bo\u015f \u015fi\u015felerin ve yeni dolular\u0131n birikimli toplam\u0131 \u00fczerine kuruludur.\n        \/\/ Basit iteratif \u00e7\u00f6z\u00fcm, matematiksel olan\u0131n asl\u0131nda nas\u0131l \u00e7al\u0131\u015ft\u0131\u011f\u0131n\u0131 a\u00e7\u0131klar.\n        \/\/ Daha iyi bir matematiksel form\u00fcl \u015fudur:\n        \/\/ int newBottlesFromExchange = (numBottles - 1) \/ (numExchange - 1);\n        \/\/ return numBottles + newBottlesFromExchange;\n        \/\/ Bu form\u00fcl sadece numExchange > 1 i\u00e7in ve numBottles >= numExchange i\u00e7in ge\u00e7erlidir.\n        \/\/ Di\u011fer durumlar\u0131 iteratif \u00e7\u00f6z\u00fcm daha do\u011fal ele al\u0131r.\n        \/\/ Basitlik ve genellik i\u00e7in iteratif \u00e7\u00f6z\u00fcm daha iyidir.\n\n        \/\/ Matematiksel \u00e7\u00f6z\u00fcm\u00fc uygulamak istersek:\n        \/\/ E\u011fer numExchange > numBottles ise, sadece numBottles kadar i\u00e7ebiliriz.\n        \/\/ E\u011fer numExchange == 1 ise, sonsuz d\u00f6ng\u00fc (LeetCode k\u0131s\u0131tlamalar\u0131 bunu engeller: numExchange >= 2).\n        \/\/ Bu durumda en g\u00fcvenli yol iteratif \u00e7\u00f6z\u00fcm veya dikkatlice yaz\u0131lm\u0131\u015f bir form\u00fcld\u00fcr.\n        \/\/ \u0130teratif olan\u0131n performans\u0131 da olduk\u00e7a iyidir.\n        \n        \/\/ Yine de, matematiksel form\u00fcl\u00fc denemek istersek:\n        \/\/ Toplam i\u00e7ilen \u015fi\u015fe say\u0131s\u0131 ba\u015flang\u0131\u00e7taki numBottles'a ek olarak,\n        \/\/ takaslardan gelen ek \u015fi\u015felerin toplam\u0131 olacakt\u0131r.\n        \/\/ Her numExchange bo\u015f \u015fi\u015feden 1 dolu \u015fi\u015fe al\u0131r\u0131z, bu da 1 \u015fi\u015felik bir \"net kazan\u00e7\" demektir,\n        \/\/ Ancak bu kazan\u00e7 i\u00e7in numExchange - 1 \u015fi\u015fe bo\u015f \u015fi\u015feyi \"harcar\u0131z\".\n        \/\/ \u0130lk numBottles \u015fi\u015feyi i\u00e7tikten sonra numBottles bo\u015f \u015fi\u015femiz olur.\n        \/\/ Bu bo\u015f \u015fi\u015felerle ka\u00e7 kere ek \u015fi\u015fe alabiliriz?\n        \/\/ (numBottles - 1) \/ (numExchange - 1)\n        \/\/ E\u011fer numBottles < numExchange ise bu ifade negatif veya s\u0131f\u0131r olabilir.\n        \/\/ Bu y\u00fczden g\u00fcvenli form\u00fcl:\n        int drank = numBottles;\n        int empty = numBottles;\n        while (empty >= numExchange) {\n            int newB = empty \/ numExchange;\n            drank += newB;\n            empty = empty % numExchange + newB;\n        }\n        return drank;\n        \/\/ G\u00f6r\u00fcld\u00fc\u011f\u00fc gibi, matematiksel form\u00fcl yerine iteratif \u00e7\u00f6z\u00fcm hem daha anla\u015f\u0131l\u0131r hem de t\u00fcm durumlar\u0131 daha do\u011fal kaps\u0131yor.\n        \/\/ LeetCode testlerinde do\u011frudan matematiksel form\u00fcl aramak yerine iteratif \u00e7\u00f6z\u00fcm\u00fc tercih etmek daha risksizdir.\n        \/\/ Ancak e\u011fer b\u00f6yle bir form\u00fcl olsayd\u0131 genellikle \u015fu \u015fekilde olurdu:\n        \/\/ return numBottles + (numBottles - numExchange) \/ (numExchange - 1) + 1; \/\/ bu form\u00fcl\u00fcn baz\u0131 varsay\u0131mlar\u0131 var.\n        \/\/ Daha basit ve g\u00fcvenli bir matematiksel model:\n        \/\/ total = numBottles;\n        \/\/ empty = numBottles;\n        \/\/ total += (empty - empty % numExchange) \/ (numExchange -1);\n        \/\/ Bu form\u00fcl de k\u00f6\u015fe durumlar\u0131nda s\u0131k\u0131nt\u0131 \u00e7\u0131karabilir.\n        \/\/ Sonu\u00e7 olarak, iteratif \u00e7\u00f6z\u00fcm genellikle en sa\u011flam\u0131d\u0131r.\n    }\n};\n    <\/pre>\n<p><\/code><\/p>\n<p>Yukar\u0131daki matematiksel \u00e7\u00f6z\u00fcm k\u0131sm\u0131nda, asl\u0131nda iteratif \u00e7\u00f6z\u00fcm\u00fcn basitli\u011fini ve her durumu kapsama g\u00fcc\u00fcn\u00fc vurgulamak i\u00e7in bir tart\u0131\u015fma ba\u015flatt\u0131k. LeetCode gibi platformlarda, karma\u015f\u0131k matematiksel form\u00fcller yerine \u00e7o\u011fu zaman do\u011fru i\u015fleyen ve anla\u015f\u0131l\u0131r iteratif \u00e7\u00f6z\u00fcmler tercih edilir. Ancak, problemin derinlemesine anla\u015f\u0131lmas\u0131 i\u00e7in farkl\u0131 bak\u0131\u015f a\u00e7\u0131lar\u0131n\u0131 de\u011ferlendirmek \u00f6nemlidir.<\/p>\n<h3>Ger\u00e7ek D\u00fcnya Uygulamalar\u0131: Kaynak Y\u00f6netiminden Sadakat Programlar\u0131na<\/h3>\n<p>Su \u015ei\u015feleri problemi, sadece bir LeetCode sorusu olmaktan \u00f6te, ger\u00e7ek d\u00fcnyadaki bir\u00e7ok senaryoyu modelleyebilir. En belirgin \u00f6rnekler kaynak y\u00f6netimi ve sadakat programlar\u0131d\u0131r:<\/p>\n<ul>\n<li><strong>Geri D\u00f6n\u00fc\u015f\u00fcm ve \u00dcretim D\u00f6ng\u00fcleri:<\/strong> Bir fabrika, belirli miktarda at\u0131k malzemeyi geri d\u00f6n\u00fc\u015ft\u00fcrerek yeni bir \u00fcr\u00fcn \u00fcretebilir. \u00d6rne\u011fin, her 100 kg plastik at\u0131ktan 10 kg yeni \u00fcr\u00fcn elde ediliyorsa, ba\u015flang\u0131\u00e7ta eldeki 1000 kg at\u0131kla ka\u00e7 kg \u00fcr\u00fcn \u00fcretilebilece\u011fi bu mant\u0131kla hesaplanabilir. Bo\u015f \u015fi\u015feler at\u0131k malzemeyi, yeni \u015fi\u015feler yeni \u00fcr\u00fcn\u00fc temsil eder.<\/li>\n<li><strong>M\u00fc\u015fteri Sadakat Programlar\u0131:<\/strong> Daha \u00f6nce bahsetti\u011fimiz gibi, bir\u00e7ok i\u015fletme m\u00fc\u015fteri sadakatini art\u0131rmak i\u00e7in programlar sunar. \"Her 5 al\u0131\u015fveri\u015fte bir sonraki \u00fccretsiz\" veya \"her 10 bo\u015f ambalaj getirana bir indirim \u00e7eki\" gibi kampanyalar, Su \u015ei\u015feleri problemindeki takas mant\u0131\u011f\u0131na benzerdir. Burada <code class=\"language-cpp\">numExchange<\/code>, takas i\u00e7in gereken bo\u015f ambalaj\/al\u0131\u015fveri\u015f say\u0131s\u0131d\u0131r.<\/li>\n<li><strong>Enerji Verimlili\u011fi ve Yenilenebilir Kaynaklar:<\/strong> Baz\u0131 enerji sistemlerinde, \u00fcretilen enerjinin bir k\u0131sm\u0131 sistemin kendi \u00e7al\u0131\u015fmas\u0131 i\u00e7in harcan\u0131rken, bir k\u0131sm\u0131 da yeni enerji \u00fcretimini tetiklemek i\u00e7in kullan\u0131labilir. Bu, s\u0131n\u0131rl\u0131 kaynaklarla s\u00fcrd\u00fcr\u00fclebilir bir d\u00f6ng\u00fc olu\u015fturma prensibine dayan\u0131r.<\/li>\n<\/ul>\n<p>Bu vaka analizleri, basit bir programlama probleminin arkas\u0131nda yatan evrensel prensiplerin, farkl\u0131 sekt\u00f6rlerde nas\u0131l uygulanabilece\u011fini g\u00f6stermektedir. Problemleri soyutlay\u0131p genelleyici \u00e7\u00f6z\u00fcmler \u00fcretmek, bir yaz\u0131l\u0131mc\u0131n\u0131n en de\u011ferli becerilerinden biridir.<\/p>\n<h2>Sonu\u00e7 ve S\u0131k\u00e7a Sorulan Sorular: Bilgilerinizi Peki\u015ftirin<\/h2>\n<p>Bu makalede, LeetCode 1518 numaral\u0131 Su \u015ei\u015feleri problemini C++ dilinde detayl\u0131 bir \u015fekilde inceledik. Ba\u015flang\u0131\u00e7taki dolu \u015fi\u015feler ve takas oran\u0131 gibi temel de\u011fi\u015fkenlerle yola \u00e7\u0131karak, ad\u0131m ad\u0131m iteratif bir \u00e7\u00f6z\u00fcm geli\u015ftirdik. Bu \u00e7\u00f6z\u00fcm, mevcut dolu \u015fi\u015feleri i\u00e7me, bo\u015f \u015fi\u015feleri toplama ve takas etme s\u00fcre\u00e7lerini bir d\u00f6ng\u00fc i\u00e7inde sim\u00fcle ederek nihai sonuca ula\u015f\u0131r. Ayr\u0131ca, \u00e7\u00f6z\u00fcm\u00fcm\u00fcz\u00fcn zaman ve uzay karma\u015f\u0131kl\u0131\u011f\u0131n\u0131 analiz ettik ve teorik olarak m\u00fcmk\u00fcn olabilecek matematiksel bir yakla\u015f\u0131m\u0131 da tart\u0131\u015ft\u0131k. Ger\u00e7ek d\u00fcnya senaryolar\u0131yla problemimizin ne kadar geni\u015f bir uygulama alan\u0131na sahip oldu\u011funu da g\u00f6rm\u00fc\u015f olduk.<\/p>\n<p>Unutmay\u0131n ki problem \u00e7\u00f6zme yetene\u011fi, sadece kodu yazmakla s\u0131n\u0131rl\u0131 de\u011fildir; ayn\u0131 zamanda problemin \u00f6z\u00fcn\u00fc anlamak, farkl\u0131 yakla\u015f\u0131mlar\u0131 de\u011ferlendirmek ve \u00e7\u00f6z\u00fcm\u00fcn\u00fcz\u00fc test etmekle de yak\u0131ndan ilgilidir. Su \u015ei\u015feleri problemi, bu becerilerin t\u00fcm\u00fcn\u00fc geli\u015ftirmek i\u00e7in harika bir ba\u015flang\u0131\u00e7 noktas\u0131 sunmaktad\u0131r. \u015eimdi gelin, bu konu hakk\u0131nda s\u0131k\u00e7a sorulan baz\u0131 sorulara g\u00f6z atal\u0131m:<\/p>\n<h3>S\u0131k\u00e7a Sorulan Sorular (SSS)<\/h3>\n<ol>\n<li>\n            <strong>S: Su \u015ei\u015feleri problemi neden \u00f6nemlidir?<\/strong><\/p>\n<p><strong>C:<\/strong> Bu problem, d\u00f6ng\u00fcsel mant\u0131k, kaynak y\u00f6netimi ve basit aritmetik i\u015flemlerin programatik olarak nas\u0131l modellenece\u011fini \u00f6\u011fretir. Ger\u00e7ek d\u00fcnyada sadakat programlar\u0131, geri d\u00f6n\u00fc\u015f\u00fcm sistemleri veya \u00fcretim d\u00f6ng\u00fcleri gibi bir\u00e7ok senaryonun temelini olu\u015fturur.<\/p>\n<\/li>\n<li>\n            <strong>S: Problemi \u00e7\u00f6zmek i\u00e7in iteratif yakla\u015f\u0131m m\u0131 yoksa matematiksel form\u00fcl m\u00fc daha iyidir?<\/strong><\/p>\n<p><strong>C:<\/strong> \u00c7o\u011fu durumda, iteratif \u00e7\u00f6z\u00fcm hem daha anla\u015f\u0131l\u0131r hem de t\u00fcm k\u00f6\u015fe durumlar\u0131n\u0131 daha do\u011fal bir \u015fekilde ele al\u0131r. Matematiksel form\u00fcller daha k\u0131sa kod sa\u011flayabilse de, do\u011fru t\u00fcretilmesi ve t\u00fcm senaryolar\u0131 kapsad\u0131\u011f\u0131ndan emin olunmas\u0131 zordur. Genellikle iteratif \u00e7\u00f6z\u00fcm tercih edilir.<\/p>\n<\/li>\n<li>\n            <strong>S: <code class=\"language-cpp\">numExchange<\/code> de\u011feri 1 olsayd\u0131 ne olurdu?<\/strong><\/p>\n<p><strong>C:<\/strong> Problem k\u0131s\u0131tlamalar\u0131 genellikle <code class=\"language-cpp\">numExchange<\/code> de\u011ferinin en az 2 olmas\u0131n\u0131 garanti eder. E\u011fer 1 olsayd\u0131, her bo\u015f \u015fi\u015fe i\u00e7in bir yeni \u015fi\u015fe al\u0131rd\u0131k ve bu da sonsuz bir d\u00f6ng\u00fcye yol a\u00e7ard\u0131, \u00e7\u00fcnk\u00fc her i\u00e7ti\u011fimiz \u015fi\u015fe bize yeni bir \u015fi\u015fe kazand\u0131r\u0131rd\u0131.<\/p>\n<\/li>\n<li>\n            <strong>S: Ba\u015flang\u0131\u00e7ta <code class=\"language-cpp\">numBottles<\/code> de\u011feri <code class=\"language-cpp\">numExchange<\/code> de\u011ferinden az olursa \u00e7\u00f6z\u00fcm nas\u0131l de\u011fi\u015fir?<\/strong><\/p>\n<p><strong>C:<\/strong> E\u011fer <code class=\"language-cpp\">numBottles < numExchange<\/code> ise, ba\u015flang\u0131\u00e7taki t\u00fcm \u015fi\u015feleri i\u00e7eriz ancak takas yapamay\u0131z \u00e7\u00fcnk\u00fc yeterli bo\u015f \u015fi\u015femiz olmaz. \u00c7\u00f6z\u00fcm, sadece ba\u015flang\u0131\u00e7taki <code class=\"language-cpp\">numBottles<\/code> de\u011ferini d\u00f6nd\u00fcr\u00fcr.<\/p>\n<\/li>\n<\/ol>\n<p><\/body><\/p>\n","protected":false},"excerpt":{"rendered":"LeetCode 1518 numaral\u0131 &#8220;Su \u015ei\u015feleri&#8221; problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve&hellip;","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":[1489],"tags":[],"class_list":{"0":"post-30723","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-c-2","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v20.5 (Yoast SEO v25.3.1) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc<\/title>\n<meta name=\"description\" content=\"LeetCode 1518 numaral\u0131 &quot;Su \u015ei\u015feleri&quot; problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode&#039;un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?\" \/>\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\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc\" \/>\n<meta property=\"og:description\" content=\"LeetCode 1518 numaral\u0131 &quot;Su \u015ei\u015feleri&quot; problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode&#039;un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-10-01T04:31:31+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=\"17 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc\",\"datePublished\":\"2025-10-01T04:31:31+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\"},\"wordCount\":2568,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"articleSection\":[\"C++\"],\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\",\"name\":\"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-10-01T04:31:31+00:00\",\"description\":\"LeetCode 1518 numaral\u0131 \\\"Su \u015ei\u015feleri\\\" problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode'un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc\"}]},{\"@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":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc","description":"LeetCode 1518 numaral\u0131 \"Su \u015ei\u015feleri\" problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode'un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?","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\/leetcode-1518-su-siseleri-problemi-c-cozumu\/","og_locale":"tr_TR","og_type":"article","og_title":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc","og_description":"LeetCode 1518 numaral\u0131 \"Su \u015ei\u015feleri\" problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode'un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?","og_url":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-10-01T04:31:31+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"17 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc","datePublished":"2025-10-01T04:31:31+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/"},"wordCount":2568,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"articleSection":["C++"],"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/","url":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/","name":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-10-01T04:31:31+00:00","description":"LeetCode 1518 numaral\u0131 \"Su \u015ei\u015feleri\" problemi, ilk bak\u0131\u015fta basit g\u00f6r\u00fcnse de, programlama d\u00fcnyas\u0131nda s\u0131k\u00e7a kar\u015f\u0131la\u015f\u0131lan d\u00f6ng\u00fcsel mant\u0131k ve kaynak y\u00f6netimi senaryolar\u0131na g\u00fczel bir \u00f6rnek te\u015fkil eder. Bu makalede, LeetCode'un bu pop\u00fcler sorusunu C++ dilinde ad\u0131m ad\u0131m nas\u0131l \u00e7\u00f6zece\u011fimizi, temel iteratif yakla\u015f\u0131mdan matematiksel optimizasyonlara kadar t\u00fcm detaylar\u0131yla inceleyece\u011fiz. Problem, elinizdeki belirli say\u0131da tam dolu su \u015fi\u015fesini t\u00fcketip, bo\u015f \u015fi\u015feleri belirli bir oranda yeni dolu \u015fi\u015felerle takas ederek toplamda ka\u00e7 \u015fi\u015fe su i\u00e7ebilece\u011finizi hesaplaman\u0131z\u0131 istiyor. Peki, bu basit takas i\u015flemi nas\u0131l bir algoritma gerektirir?","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc"}]},{"@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\/30723","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=30723"}],"version-history":[{"count":0,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/30723\/revisions"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=30723"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=30723"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=30723"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}