218 lines
8.5 KiB
HTML
218 lines
8.5 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>070. 最小栈 – 图解</title>
|
||
<link rel="stylesheet" href="../shared/style.css">
|
||
<style>
|
||
.vis-area { min-height: 120px; padding: 16px 0; }
|
||
.code-section { margin-top: 16px; }
|
||
.dual-stack { display:flex; gap:16px; flex-wrap:wrap; }
|
||
.dual-stack > div { flex:1; min-width:140px; }
|
||
.op-tag { display:inline-block; padding:3px 10px; border-radius:999px; font-size:12px; font-weight:600; margin:2px; }
|
||
.op-tag.push { background:#dbeafe; color:#1e40af; }
|
||
.op-tag.pop { background:#fee2e2; color:#991b1b; }
|
||
.op-tag.top { background:#fef3c7; color:#92400e; }
|
||
.op-tag.getMin { background:#dcfce7; color:#166534; }
|
||
</style>
|
||
</head>
|
||
<body>
|
||
<div class="container">
|
||
<h1>🟡 070. 最小栈 <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="ops=[push,-2,push,0,push,-3,getMin,pop,top,getMin]">
|
||
<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 = [
|
||
{ops:['push',-2,'push',0,'push',-3,'getMin','pop','top','getMin'], label:'示例1: push(-2),push(0),push(-3),getMin,pop,top,getMin'},
|
||
{ops:['push',1,'push',2,'push',3,'getMin','pop','getMin','pop','getMin'], label:'示例2: 递增序列'},
|
||
{ops:['push',3,'push',2,'push',1,'getMin','pop','getMin','pop','getMin'], label:'示例3: 递减序列'},
|
||
];
|
||
let steps, stepCtrl;
|
||
|
||
function buildSteps(ops) {
|
||
steps = [];
|
||
const mainStack = [];
|
||
const minStack = [];
|
||
const results = [];
|
||
|
||
steps.push({stage:'init', msg:'初始化：主栈和辅助最小栈均为空', mainStack:[], minStack:[], op:'', val:null, result:null});
|
||
|
||
let i = 0;
|
||
while (i < ops.length) {
|
||
const op = ops[i];
|
||
if (op === 'push') {
|
||
const val = ops[++i];
|
||
mainStack.push(val);
|
||
const newMin = minStack.length === 0 ? val : Math.min(val, minStack[minStack.length - 1]);
|
||
minStack.push(newMin);
|
||
steps.push({stage:'push', msg:`push(${val})：主栈入 ${val}，最小栈入 min(${val}, ${minStack.length>1?minStack[minStack.length-2]:val}) = ${newMin}`, mainStack:[...mainStack], minStack:[...minStack], op:'push', val, result:null});
|
||
} else if (op === 'pop') {
|
||
const val = mainStack.pop();
|
||
const minVal = minStack.pop();
|
||
steps.push({stage:'pop', msg:`pop()：主栈弹出 ${val}，最小栈弹出 ${minVal}`, mainStack:[...mainStack], minStack:[...minStack], op:'pop', val, result:null});
|
||
} else if (op === 'top') {
|
||
const val = mainStack[mainStack.length - 1];
|
||
results.push(val);
|
||
steps.push({stage:'top', msg:`top()：返回主栈顶 ${val}`, mainStack:[...mainStack], minStack:[...minStack], op:'top', val, result:val});
|
||
} else if (op === 'getMin') {
|
||
const val = minStack[minStack.length - 1];
|
||
results.push(val);
|
||
steps.push({stage:'getMin', msg:`getMin()：返回最小栈顶 ${val}`, mainStack:[...mainStack], minStack:[...minStack], op:'getMin', val, result:val});
|
||
}
|
||
i++;
|
||
}
|
||
steps.push({stage:'done', msg:`所有操作完成`, mainStack:[...mainStack], minStack:[...minStack], op:'done', val:null, result:null, results:[...results]});
|
||
}
|
||
|
||
function render(step) {
|
||
const s = steps[step];
|
||
|
||
let viz = '';
|
||
if (s.op) {
|
||
viz += `<div style="margin-bottom:8px;"><span class="op-tag ${s.op}">${s.op}${s.val!==null?'('+s.val+')':''}</span></div>`;
|
||
}
|
||
|
||
viz += '<div class="dual-stack">';
|
||
viz += '<div><b>主栈</b>';
|
||
viz += renderStack(s.mainStack.map(String), {topIndex: s.mainStack.length - 1});
|
||
viz += '</div>';
|
||
viz += '<div><b>辅助最小栈</b>';
|
||
viz += renderStack(s.minStack.map(String), {topIndex: s.minStack.length - 1});
|
||
viz += '</div>';
|
||
viz += '</div>';
|
||
|
||
if (s.result !== null) {
|
||
viz += `<div class="current-answer">返回值 = <b>${s.result}</b></div>`;
|
||
}
|
||
|
||
$('vizArea').innerHTML = viz;
|
||
$('detailContent').innerHTML = `<div class="calc-block">${s.msg}</div>
|
||
<div style="margin-top:6px;font-size:13px;color:var(--text-secondary);">核心：辅助栈同步 push/pop，始终保存当前位置的最小值</div>`;
|
||
|
||
if (s.stage === 'done') {
|
||
let resHtml = '<div class="final-answer">所有操作完成<br>';
|
||
if (s.results && s.results.length > 0) {
|
||
resHtml += `查询结果：[${s.results.join(', ')}]<br>`;
|
||
}
|
||
resHtml += '时间复杂度 O(1) 每操作，空间 O(n)</div>';
|
||
$('resultContent').innerHTML = resHtml;
|
||
}
|
||
|
||
$('hintText').textContent = s.msg;
|
||
const stages = ['init→初始化','push→入栈','pop→出栈','top→栈顶','getMin→最小值','done→完成'];
|
||
$('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 = 'ops=[push,-2,push,0,push,-3,getMin,pop,top,getMin]';
|
||
|
||
buildSteps(examples[0].ops);
|
||
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(/ops=\[([^\]]+)\]/);
|
||
if (!m) { alert('格式: ops=[push,-2,push,0,push,-3,getMin,pop,top,getMin]'); return; }
|
||
const ops = m[1].split(',').map(s => { s = s.trim(); return isNaN(s) ? s : Number(s); });
|
||
buildSteps(ops);
|
||
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 = `ops=[${e.ops.join(',')}]`;
|
||
buildSteps(e.ops);
|
||
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(`class MinStack:
|
||
def __init__(self):
|
||
self.stack = []
|
||
self.min_stack = []
|
||
|
||
def push(self, val: int) -> None:
|
||
self.stack.append(val)
|
||
self.min_stack.append(
|
||
val if not self.min_stack
|
||
else min(val, self.min_stack[-1])
|
||
)
|
||
|
||
def pop(self) -> None:
|
||
self.stack.pop()
|
||
self.min_stack.pop()
|
||
|
||
def top(self) -> int:
|
||
return self.stack[-1]
|
||
|
||
def getMin(self) -> int:
|
||
return self.min_stack[-1]`, {lang:'Python'});
|
||
})();
|
||
</script>
|
||
</body>
|
||
</html>
|