{"blog_title":"pco2699\u2019s blog","version":"1.0","title":" LeetCode: Single Element in a Sorted Array\u3092\u89e3\u304f","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.pco2699.net%2Fentry%2F2020%2F05%2F12%2F214214\" title=\" LeetCode: Single Element in a Sorted Array\u3092\u89e3\u304f - pco2699\u2019s blog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_url":"https://blog.pco2699.net/","author_name":"pco2699","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%5Cdisplaystyle%7B%0Alog_2%28%7Bnum%7D%29%20%2B%201%0A%7D","width":"100%","published":"2020-05-12 21:42:14","provider_name":"Hatena Blog","type":"rich","url":"https://blog.pco2699.net/entry/2020/05/12/214214","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/pco2699/","height":"190","description":"\u554f\u984c May Leetcoding Challange Complement\u306e12\u65e5\u76ee\u3067\u3059\u3002 leetcode.com \u4ee5\u4e0b\u306e\u30ce\u30fc\u30c8\u306e\u66f8\u304d\u3063\u3077\u308a\u304b\u3089\u4e8c\u5206\u63a2\u7d22\u306e\u306b\u307b\u3072\u304c\u30d7\u30f3\u30d7\u30f3\u3057\u307e\u3059\u3002 \u5b9f\u969b\u3001\u4e8c\u5206\u63a2\u7d22\u306e\u554f\u984c\u3067\u3057\u305f\u3002 Note: Your solution should run in O(log n) time and O(1) space. \u89e3\u304d\u65b9 \u5834\u5408\u5206\u3051\u306e\u30d1\u30bf\u30fc\u30f3\u304c\u591a\u3044 and \u5076\u6570\u5947\u6570\u3067\u5224\u5b9a\u3059\u308b\u4e8c\u5206\u63a2\u7d22\u3067\u3059\u3002 \u4ee5\u4e0b\u306b\u96d1\u306b\u30d1\u30bf\u30fc\u30f3\u3092\u63cf\u304d\u307e\u3057\u305f\u3002\uff08\u30af\u30bd\u96d1\uff09 \u56de\u7b54 class Solution: def singleNonDuplicate(self, nums: List[int]) -> i\u2026","categories":["LeetCode"]}