239 lines
9.8 KiB
HTML
239 lines
9.8 KiB
HTML
|
<!DOCTYPE html>
|
|||
|
|
<html lang="zh-Hans">
|
|||
|
|
<head>
|
|||
|
|
<meta charset="UTF-8">
|
|||
|
|
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
|||
|
|
<title>066. 搜索旋转排序数组 – 图解</title>
|
|||
|
|
<link rel="stylesheet" href="../shared/style.css">
|
|||
|
|
<style>
|
|||
|
|
.vis-area { min-height: 120px; padding: 16px 0; }
|
|||
|
|
.code-section { margin-top: 16px; }
|
|||
|
|
.half-label { display:inline-block; padding:2px 8px; border-radius:6px; font-size:12px; font-weight:600; margin:0 4px; }
|
|||
|
|
.half-label.ordered { background:#dcfce7; color:#166534; }
|
|||
|
|
.half-label.unordered { background:#fef3c7; color:#92400e; }
|
|||
|
|
</style>
|
|||
|
|
</head>
|
|||
|
|
<body>
|
|||
|
|
<div class="container">
|
|||
|
|
<h1>🟡 066. 搜索旋转排序数组 <span class="badge medium">中等</span></h1>
|
|||
|
|
<p class="subtitle">分类：二分查找 ｜ LeetCode Hot 100</p>
|
|||
|
|
|
|||
|
|
<div class="controls" id="controls">
|
|||
|
|
<label for="inputArea">输入：</label>
|
|||
|
|
<input type="text" id="inputArea" placeholder="nums=[4,5,6,7,0,1,2], target=0">
|
|||
|
|
<button id="applyBtn" class="primary">生成图解</button>
|
|||
|
|
<select id="exampleSelect"></select>
|
|||
|
|
<span style="flex:1"></span>
|
|||
|
|
<button id="prevBtn">◀ 上一步</button>
|
|||
|
|
<button id="nextBtn">下一步 ▶</button>
|
|||
|
|
<button id="jumpBtn">⏭ 跳到结果</button>
|
|||
|
|
<button id="autoBtn">自动播放</button>
|
|||
|
|
<button id="resetBtn">重置</button>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<div class="pipeline" id="pipeline"></div>
|
|||
|
|
|
|||
|
|
<div class="hint info" id="hintBox">
|
|||
|
|
<span id="stepInfo"></span><br>
|
|||
|
|
<span id="hintText"></span>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<div class="panels">
|
|||
|
|
<div class="panel" id="mainPanel">
|
|||
|
|
<h3>📊 可视化</h3>
|
|||
|
|
<div class="vis-area" id="vizArea">点击「生成图解」开始</div>
|
|||
|
|
</div>
|
|||
|
|
<div class="panel-grid">
|
|||
|
|
<div class="panel" id="detailPanel">
|
|||
|
|
<h3>📝 当前步骤详情</h3>
|
|||
|
|
<div id="detailContent">等待开始...</div>
|
|||
|
|
</div>
|
|||
|
|
<div class="panel" id="resultPanel">
|
|||
|
|
<h3>✅ 结果</h3>
|
|||
|
|
<div id="resultContent">等待完成...</div>
|
|||
|
|
</div>
|
|||
|
|
</div>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<div class="panel code-section">
|
|||
|
|
<h3>💻 参考代码（Python）</h3>
|
|||
|
|
<div id="codeArea"></div>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<footer>Powered by QwenPaw · 图解算法 · LeetCode Hot 100</footer>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<script src="../shared/algo-viz.js"></script>
|
|||
|
|
<script>
|
|||
|
|
"use strict";
|
|||
|
|
(function() {
|
|||
|
|
const examples = [
|
|||
|
|
{nums:[4,5,6,7,0,1,2], target:0, label:'示例1: target=0'},
|
|||
|
|
{nums:[4,5,6,7,0,1,2], target:3, label:'示例2: target=3(不存在)'},
|
|||
|
|
{nums:[1], target:0, label:'示例3: [1], target=0'},
|
|||
|
|
{nums:[3,1], target:1, label:'示例4: [3,1], target=1'},
|
|||
|
|
];
|
|||
|
|
let numsArr, target, steps, stepCtrl;
|
|||
|
|
|
|||
|
|
function buildSteps(nums, tgt) {
|
|||
|
|
numsArr = nums; target = tgt;
|
|||
|
|
steps = [];
|
|||
|
|
|
|||
|
|
if (nums.length === 0) {
|
|||
|
|
steps.push({stage:'notFound', msg:'数组为空', left:0, right:-1, mid:-1, found:false, ans:-1, orderedHalf:''});
|
|||
|
|
return;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
let left = 0, right = nums.length - 1;
|
|||
|
|
steps.push({stage:'init', msg:`初始化：left=${left}, right=${right}，旋转排序数组`, left, right, mid:-1, found:false, ans:-1, orderedHalf:''});
|
|||
|
|
|
|||
|
|
while (left <= right) {
|
|||
|
|
const mid = Math.floor((left + right) / 2);
|
|||
|
|
if (nums[mid] === tgt) {
|
|||
|
|
steps.push({stage:'found', msg:`nums[${mid}] = ${nums[mid]} == ${tgt}，找到！`, left, right, mid, found:true, ans:mid, orderedHalf:''});
|
|||
|
|
return;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
// Determine which half is ordered
|
|||
|
|
let orderedHalf, detail;
|
|||
|
|
if (nums[left] <= nums[mid]) {
|
|||
|
|
orderedHalf = 'left';
|
|||
|
|
detail = `左半 [${left}..${mid}] 有序：nums[${left}]=${nums[left]} ≤ nums[${mid}]=${nums[mid]}`;
|
|||
|
|
} else {
|
|||
|
|
orderedHalf = 'right';
|
|||
|
|
detail = `右半 [${mid}..${right}] 有序：nums[${mid}]=${nums[mid]} ≤ nums[${right}]=${nums[right]}`;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
steps.push({stage:'check', msg:`mid=${mid}, nums[${mid}]=${nums[mid]}。${detail}`, left, right, mid, found:false, ans:-1, orderedHalf});
|
|||
|
|
|
|||
|
|
if (orderedHalf === 'left') {
|
|||
|
|
if (nums[left] <= tgt && tgt < nums[mid]) {
|
|||
|
|
steps.push({stage:'goLeft', msg:`${tgt} ∈ [${nums[left]}, ${nums[mid]})，在左半有序区间中，right = ${mid}-1 = ${mid-1}`, left, right:mid-1, mid, found:false, ans:-1, orderedHalf:'left'});
|
|||
|
|
right = mid - 1;
|
|||
|
|
} else {
|
|||
|
|
steps.push({stage:'goRight', msg:`${tgt} ∉ [${nums[left]}, ${nums[mid]})，去右半找，left = ${mid}+1 = ${mid+1}`, left:mid+1, right, mid, found:false, ans:-1, orderedHalf:'left'});
|
|||
|
|
left = mid + 1;
|
|||
|
|
}
|
|||
|
|
} else {
|
|||
|
|
if (nums[mid] < tgt && tgt <= nums[right]) {
|
|||
|
|
steps.push({stage:'goRight', msg:`${tgt} ∈ (${nums[mid]}, ${nums[right]}]，在右半有序区间中，left = ${mid}+1 = ${mid+1}`, left:mid+1, right, mid, found:false, ans:-1, orderedHalf:'right'});
|
|||
|
|
left = mid + 1;
|
|||
|
|
} else {
|
|||
|
|
steps.push({stage:'goLeft', msg:`${tgt} ∉ (${nums[mid]}, ${nums[right]}]，去左半找，right = ${mid}-1 = ${mid-1}`, left, right:mid-1, mid, found:false, ans:-1, orderedHalf:'right'});
|
|||
|
|
right = mid - 1;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
steps.push({stage:'notFound', msg:`循环结束，未找到 ${tgt}`, left, right, mid:-1, found:false, ans:-1, orderedHalf:''});
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
function render(step) {
|
|||
|
|
const s = steps[step];
|
|||
|
|
const arr = numsArr;
|
|||
|
|
|
|||
|
|
const hl = highlightRange(arr, s.left, s.right, 'cyan');
|
|||
|
|
if (s.mid >= 0 && s.mid < arr.length) {
|
|||
|
|
hl[s.mid] = s.found ? 'green' : 'orange';
|
|||
|
|
}
|
|||
|
|
// highlight ordered half
|
|||
|
|
if (s.orderedHalf === 'left' && s.mid >= 0) {
|
|||
|
|
for (let i = s.left; i <= s.mid; i++) if (hl[i] === 'cyan') hl[i] = 'green';
|
|||
|
|
} else if (s.orderedHalf === 'right' && s.mid >= 0) {
|
|||
|
|
for (let i = s.mid; i <= s.right; i++) if (hl[i] === 'cyan') hl[i] = 'green';
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
const pointers = {};
|
|||
|
|
if (s.left >= 0 && s.left < arr.length) pointers['L'] = s.left;
|
|||
|
|
if (s.right >= 0 && s.right < arr.length) pointers['R'] = s.right;
|
|||
|
|
if (s.mid >= 0 && s.mid < arr.length) pointers['mid'] = s.mid;
|
|||
|
|
|
|||
|
|
let viz = renderArray(arr, {highlights: hl, pointers});
|
|||
|
|
|
|||
|
|
if (s.orderedHalf) {
|
|||
|
|
viz += `<div style="margin-top:8px;">`;
|
|||
|
|
viz += `<span class="half-label ordered">有序半：${s.orderedHalf === 'left' ? `左半 [${s.left}..${s.mid}]` : `右半 [${s.mid}..${s.right}]`}</span>`;
|
|||
|
|
viz += `<span class="half-label unordered">无序半：${s.orderedHalf === 'left' ? `右半 [${s.mid}..${s.right}]` : `左半 [${s.left}..${s.mid}]`}</span>`;
|
|||
|
|
viz += `</div>`;
|
|||
|
|
}
|
|||
|
|
viz += `<div style="margin-top:4px;font-size:13px;color:var(--purple);font-weight:600;">target = ${target}</div>`;
|
|||
|
|
|
|||
|
|
if (s.found) {
|
|||
|
|
viz += `<div class="current-answer">✅ 找到！索引 ${s.mid}</div>`;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
$('vizArea').innerHTML = viz;
|
|||
|
|
$('detailContent').innerHTML = `<div class="calc-block">${s.msg}</div>`;
|
|||
|
|
|
|||
|
|
if (s.stage === 'found') {
|
|||
|
|
$('resultContent').innerHTML = `<div class="final-answer">返回 <b>${s.ans}</b><br>nums[${s.ans}] = ${target}<br>时间复杂度 O(log n)</div>`;
|
|||
|
|
} else if (s.stage === 'notFound') {
|
|||
|
|
$('resultContent').innerHTML = `<div class="final-answer" style="border-color:#f87171;background:#fef2f2;">返回 <b>-1</b><br>数组中不存在 ${target}</div>`;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
$('hintText').textContent = s.msg;
|
|||
|
|
const stages = ['init→初始化','check→判断有序','goLeft→左移','goRight→右移','found→找到','notFound→未找到'];
|
|||
|
|
$('pipeline').innerHTML = stages.map(st => {
|
|||
|
|
const [k,l] = st.split('→');
|
|||
|
|
return `<span class="pipe-step ${s.stage===k?'active':''}">${l}</span>`;
|
|||
|
|
}).join('<i>→</i>');
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
function init() {
|
|||
|
|
const sel = $('exampleSelect');
|
|||
|
|
examples.forEach((e,i) => { sel.innerHTML += `<option value="${i}">${e.label}</option>`; });
|
|||
|
|
$('inputArea').value = 'nums=[4,5,6,7,0,1,2], target=0';
|
|||
|
|
|
|||
|
|
buildSteps(examples[0].nums, examples[0].target);
|
|||
|
|
stepCtrl = new StepController({onStep: render});
|
|||
|
|
stepCtrl.setSteps(steps.map((_,i)=>i));
|
|||
|
|
$('stepInfo').textContent = `步骤 1 / ${steps.length}`;
|
|||
|
|
stepCtrl.onStep = (idx) => { render(idx); $('stepInfo').textContent = `步骤 ${idx+1} / ${steps.length}`; };
|
|||
|
|
|
|||
|
|
$('applyBtn').onclick = () => {
|
|||
|
|
try {
|
|||
|
|
const m = $('inputArea').value.match(/nums=\[([^\]]+)\].*target=(-?\d+)/);
|
|||
|
|
if (!m) { alert('格式: nums=[4,5,6,7,0,1,2], target=0'); return; }
|
|||
|
|
const arr = m[1].split(',').map(Number);
|
|||
|
|
const tgt = parseInt(m[2]);
|
|||
|
|
buildSteps(arr, tgt);
|
|||
|
|
stepCtrl.setSteps(steps.map((_,i)=>i)); render(0);
|
|||
|
|
$('stepInfo').textContent = `步骤 1 / ${steps.length}`;
|
|||
|
|
} catch(e) { alert('输入格式错误'); }
|
|||
|
|
};
|
|||
|
|
$('exampleSelect').onchange = () => {
|
|||
|
|
const e = examples[parseInt($('exampleSelect').value)];
|
|||
|
|
$('inputArea').value = `nums=[${e.nums}], target=${e.target}`;
|
|||
|
|
buildSteps(e.nums, e.target);
|
|||
|
|
stepCtrl.setSteps(steps.map((_,i)=>i)); render(0);
|
|||
|
|
};
|
|||
|
|
$('prevBtn').onclick = () => stepCtrl.prev();
|
|||
|
|
$('nextBtn').onclick = () => stepCtrl.next();
|
|||
|
|
$('jumpBtn').onclick = () => stepCtrl.jumpToEnd();
|
|||
|
|
$('autoBtn').onclick = () => { const on = stepCtrl.toggleAuto(); $('autoBtn').textContent = on ? '暂停' : '自动播放'; };
|
|||
|
|
$('resetBtn').onclick = () => { stepCtrl.reset(); $('autoBtn').textContent = '自动播放'; };
|
|||
|
|
}
|
|||
|
|
init();
|
|||
|
|
|
|||
|
|
$('codeArea').innerHTML = renderCode(`def search(nums, target):
|
|||
|
|
left, right = 0, len(nums) - 1
|
|||
|
|
while left <= right:
|
|||
|
|
mid = (left + right) // 2
|
|||
|
|
if nums[mid] == target:
|
|||
|
|
return mid
|
|||
|
|
# 判断哪半边有序
|
|||
|
|
if nums[left] <= nums[mid]: # 左半有序
|
|||
|
|
if nums[left] <= target < nums[mid]:
|
|||
|
|
right = mid - 1
|
|||
|
|
else:
|
|||
|
|
left = mid + 1
|
|||
|
|
else: # 右半有序
|
|||
|
|
if nums[mid] < target <= nums[right]:
|
|||
|
|
left = mid + 1
|
|||
|
|
else:
|
|||
|
|
right = mid - 1
|
|||
|
|
return -1`, {lang:'Python'});
|
|||
|
|
})();
|
|||
|
|
</script>
|
|||
|
|
</body>
|
|||
|
|
</html>
|