This commit is contained in:
@@ -0,0 +1,209 @@
|
||||
<!DOCTYPE html>
|
||||
<html lang="zh-Hans">
|
||||
<head>
|
||||
<meta charset="UTF-8">
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1.0">
|
||||
<title>011. 滑动窗口最大值 – 图解</title>
|
||||
<link rel="stylesheet" href="../shared/style.css">
|
||||
<style>
|
||||
/* page-specific overrides */
|
||||
.vis-area { min-height: 120px; padding: 16px 0; }
|
||||
.code-section { margin-top: 16px; }
|
||||
</style>
|
||||
</head>
|
||||
<body>
|
||||
<div class="container">
|
||||
<h1>🔴 011. 滑动窗口最大值 <span class="badge hard">困难</span></h1>
|
||||
<p class="subtitle">分类：子串 ｜ LeetCode Hot 100</p>
|
||||
|
||||
<!-- 控制面板 -->
|
||||
<div class="controls" id="controls">
|
||||
<label for="inputArea">输入：</label>
|
||||
<input type="text" id="inputArea" placeholder="默认示例，可自定义">
|
||||
<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() {
|
||||
// ========== Algorithm Logic ==========
|
||||
|
||||
const examples = [
|
||||
{input: [1,3,-1,-3,5,3,6,7], k: 3, label: '示例1: nums=[1,3,-1,-3,5,3,6,7], k=3'},
|
||||
{input: [1], k: 1, label: '示例2: nums=[1], k=1'},
|
||||
];
|
||||
|
||||
let nums, k, steps, stepCtrl;
|
||||
|
||||
function buildSteps(arr, windowSize) {
|
||||
nums = arr; k = windowSize; steps = [];
|
||||
const deque = [];
|
||||
const result = [];
|
||||
|
||||
steps.push({stage:'init', msg:`初始化：单调递减队列（存索引），窗口大小=${k}`, left:-1, right:-1, deque:[], max:0, result:[]});
|
||||
|
||||
for (let right = 0; right < arr.length; right++) {
|
||||
const removedIndices = [];
|
||||
while (deque.length > 0 && arr[deque[deque.length - 1]] < arr[right]) {
|
||||
removedIndices.push(deque.pop());
|
||||
}
|
||||
deque.push(right);
|
||||
|
||||
if (removedIndices.length > 0) {
|
||||
steps.push({stage:'pop', msg:`right=${right}，值 ${arr[right]}，从队尾弹出较小元素 [${removedIndices.map(i=>'idx='+i+',val='+arr[i]).join('; ')}]`, left: right - k + 1, right, deque:[...deque], max:arr[deque[0]], result:[...result], removedIndices});
|
||||
}
|
||||
|
||||
const left = right - k + 1;
|
||||
if (deque[0] < left) {
|
||||
const old = deque.shift();
|
||||
steps.push({stage:'out', msg:`队首索引 ${old} 超出窗口 [${left},${right}]，出队`, left, right, deque:[...deque], max:arr[deque[0]], result:[...result], outIdx:old});
|
||||
}
|
||||
|
||||
if (left >= 0) {
|
||||
result.push(arr[deque[0]]);
|
||||
steps.push({stage:'record', msg:`窗口 [${left},${right}] 的最大值 = ${arr[deque[0]]}（队首索引=${deque[0]}）`, left, right, deque:[...deque], max:arr[deque[0]], result:[...result]});
|
||||
} else {
|
||||
steps.push({stage:'fill', msg:`right=${right}，窗口尚未满（需${k}个元素）`, left, right, deque:[...deque], max:arr[deque[0]], result:[...result]});
|
||||
}
|
||||
}
|
||||
steps.push({stage:'done', msg:`完成！滑动窗口最大值 = [${result}]`, left:0, right:nums.length-1, deque:[], max:0, result:[...result]});
|
||||
}
|
||||
|
||||
function render(step) {
|
||||
const s_ = steps[step];
|
||||
const hl = {};
|
||||
if (s_.left >= 0 && s_.right >= 0) {
|
||||
for (let i = Math.max(0, s_.left); i <= Math.min(s_.right, nums.length - 1); i++) hl[i] = 'blue';
|
||||
}
|
||||
if (s_.deque && s_.deque.length > 0) hl[s_.deque[0]] = 'green';
|
||||
if (s_.removedIndices) s_.removedIndices.forEach(i => { hl[i] = 'red'; });
|
||||
if (s_.stage === 'done') { for (let i = 0; i < nums.length; i++) hl[i] = 'default'; }
|
||||
|
||||
let viz = '<div style="margin-bottom:6px;"><b>数组：</b></div>';
|
||||
viz += renderArray(nums, {highlights: hl, pointers: s_.left >= 0 ? {L: Math.max(0,s_.left), R: Math.min(s_.right, nums.length-1)} : {}});
|
||||
|
||||
if (s_.deque && s_.deque.length > 0) {
|
||||
viz += '<div style="margin-top:12px;"><b>单调队列（索引→值）：</b></div>';
|
||||
viz += '<div class="nums-line" style="margin-top:4px;">';
|
||||
s_.deque.forEach((idx, i) => {
|
||||
const cls = i === 0 ? 'green' : 'purple';
|
||||
viz += `<span class="chip ${cls}">${idx}→${nums[idx]}</span>`;
|
||||
});
|
||||
viz += '</div>';
|
||||
if (s_.max !== undefined && s_.max !== 0) {
|
||||
viz += `<div style="margin-top:6px;color:var(--green-dark);font-weight:600;">当前窗口最大值 = ${s_.max}</div>`;
|
||||
}
|
||||
}
|
||||
|
||||
if (s_.result && s_.result.length > 0) {
|
||||
viz += '<div class="table-wrap" style="margin-top:10px;"><table><tr><th>窗口</th><th>最大值</th></tr>';
|
||||
s_.result.forEach((v, i) => {
|
||||
viz += `<tr><td>[${i}, ${i + k - 1}]</td><td style="font-weight:700;color:var(--green);">${v}</td></tr>`;
|
||||
});
|
||||
viz += '</table></div>';
|
||||
}
|
||||
$('vizArea').innerHTML = viz;
|
||||
$('detailContent').innerHTML = '<div class="calc-block">' + s_.msg + '</div>';
|
||||
if (s_.stage === 'done') {
|
||||
$('resultContent').innerHTML = `<div class="final-answer">滑动窗口最大值 = <b>[${s_.result}]</b></div>`;
|
||||
}
|
||||
$('hintText').textContent = s_.msg;
|
||||
const stages = ['init→初始化','pop→弹出','out→出队','record→记录','fill→填充','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 = 'nums=[1,3,-1,-3,5,3,6,7], k=3';
|
||||
buildSteps(examples[0].input, examples[0].k);
|
||||
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 = () => {
|
||||
const m = $('inputArea').value.match(/nums=\[([^\]]+)\].*k=(\d+)/);
|
||||
if (!m) { alert('格式: nums=[1,3,-1,-3,5,3,6,7], k=3'); return; }
|
||||
const arr = m[1].split(',').map(Number);
|
||||
const k_ = parseInt(m[2]);
|
||||
buildSteps(arr, k_); stepCtrl.setSteps(steps.map((_,i)=>i)); render(0);
|
||||
$('stepInfo').textContent = '步骤 1 / ' + steps.length;
|
||||
};
|
||||
$('exampleSelect').onchange = () => {
|
||||
const e = examples[parseInt($('exampleSelect').value)];
|
||||
$('inputArea').value = `nums=[${e.input}], k=${e.k}`;
|
||||
buildSteps(e.input, e.k); 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(`from collections import deque
|
||||
|
||||
def maxSlidingWindow(nums, k):
|
||||
dq = deque() # stores indices
|
||||
result = []
|
||||
for i, num in enumerate(nums):
|
||||
while dq and nums[dq[-1]] < num:
|
||||
dq.pop()
|
||||
dq.append(i)
|
||||
if dq[0] <= i - k:
|
||||
dq.popleft()
|
||||
if i >= k - 1:
|
||||
result.append(nums[dq[0]])
|
||||
return result`, {lang:'Python'});
|
||||
|
||||
})();
|
||||
</script>
|
||||
</body>
|
||||
</html>
|
||||
Reference in New Issue
Block a user