{"version":"1.0","provider_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","provider_url":"https:\/\/fatihsoysal.com\/blog","author_name":"Fatih Soysal","author_url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/","title":"LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"4CZ7GOmWpD\"><a href=\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/\">LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/leetcode-1518-su-siseleri-problemi-c-cozumu\/embed\/#?secret=4CZ7GOmWpD\" width=\"600\" height=\"338\" title=\"&#8220;LeetCode 1518: Su \u015ei\u015feleri Problemi C++ \u00c7\u00f6z\u00fcm\u00fc&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"4CZ7GOmWpD\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n<\/script>\n","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?"}