{"componentChunkName":"component---src-templates-post-template-jsx","path":"/algo/posts/2023-06-10--007","result":{"data":{"site":{"siteMetadata":{"title":"Blog by Eunyoung","subtitle":"작업 기록 블로그","copyright":"© All rights reserved.","author":{"name":"EunYoung","twitter":"#"},"disqusShortname":"","url":"https://ssongey.github.io"}},"markdownRemark":{"id":"30e57b66-722b-5d4d-b70e-10f1d2d239dc","html":"

문제

\n\n

\n \n \n \n \n \n \n \n \n \n

\n\n
public static int search(int[] nums, int target) {\n    int endIndex = nums.length - 1;\n    int startIndex = 0;\n    int mid;\n    \n    while (startIndex <= endIndex) {\n        mid = (endIndex + startIndex) / 2;\n        \n        if(target == nums[mid]) {\n            return mid;\n        } else if (target > nums[mid]) {\n            startIndex = mid + 1;\n        } else {\n            endIndex = mid - 1;\n        }\n    }\n    \n    return -1;\n}
\n
\n

배웠다

\n","fields":{"tagSlugs":["/tags//"],"slug":"/algo/posts/2023-06-10--007"},"frontmatter":{"title":"Binary Search (easy)","tags":[""],"date":"2023-06-10","description":"neetcode"}}},"pageContext":{"slug":"/algo/posts/2023-06-10--007"}},"staticQueryHashes":[]}