{"description":"\u554f\u984c https://leetcode.com/problems/merge-two-sorted-lists/ \u89e3\u3044\u3066\u307f\u305f # Definition for singly-linked list. # class ListNode # attr_accessor :val, :next # def initialize(val = 0, _next = nil) # @val = val # @next = _next # end # end # @param {ListNode} list1 # @param {ListNode} list2 # @return {ListNode} de\u2026","blog_title":"\u4f55\u304b\u3084\u3063\u3066\u307f\u308b\u30d6\u30ed\u30b0","published":"2022-03-15 04:00:00","width":"100%","provider_name":"Hatena Blog","image_url":"https://cdn-ak.f.st-hatena.com/images/fotolife/s/s-takaya1027/20220313/20220313013450.png","blog_url":"https://takayasugiyama.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftakayasugiyama.com%2Fentry%2F2022%2F03%2F15%2F040000\" title=\"LeetCode Merge Two Sorted Lists\u3092\u89e3\u3044\u3066\u307f\u305f\u3002 - \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>","author_name":"s-takaya1027","provider_url":"https://hatena.blog","url":"https://takayasugiyama.com/entry/2022/03/15/040000","author_url":"https://blog.hatena.ne.jp/s-takaya1027/","type":"rich","title":"LeetCode Merge Two Sorted Lists\u3092\u89e3\u3044\u3066\u307f\u305f\u3002","categories":[],"version":"1.0","height":"190"}