http://localhost:1313/categories/%E7%AE%97%E6%B3%95/ Recent content in 算法 on Jim Deng Hugo -- gohugo.io en dev@jimdeng.com (Jim Deng) dev@jimdeng.com (Jim Deng) © 2026 Jim Deng Sat, 07 Sep 2024 23:43:34 +0800 http://localhost:1313/posts/%E5%89%91%E6%8C%87offer/ Sat, 07 Sep 2024 23:43:34 +0800 dev@jimdeng.com (Jim Deng) http://localhost:1313/posts/%E5%89%91%E6%8C%87offer/ <h1 class="relative group">剑指offer(Go版本)-数组 <div id="剑指offergo版本-数组" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e5%89%91%e6%8c%87offergo%e7%89%88%e6%9c%ac-%e6%95%b0%e7%bb%84" aria-label="Anchor">#</a> </span> </h1> <h3 class="relative group">1.和为S的两个数字 <div id="1和为s的两个数字" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#1%e5%92%8c%e4%b8%bas%e7%9a%84%e4%b8%a4%e4%b8%aa%e6%95%b0%e5%ad%97" aria-label="Anchor">#</a> </span> </h3> <p>输入一个递增排序的数组和一个数字S，在数组中查找两个数，使得他们的和正好是S，如果有多对数字的和等于S，输出两个数的乘积最小的。</p>