{"published":"2022-03-13 04:00:00","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftakayasugiyama.com%2Fentry%2F2022%2F03%2F13%2F040000\" title=\"LeetCode Median of Two Sorted Arrays\u3092\u89e3\u3044\u3066\u307f\u305f - \u4f55\u304b\u3084\u3063\u3066\u307f\u308b\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0","blog_title":"\u4f55\u304b\u3084\u3063\u3066\u307f\u308b\u30d6\u30ed\u30b0","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/s-takaya1027/","provider_name":"Hatena Blog","description":"\u554f\u984c https://leetcode.com/problems/median-of-two-sorted-arrays/ \u89e3\u3044\u305f # @param {Integer[]} nums1 # @param {Integer[]} nums2 # @return {Float} def find_median_sorted_arrays(nums1, nums2) nums = (nums1 + nums2).sort result = 0 if nums.length.zero? return 0 end if nums.length == 1 return nums.first end if \u2026","blog_url":"https://takayasugiyama.com/","image_url":"https://cdn-ak.f.st-hatena.com/images/fotolife/s/s-takaya1027/20220312/20220312210919.png","title":"LeetCode Median of Two Sorted Arrays\u3092\u89e3\u3044\u3066\u307f\u305f","url":"https://takayasugiyama.com/entry/2022/03/13/040000","width":"100%","author_name":"s-takaya1027","type":"rich","categories":[]}