{"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":"S\u0131ral\u0131 Dizi Birle\u015ftirme: Java ile LeetCode \u00c7\u00f6z\u00fcm\u00fc","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"oTO5IBvxUc\"><a href=\"https:\/\/fatihsoysal.com\/blog\/sirali-dizi-birlestirme-java-ile-leetcode-cozumu\/\">S\u0131ral\u0131 Dizi Birle\u015ftirme: Java ile LeetCode \u00c7\u00f6z\u00fcm\u00fc<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/fatihsoysal.com\/blog\/sirali-dizi-birlestirme-java-ile-leetcode-cozumu\/embed\/#?secret=oTO5IBvxUc\" width=\"600\" height=\"338\" title=\"&#8220;S\u0131ral\u0131 Dizi Birle\u015ftirme: Java ile LeetCode \u00c7\u00f6z\u00fcm\u00fc&#8221; &#8212; Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" data-secret=\"oTO5IBvxUc\" 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'un s\u0131k\u00e7a sorulan sorular\u0131ndan biri olan \"S\u0131ral\u0131 Dizi Birle\u015ftirme\" problemi, iki s\u0131ral\u0131 diziyi tek bir s\u0131ral\u0131 dizide birle\u015ftirmeyi hedefler. Bu problem, algoritma ve veri yap\u0131lar\u0131 bilginizi test eden \u00f6nemli bir sorudur. \u00d6ncelikle problemi daha iyi anlamak i\u00e7in \u00f6rnek bir senaryoya bakal\u0131m. \u0130ki s\u0131ral\u0131 dizimiz oldu\u011funu varsayal\u0131m: `nums1 = [1,2,3,0,0,0]` ve `nums2 = [2,5,6]`. Amac\u0131m\u0131z, `nums1` dizisinin sonuna `nums2` dizisini ekleyerek, sonucu `nums1 = [1,2,2,3,5,6]` olacak \u015fekilde birle\u015ftirmektir. Bu problemi nas\u0131l \u00e7\u00f6zebilece\u011fimize bakal\u0131m."}