From c00328c73abda4ce8a46c7782e42d0671e359e8a Mon Sep 17 00:00:00 2001 From: S-N-O-R-L-A-X Date: Wed, 2 Oct 2024 09:49:46 +0000 Subject: [PATCH] =?UTF-8?q?Deploying=20to=20gh-pages=20from=20=20@=202ae06?= =?UTF-8?q?0e0d239b8bd6afd65e528be08255d3cf525=20=F0=9F=9A=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- assets/{index-07f811c6.js => index-3745bcfe.js} | 2 +- index.html | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) rename assets/{index-07f811c6.js => index-3745bcfe.js} (92%) diff --git a/assets/index-07f811c6.js b/assets/index-3745bcfe.js similarity index 92% rename from assets/index-07f811c6.js rename to assets/index-3745bcfe.js index d3d9095..8399e19 100644 --- a/assets/index-07f811c6.js +++ b/assets/index-3745bcfe.js @@ -364,7 +364,7 @@ html body { > ${n}-wrapper:only-child, > ${n}-expanded-row-fixed > ${n}-wrapper:only-child `]:{[n]:{marginBlock:Q(x(r).mul(-1).equal()),marginInline:`${Q(x(a).sub(i).equal())} - ${Q(x(i).mul(-1).equal())}`,[`${n}-tbody > tr:last-child > td`]:{borderBottom:0,"&:first-child, &:last-child":{borderRadius:0}}}}},"> th":{position:"relative",color:f,fontWeight:t,textAlign:"start",background:v,borderBottom:b,transition:`background ${h} ease`}}},[`${n}-footer`]:{padding:`${Q(r)} ${Q(i)}`,color:m,background:p}})}},Xie=e=>{const{colorFillAlter:n,colorBgContainer:t,colorTextHeading:r,colorFillSecondary:i,colorFillContent:a,controlItemBgActive:o,controlItemBgActiveHover:l,padding:s,paddingSM:u,paddingXS:c,colorBorderSecondary:d,borderRadiusLG:f,controlHeight:h,colorTextPlaceholder:v,fontSize:g,fontSizeSM:m,lineHeight:p,lineWidth:x,colorIcon:b,colorIconHover:w,opacityLoading:S,controlInteractiveSize:C}=e,E=new yn(i).onBackground(t).toHexShortString(),k=new yn(a).onBackground(t).toHexShortString(),I=new yn(n).onBackground(t).toHexShortString(),$=new yn(b),T=new yn(w),P=C/2-x,F=P*2+x*3;return{headerBg:I,headerColor:r,headerSortActiveBg:E,headerSortHoverBg:k,bodySortBg:I,rowHoverBg:I,rowSelectedBg:o,rowSelectedHoverBg:l,rowExpandedBg:n,cellPaddingBlock:s,cellPaddingInline:s,cellPaddingBlockMD:u,cellPaddingInlineMD:c,cellPaddingBlockSM:c,cellPaddingInlineSM:c,borderColor:d,headerBorderRadius:f,footerBg:I,footerColor:r,cellFontSize:g,cellFontSizeMD:g,cellFontSizeSM:g,headerSplitColor:d,fixedHeaderSortActiveBg:E,headerFilterHoverBg:a,filterDropdownMenuBg:t,filterDropdownBg:t,expandIconBg:t,selectionColumnWidth:h,stickyScrollBarBg:v,stickyScrollBarBorderRadius:100,expandIconMarginTop:(g*p-x*3)/2-Math.ceil((m*1.4-x*3)/2),headerIconColor:$.clone().setAlpha($.getAlpha()*S).toRgbString(),headerIconHoverColor:T.clone().setAlpha(T.getAlpha()*S).toRgbString(),expandIconHalfInner:P,expandIconSize:F,expandIconScale:C/F}},Yie=_r("Table",e=>{const{colorTextHeading:n,colorSplit:t,colorBgContainer:r,controlInteractiveSize:i,headerBg:a,headerColor:o,headerSortActiveBg:l,headerSortHoverBg:s,bodySortBg:u,rowHoverBg:c,rowSelectedBg:d,rowSelectedHoverBg:f,rowExpandedBg:h,cellPaddingBlock:v,cellPaddingInline:g,cellPaddingBlockMD:m,cellPaddingInlineMD:p,cellPaddingBlockSM:x,cellPaddingInlineSM:b,borderColor:w,footerBg:S,footerColor:C,headerBorderRadius:E,cellFontSize:k,cellFontSizeMD:I,cellFontSizeSM:$,headerSplitColor:T,fixedHeaderSortActiveBg:P,headerFilterHoverBg:F,filterDropdownBg:L,expandIconBg:N,selectionColumnWidth:A,stickyScrollBarBg:R,calc:O}=e,B=2,D=fn(e,{tableFontSize:k,tableBg:r,tableRadius:E,tablePaddingVertical:v,tablePaddingHorizontal:g,tablePaddingVerticalMiddle:m,tablePaddingHorizontalMiddle:p,tablePaddingVerticalSmall:x,tablePaddingHorizontalSmall:b,tableBorderColor:w,tableHeaderTextColor:o,tableHeaderBg:a,tableFooterTextColor:C,tableFooterBg:S,tableHeaderCellSplitColor:T,tableHeaderSortBg:l,tableHeaderSortHoverBg:s,tableBodySortBg:u,tableFixedHeaderSortActiveBg:P,tableHeaderFilterActiveBg:F,tableFilterDropdownBg:L,tableRowHoverBg:c,tableSelectedRowBg:d,tableSelectedRowHoverBg:f,zIndexTableFixed:B,zIndexTableSticky:B+1,tableFontSizeMiddle:I,tableFontSizeSmall:$,tableSelectionColumnWidth:A,tableExpandIconBg:N,tableExpandColumnWidth:O(i).add(O(e.padding).mul(2)).equal(),tableExpandedRowBg:h,tableFilterDropdownWidth:120,tableFilterDropdownHeight:264,tableFilterDropdownSearchWidth:140,tableScrollThumbSize:8,tableScrollThumbBg:R,tableScrollThumbBgHover:n,tableScrollBg:t});return[Kie(D),Tie(D),jO(D),_ie(D),Mie(D),yie(D),Aie(D),Eie(D),jO(D),Sie(D),Die(D),$ie(D),Vie(D),bie(D),Bie(D),Fie(D),Gie(D)]},Xie,{unitless:{expandIconScale:!0}}),Uie=[],qie=(e,n)=>{var t,r;const{prefixCls:i,className:a,rootClassName:o,style:l,size:s,bordered:u,dropdownPrefixCls:c,dataSource:d,pagination:f,rowSelection:h,rowKey:v="key",rowClassName:g,columns:m,children:p,childrenColumnName:x,onChange:b,getPopupContainer:w,loading:S,expandIcon:C,expandable:E,expandedRowRender:k,expandIconColumnIndex:I,indentSize:$,scroll:T,sortDirections:P,locale:F,showSorterTooltip:L=!0,virtual:N}=e;dd();const A=y.useMemo(()=>m||fE(p),[m,p]),R=y.useMemo(()=>A.some(He=>He.responsive),[A]),O=V3(R),B=y.useMemo(()=>{const He=new Set(Object.keys(O).filter(Xe=>O[Xe]));return A.filter(Xe=>!Xe.responsive||Xe.responsive.some(gt=>He.has(gt)))},[A,O]),D=ci(e,["className","style","columns"]),{locale:H=ru,direction:j,table:G,renderEmpty:X,getPrefixCls:K,getPopupContainer:q}=y.useContext(Dt),ce=qa(s),ue=Object.assign(Object.assign({},H.Table),F),de=d||Uie,oe=K("table",i),U=K("dropdown",c),[,J]=$r(),ae=Ua(oe),[Z,ee,le]=Yie(oe,ae),he=Object.assign(Object.assign({childrenColumnName:x,expandIconColumnIndex:I},E),{expandIcon:(t=E==null?void 0:E.expandIcon)!==null&&t!==void 0?t:(r=G==null?void 0:G.expandable)===null||r===void 0?void 0:r.expandIcon}),{childrenColumnName:be="children"}=he,fe=y.useMemo(()=>de.some(He=>He==null?void 0:He[be])?"nest":k||E&&E.expandedRowRender?"row":null,[de]),re={body:y.useRef()},pe=_ne(oe),Oe=y.useRef(null),ye=y.useRef(null);Bne(n,()=>Object.assign(Object.assign({},ye.current),{nativeElement:Oe.current}));const Re=y.useMemo(()=>typeof v=="function"?v:He=>He==null?void 0:He[v],[v]),[qe]=eie(de,be,Re),ze={},Ke=function(He,Xe){let gt=arguments.length>2&&arguments[2]!==void 0?arguments[2]:!1;var zt,Ye,Ue;const lt=Object.assign(Object.assign({},ze),He);gt&&((zt=ze.resetPagination)===null||zt===void 0||zt.call(ze),!((Ye=lt.pagination)===null||Ye===void 0)&&Ye.current&&(lt.pagination.current=1),f&&f.onChange&&f.onChange(1,(Ue=lt.pagination)===null||Ue===void 0?void 0:Ue.pageSize)),T&&T.scrollToFirstRowOnChange!==!1&&re.body.current&&fG(0,{getContainer:()=>re.body.current}),b==null||b(lt.pagination,lt.filters,lt.sorter,{currentDataSource:ow(sw(de,lt.sorterStates,be),lt.filterStates,be),action:Xe})},rt=(He,Xe)=>{Ke({sorter:He,sorterStates:Xe},"sort",!1)},[Le,Ae,Ce,dt]=hie({prefixCls:oe,mergedColumns:B,onSorterChange:rt,sortDirections:P||["ascend","descend"],tableLocale:ue,showSorterTooltip:L}),Je=y.useMemo(()=>sw(de,Ae,be),[de,Ae]);ze.sorter=dt(),ze.sorterStates=Ae;const xt=(He,Xe)=>{Ke({filters:He,filterStates:Xe},"filter",!0)},[Qe,ot,et]=Jre({prefixCls:oe,locale:ue,dropdownPrefixCls:U,mergedColumns:B,onFilterChange:xt,getPopupContainer:w||q,rootClassName:ne(o,ae)}),vt=ow(Je,ot,be);ze.filters=et,ze.filterStates=ot;const bt=y.useMemo(()=>{const He={};return Object.keys(et).forEach(Xe=>{et[Xe]!==null&&(He[Xe]=et[Xe])}),Object.assign(Object.assign({},Ce),{filters:He})},[Ce,et]),[Pt]=vie(bt),Bt=(He,Xe)=>{Ke({pagination:Object.assign(Object.assign({},ze.pagination),{current:He,pageSize:Xe})},"paginate")},[Et,De]=rie(vt.length,Bt,f);ze.pagination=f===!1?{}:nie(Et,f),ze.resetPagination=De;const Ee=y.useMemo(()=>{if(f===!1||!Et.pageSize)return vt;const{current:He=1,total:Xe,pageSize:gt=PB}=Et;return vt.lengthgt?vt.slice((He-1)*gt,He*gt):vt:vt.slice((He-1)*gt,He*gt)},[!!f,vt,Et&&Et.current,Et&&Et.pageSize,Et&&Et.total]),[Te,xe]=Dne({prefixCls:oe,data:vt,pageData:Ee,getRowKey:Re,getRecordByKey:qe,expandType:fe,childrenColumnName:be,locale:ue,getPopupContainer:w||q},h),ke=(He,Xe,gt)=>{let zt;return typeof g=="function"?zt=ne(g(He,Xe,gt)):zt=ne(g),ne({[`${oe}-row-selected`]:xe.has(Re(He,Xe))},zt)};he.__PARENT_RENDER_ICON__=he.expandIcon,he.expandIcon=he.expandIcon||C||zne(ue),fe==="nest"&&he.expandIconColumnIndex===void 0?he.expandIconColumnIndex=h?1:0:he.expandIconColumnIndex>0&&h&&(he.expandIconColumnIndex-=1),typeof he.indentSize!="number"&&(he.indentSize=typeof $=="number"?$:15);const Ve=y.useCallback(He=>Pt(Te(Qe(Le(He)))),[Le,Qe,Te]);let je,Ne;if(f!==!1&&(Et!=null&&Et.total)){let He;Et.size?He=Et.size:He=ce==="small"||ce==="middle"?"small":void 0;const Xe=Ye=>y.createElement(Jee,Object.assign({},Et,{className:ne(`${oe}-pagination ${oe}-pagination-${Ye}`,Et.className),size:He})),gt=j==="rtl"?"left":"right",{position:zt}=Et;if(zt!==null&&Array.isArray(zt)){const Ye=zt.find(It=>It.includes("top")),Ue=zt.find(It=>It.includes("bottom")),lt=zt.every(It=>`${It}`=="none");!Ye&&!Ue&&!lt&&(Ne=Xe(gt)),Ye&&(je=Xe(Ye.toLowerCase().replace("top",""))),Ue&&(Ne=Xe(Ue.toLowerCase().replace("bottom","")))}else Ne=Xe(gt)}let Pe;typeof S=="boolean"?Pe={spinning:S}:typeof S=="object"&&(Pe=Object.assign({spinning:!0},S));const Ie=ne(le,ae,`${oe}-wrapper`,G==null?void 0:G.className,{[`${oe}-wrapper-rtl`]:j==="rtl"},a,o,ee),st=Object.assign(Object.assign({},G==null?void 0:G.style),l),kt=F&&F.emptyText||(X==null?void 0:X("Table"))||y.createElement(N3,{componentName:"Table"}),At=N?pie:gie,jt={},Mt=y.useMemo(()=>{const{fontSize:He,lineHeight:Xe,padding:gt,paddingXS:zt,paddingSM:Ye}=J,Ue=Math.floor(He*Xe);switch(ce){case"large":return gt*2+Ue;case"small":return zt*2+Ue;default:return Ye*2+Ue}},[J,ce]);return N&&(jt.listItemHeight=Mt),Z(y.createElement("div",{ref:Oe,className:Ie,style:st},y.createElement(ste,Object.assign({spinning:!1},Pe),je,y.createElement(At,Object.assign({},jt,D,{ref:ye,columns:B,direction:j,expandable:he,prefixCls:oe,className:ne({[`${oe}-middle`]:ce==="middle",[`${oe}-small`]:ce==="small",[`${oe}-bordered`]:u,[`${oe}-empty`]:de.length===0},le,ae,ee),data:Ee,rowKey:Re,rowClassName:ke,emptyText:kt,internalHooks:uv,internalRefs:re,transformColumns:Ve,getContainerWidth:pe})),Ne)))},Qie=y.forwardRef(qie),Zie=(e,n)=>{const t=y.useRef(0);return t.current+=1,y.createElement(Qie,Object.assign({},e,{ref:n,_renderTimes:t.current}))},il=y.forwardRef(Zie);il.SELECTION_COLUMN=dl;il.EXPAND_COLUMN=gl;il.SELECTION_ALL=tw;il.SELECTION_INVERT=nw;il.SELECTION_NONE=rw;il.Column=kne;il.ColumnGroup=Mne;il.Summary=lB;const FB=il,Jie=e=>{const{paddingXXS:n,lineWidth:t,tagPaddingHorizontal:r,componentCls:i,calc:a}=e,o=a(r).sub(t).equal(),l=a(n).sub(t).equal();return{[i]:Object.assign(Object.assign({},Ln(e)),{display:"inline-block",height:"auto",marginInlineEnd:e.marginXS,paddingInline:o,fontSize:e.tagFontSize,lineHeight:e.tagLineHeight,whiteSpace:"nowrap",background:e.defaultBg,border:`${Q(e.lineWidth)} ${e.lineType} ${e.colorBorder}`,borderRadius:e.borderRadiusSM,opacity:1,transition:`all ${e.motionDurationMid}`,textAlign:"start",position:"relative",[`&${i}-rtl`]:{direction:"rtl"},"&, a, a:hover":{color:e.defaultColor},[`${i}-close-icon`]:{marginInlineStart:l,fontSize:e.tagIconSize,color:e.colorTextDescription,cursor:"pointer",transition:`all ${e.motionDurationMid}`,"&:hover":{color:e.colorTextHeading}},[`&${i}-has-color`]:{borderColor:"transparent",[`&, a, a:hover, ${e.iconCls}-close, ${e.iconCls}-close:hover`]:{color:e.colorTextLightSolid}},"&-checkable":{backgroundColor:"transparent",borderColor:"transparent",cursor:"pointer",[`&:not(${i}-checkable-checked):hover`]:{color:e.colorPrimary,backgroundColor:e.colorFillSecondary},"&:active, &-checked":{color:e.colorTextLightSolid},"&-checked":{backgroundColor:e.colorPrimary,"&:hover":{backgroundColor:e.colorPrimaryHover}},"&:active":{backgroundColor:e.colorPrimaryActive}},"&-hidden":{display:"none"},[`> ${e.iconCls} + span, > span + ${e.iconCls}`]:{marginInlineStart:o}}),[`${i}-borderless`]:{borderColor:"transparent",background:e.tagBorderlessBg}}},xE=e=>{const{lineWidth:n,fontSizeIcon:t,calc:r}=e,i=e.fontSizeSM;return fn(e,{tagFontSize:i,tagLineHeight:Q(r(e.lineHeightSM).mul(i).equal()),tagIconSize:r(t).sub(r(n).mul(2)).equal(),tagPaddingHorizontal:8,tagBorderlessBg:e.colorFillTertiary})},bE=e=>({defaultBg:new yn(e.colorFillQuaternary).onBackground(e.colorBgContainer).toHexString(),defaultColor:e.colorText}),LB=_r("Tag",e=>{const n=xE(e);return Jie(n)},bE);var eae=globalThis&&globalThis.__rest||function(e,n){var t={};for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&n.indexOf(r)<0&&(t[r]=e[r]);if(e!=null&&typeof Object.getOwnPropertySymbols=="function")for(var i=0,r=Object.getOwnPropertySymbols(e);i{const{prefixCls:t,style:r,className:i,checked:a,onChange:o,onClick:l}=e,s=eae(e,["prefixCls","style","className","checked","onChange","onClick"]),{getPrefixCls:u,tag:c}=y.useContext(Dt),d=p=>{o==null||o(!a),l==null||l(p)},f=u("tag",t),[h,v,g]=LB(f),m=ne(f,`${f}-checkable`,{[`${f}-checkable-checked`]:a},c==null?void 0:c.className,i,v,g);return h(y.createElement("span",Object.assign({},s,{ref:n,style:Object.assign(Object.assign({},r),c==null?void 0:c.style),className:m,onClick:d})))}),nae=tae,rae=e=>BD(e,(n,t)=>{let{textColor:r,lightBorderColor:i,lightColor:a,darkColor:o}=t;return{[`${e.componentCls}${e.componentCls}-${n}`]:{color:r,background:a,borderColor:i,"&-inverse":{color:e.colorTextLightSolid,background:o,borderColor:o},[`&${e.componentCls}-borderless`]:{borderColor:"transparent"}}}}),iae=$y(["Tag","preset"],e=>{const n=xE(e);return rae(n)},bE);function aae(e){return typeof e!="string"?e:e.charAt(0).toUpperCase()+e.slice(1)}const lg=(e,n,t)=>{const r=aae(t);return{[`${e.componentCls}${e.componentCls}-${n}`]:{color:e[`color${t}`],background:e[`color${r}Bg`],borderColor:e[`color${r}Border`],[`&${e.componentCls}-borderless`]:{borderColor:"transparent"}}}},oae=$y(["Tag","status"],e=>{const n=xE(e);return[lg(n,"success","Success"),lg(n,"processing","Info"),lg(n,"error","Error"),lg(n,"warning","Warning")]},bE);var lae=globalThis&&globalThis.__rest||function(e,n){var t={};for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&n.indexOf(r)<0&&(t[r]=e[r]);if(e!=null&&typeof Object.getOwnPropertySymbols=="function")for(var i=0,r=Object.getOwnPropertySymbols(e);i{const{prefixCls:t,className:r,rootClassName:i,style:a,children:o,icon:l,color:s,onClose:u,closeIcon:c,closable:d,bordered:f=!0}=e,h=lae(e,["prefixCls","className","rootClassName","style","children","icon","color","onClose","closeIcon","closable","bordered"]),{getPrefixCls:v,direction:g,tag:m}=y.useContext(Dt),[p,x]=y.useState(!0);y.useEffect(()=>{"visible"in h&&x(h.visible)},[h.visible]);const b=U3(s),w=Yq(s),S=b||w,C=Object.assign(Object.assign({backgroundColor:s&&!S?s:void 0},m==null?void 0:m.style),a),E=v("tag",t),[k,I,$]=LB(E),T=ne(E,m==null?void 0:m.className,{[`${E}-${s}`]:S,[`${E}-has-color`]:s&&!S,[`${E}-hidden`]:!p,[`${E}-rtl`]:g==="rtl",[`${E}-borderless`]:!f},r,i,I,$),P=O=>{O.stopPropagation(),u==null||u(O),!O.defaultPrevented&&x(!1)},[,F]=NK(d,c??(m==null?void 0:m.closeIcon),O=>O===null?y.createElement(EC,{className:`${E}-close-icon`,onClick:P}):y.createElement("span",{className:`${E}-close-icon`,onClick:P},O),null,!1),L=typeof h.onClick=="function"||o&&o.type==="a",N=l||null,A=N?y.createElement(y.Fragment,null,N,o&&y.createElement("span",null,o)):o,R=y.createElement("span",Object.assign({},h,{ref:n,className:T,style:C}),A,F,b&&y.createElement(iae,{key:"preset",prefixCls:E}),w&&y.createElement(oae,{key:"status",prefixCls:E}));return k(L?y.createElement(ev,{component:"Tag"},R):R)},DB=y.forwardRef(sae);DB.CheckableTag=nae;const hs=DB,uae={month:[[{date:"2024/1/1",no:"1599",name:"经营摩天轮的最大利润",slug:"maximum-profit-of-operating-a-centennial-wheel",difficulty:"中等",rating:1548,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/1/2",no:"466",name:"统计重复个数",slug:"count-the-repetitions",difficulty:"困难",rating:null,situation:"没看懂答案",method:"转化",learn:"",unknown:""},{date:"2024/1/3",no:"2487",name:"从链表中移除节点",slug:"remove-nodes-from-linked-list",difficulty:"中等",rating:1454,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/1/4",no:"2397",name:"被列覆盖的最多行数",slug:"maximum-rows-covered-by-columns",difficulty:"中等",rating:1718,situation:"自己做出",method:"二进制枚举",learn:"Gosper's Hack",unknown:""},{date:"2024/1/5",no:"1944",name:"队列中可以看到的人数",slug:"number-of-visible-people-in-a-queue",difficulty:"困难",rating:2104,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2024/1/6",no:"2807",name:"在链表中插入最大公约数",slug:"insert-greatest-common-divisors-in-linked-list",difficulty:"简单",rating:1279,situation:"自己做出",method:"模拟+链表",learn:"",unknown:""},{date:"2024/1/7",no:"383",name:"赎金信",slug:"ransom-note",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/8",no:"447",name:"回旋镖的数量",slug:"number-of-boomerangs",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/9",no:"2707",name:"字符串中的额外字符",slug:"extra-characters-in-a-string",difficulty:"中等",rating:1735,situation:"自己做出",method:"dp（+字典树）",learn:"",unknown:""},{date:"2024/1/10",no:"2696",name:"删除子串后的字符串最小长度",slug:"minimum-string-length-after-removing-substrings",difficulty:"简单",rating:1282,situation:"自己做出",method:"模拟/栈",learn:"",unknown:""},{date:"2024/1/11",no:"2645",name:"构造有效字符串的最少插入数",slug:"minimum-additions-to-make-valid-string",difficulty:"中等",rating:1477,situation:"自己做出",method:"模拟/dp",learn:"",unknown:""},{date:"2024/1/12",no:"2085",name:"统计出现过一次的公共字符串",slug:"count-common-words-with-one-occurrence",difficulty:"简单",rating:1307,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/13",no:"2182",name:"构造限制重复的字符串",slug:"construct-string-with-repeat-limit",difficulty:"简单",rating:1680,situation:"自己做出",method:"贪心+双指针",learn:"",unknown:""},{date:"2024/1/14",no:"83",name:"删除排序链表中的重复元素",slug:"remove-duplicates-from-sorted-list",difficulty:"简单",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"2024/1/15",no:"82",name:"删除排序链表中的重复元素 II",slug:"remove-duplicates-from-sorted-list",difficulty:"中等",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"2024/1/16",no:"2719",name:"统计整数数目",slug:"count-of-integers",difficulty:"困难",rating:2354,situation:"看懂答案",method:"数位dp",learn:"复习数位dp",unknown:""},{date:"2024/1/17",no:"2744",name:"最大字符串配对数目",slug:"find-maximum-number-of-string-pairs",difficulty:"简单",rating:1405,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/18",no:"2171",name:"拿出最少数目的魔法豆",slug:"removing-minimum-number-of-magic-beans",difficulty:"中等",rating:1748,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/1/19",no:"2809",name:"使数组和小于等于 x 的最少时间",slug:"minimum-time-to-make-array-sum-at-most-x",difficulty:"困难",rating:2978,situation:"看懂答案",method:"排序+dp",learn:"",unknown:""},{date:"2024/1/20",no:"2788",name:"按分隔符拆分字符串",slug:"split-strings-by-separator",difficulty:"简单",rating:1299,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/1/21",no:"410",name:"分割数组的最大值",slug:"split-array-largest-sum",difficulty:"困难",rating:null,situation:"自己做出",method:"dp/二分",learn:"",unknown:""},{date:"2024/1/22",no:"670",name:"最大交换",slug:"maximum-swap",difficulty:"中等",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/1/23",no:"2765",name:"最长交替子数组",slug:"longest-alternating-subarray",difficulty:"简单",rating:1580,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/1/24",no:"2865",name:"美丽塔 I",slug:"beautiful-towers-i",difficulty:"中等",rating:1519,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2024/1/25",no:"2859",name:"计算 K 置位下标对应元素的和",slug:"sum-of-values-at-indices-with-k-set-bits",difficulty:"简单",rating:1218,situation:"自己做出",method:"位运算",learn:"位运算计数方法",unknown:""},{date:"2024/1/26",no:"2846",name:"边权重均等查询",slug:"minimum-edge-weight-equilibrium-queries-in-a-tree",difficulty:"困难",rating:2507,situation:"没看懂答案",method:"树上最近公共祖先",learn:"tarjan算法",unknown:""},{date:"2024/1/27",no:"2861",name:"最大合金数",slug:"maximum-number-of-alloys",difficulty:"中等",rating:1981,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2024/1/28",no:"365",name:"水壶问题",slug:"water-and-jug-problem",difficulty:"中等",rating:null,situation:"看思路写出",method:"bfs/dfs/裴蜀定理",learn:"裴蜀定理",unknown:""},{date:"2024/1/29",no:"514",name:"自由之路",slug:"freedom-trail",difficulty:"困难",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/1/30",no:"2808",name:"使循环数组所有元素相等的最少秒数",slug:"minimum-seconds-to-equalize-a-circular-array",difficulty:"中等",rating:1875,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2024/1/31",no:"2670",name:"找出不同元素数目差数组",slug:"find-the-distinct-difference-array",difficulty:"简单",rating:1266,situation:"自己做出",method:"哈希",learn:"",unknown:""}],[{date:"2024/2/1",no:"LCP 24",name:"数字游戏",slug:"5TxKeK",difficulty:"困难",rating:null,situation:"没看懂答案",method:"优先级队列",learn:"",unknown:""},{date:"2024/2/2",no:"1686",name:"石子游戏 VI",slug:"stone-game-vi",difficulty:"中等",rating:2e3,situation:"自己做出",method:"贪心+排序",learn:"",unknown:""},{date:"2024/2/3",no:"1690",name:"石子游戏 VII",slug:"stone-game-vii",difficulty:"中等",rating:1951,situation:"看思路写出",method:"前缀和+ 记忆化搜索/dp",learn:"",unknown:""},{date:"2024/2/4",no:"292",name:"Nim 游戏",slug:"nim-game",difficulty:"简单",rating:null,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/2/5",no:"1696",name:"跳跃游戏 VI",slug:"jump-game-vi",difficulty:"中等",rating:1954,situation:"看思路写出",method:"dp+单调队列",learn:"单调队列，维护区间最值使用单调队列",unknown:""},{date:"2024/2/6",no:"LCP 30",name:"魔塔游戏",slug:"p0NxJO",difficulty:"中等",rating:null,situation:"自己做出",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2024/2/7",no:"2641",name:"二叉树的堂兄弟节点 II",slug:"cousins-in-binary-tree-ii",difficulty:"中等",rating:1676,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/8",no:"993",name:"二叉树的堂兄弟节点",slug:"cousins-in-binary-tree",difficulty:"简单",rating:1287,situation:"自己做出",method:"bfs/dfs",learn:"",unknown:""},{date:"2024/2/9",no:"236",name:"二叉树的最近公共祖先",slug:"lowest-common-ancestor-of-a-binary-tree",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs/dfs",learn:"",unknown:""},{date:"2024/2/10",no:"94",name:"二叉树的中序遍历",slug:"binary-tree-inorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/11",no:"144",name:"二叉树的前序遍历",slug:"binary-tree-preorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/12",no:"145",name:"二叉树的后序遍历",slug:"binary-tree-postorder-traversal",difficulty:"",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/13",no:"987",name:"二叉树的垂序遍历",slug:"vertical-order-traversal-of-a-binary-tree",difficulty:"困难",rating:1675,situation:"自己做出",method:"哈希+排序+dfs/bfs",learn:"",unknown:""},{date:"2024/2/14",no:"102",name:"二叉树的层序遍历",slug:"binary-tree-level-order-traversal",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/15",no:"107",name:"二叉树的层序遍历 II",slug:"binary-tree-level-order-traversal-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/16",no:"103",name:"二叉树的锯齿形层序遍历",slug:"binary-tree-zigzag-level-order-traversal",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/17",no:"429",name:"N 叉树的层序遍历",slug:"n-ary-tree-level-order-traversal",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/18",no:"589",name:"N 叉树的前序遍历",slug:"n-ary-tree-preorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2024/2/19",no:"590",name:"N 叉树的后序遍历",slug:"n-ary-tree-postorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/20",no:"105",name:"从前序与中序遍历序列构造二叉树",slug:"construct-binary-tree-from-preorder-and-inorder-traversal",difficulty:"中等",rating:null,situation:"看懂答案",method:"递归/转化",learn:"从前序与中序遍历序列构造二叉树的方法",unknown:""},{date:"2024/2/21",no:"106",name:"从中序与后序遍历序列构造二叉树",slug:"construct-binary-tree-from-inorder-and-postorder-traversal",difficulty:"中等",rating:null,situation:"看懂答案",method:"递归/转化",learn:"从中序与后序遍历序列构造二叉树的方法",unknown:""},{date:"2024/2/22",no:"889",name:"根据前序和后序遍历构造二叉树",slug:"construct-binary-tree-from-preorder-and-postorder-traversal",difficulty:"中等",rating:1731,situation:"看懂答案",method:"递归/转化",learn:"从前序与后序遍历序列构造二叉树的方法",unknown:""},{date:"2024/2/23",no:"2583",name:"二叉树中的第 K 大层和",slug:"kth-largest-sum-in-a-binary-tree",difficulty:"中等",rating:1374,situation:"自己做出",method:"bfs+排序/优先级队列",learn:"",unknown:""},{date:"2024/2/24",no:"2476",name:"二叉搜索树最近节点查询",slug:"closest-nodes-queries-in-a-binary-search-tree",difficulty:"中等",rating:1596,situation:"自己做出",method:"递归+二分",learn:"",unknown:""},{date:"2024/2/25",no:"235",name:"二叉搜索树的最近公共祖先",slug:"lowest-common-ancestor-of-a-binary-search-tree",difficulty:"中等",rating:null,situation:"自己做出",method:"二叉搜索树/递归",learn:"复习二叉树最近公共祖先的做法",unknown:""},{date:"2024/2/26",no:"938",name:"二叉搜索树的范围和",slug:"range-sum-of-bst",difficulty:"简单",rating:1335,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2024/2/27",no:"2867",name:"统计树中的合法路径数目",slug:"count-valid-paths-in-a-tree",difficulty:"困难",rating:2428,situation:"没看懂答案",method:"埃氏筛+dfs",learn:"复习埃氏筛",unknown:""},{date:"2024/2/28",no:"2673",name:"使二叉树所有路径值相等的最小代价",slug:"make-costs-of-paths-equal-in-a-binary-tree",difficulty:"中等",rating:1917,situation:"自己做出",method:"转化+贪心 / 递归",learn:"",unknown:""},{date:"2024/2/29",no:"2581",name:"统计可能的树根数目",slug:"count-number-of-possible-root-nodes",difficulty:"困难",rating:2228,situation:"没看懂答案",method:"树形dp",learn:"",unknown:""}],[{date:"2024/3/1",no:"2369",name:"检查数组是否存在有效划分",slug:"check-if-there-is-a-valid-partition-for-the-array",difficulty:"中等",rating:1779,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/3/2",no:"2368",name:"受限条件下可到达节点的数目",slug:"reachable-nodes-with-restrictions",difficulty:"中等",rating:1476,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2024/3/3",no:"225",name:"用队列实现栈",slug:"implement-stack-using-queues",difficulty:"简单",rating:null,situation:"自己做出",method:"栈+队列",learn:"",unknown:""},{date:"2024/3/4",no:"232",name:"用栈实现队列",slug:"implement-queue-using-stacks",difficulty:"简单",rating:null,situation:"自己做出",method:"栈+队列",learn:"",unknown:""},{date:"2024/3/5",no:"1976",name:"到达目的地的方案数",slug:"number-of-ways-to-arrive-at-destination",difficulty:"中等",rating:2094,situation:"看懂答案",method:"迪杰斯特拉",learn:"复习迪杰斯特拉",unknown:""},{date:"2024/3/6",no:"2917",name:"找出数组中的 K-or 值",slug:"find-the-k-or-of-an-array",difficulty:"简单",rating:1388,situation:"自己做出",method:"位运算",learn:"",unknown:""},{date:"2024/3/7",no:"2575",name:"找出字符串的可整除数组",slug:"find-the-divisibility-array-of-a-string",difficulty:"中等",rating:1541,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/3/8",no:"2834",name:"找出美丽数组的最小和",slug:"find-the-minimum-possible-sum-of-a-beautiful-array",difficulty:"中等",rating:1409,situation:"自己做出",method:"贪心+数学",learn:"",unknown:""},{date:"2024/3/9",no:"2386",name:"找出数组的第 K 大和",slug:"find-the-k-sum-of-an-array",difficulty:"困难",rating:2647,situation:"看懂答案",method:"转化+优先级队列",learn:"",unknown:""},{date:"2024/3/10",no:"299",name:"猜数字游戏",slug:"bulls-and-cows",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/3/11",no:"2129",name:"将标题首字母大写",slug:"capitalize-the-title",difficulty:"简单",rating:1274,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/3/12",no:"1261",name:"在受污染的二叉树中查找元素",slug:"find-elements-in-a-contaminated-binary-tree",difficulty:"中等",rating:1439,situation:"自己做出",method:"dfs+ 哈希/位运算",learn:"",unknown:""},{date:"2024/3/13",no:"2864",name:"最大二进制奇数",slug:"maximum-odd-binary-number",difficulty:"简单",rating:1237,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/3/14",no:"2789",name:"合并后数组中的最大元素",slug:"largest-element-in-an-array-after-merge-operations",difficulty:"中等",rating:1484,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/3/15",no:"2312",name:"卖木头块",slug:"selling-pieces-of-wood",difficulty:"困难",rating:2363,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/3/16",no:"2684",name:"矩阵中移动的最大次数",slug:"maximum-number-of-moves-in-a-grid",difficulty:"中等",rating:1625,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/3/17",no:"310",name:"最小高度树",slug:"minimum-height-trees",difficulty:"中等",rating:null,situation:"看思路写出",method:"转化+dfs/bfs/拓扑排序",learn:"",unknown:""},{date:"2024/3/18",no:"303",name:"区域和检索 - 数组不可变",slug:"range-sum-query-immutable",difficulty:"简单",rating:null,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2024/3/19",no:"1793",name:"好子数组的最大分数",slug:"maximum-score-of-a-good-subarray",difficulty:"困难",rating:1945,situation:"看懂答案",method:"双指针",learn:"",unknown:""},{date:"2024/3/20",no:"1969",name:"数组元素的最小非零乘积",slug:"minimum-non-zero-product-of-the-array-elements",difficulty:"中等",rating:1966,situation:"看懂答案",method:"贪心+数学+快速幂",learn:"快速幂",unknown:""},{date:"2024/3/21",no:"2671",name:"频率跟踪器",slug:"frequency-tracker",difficulty:"中等",rating:1509,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/3/22",no:"2617",name:"网格图中最少访问的格子数",slug:"minimum-number-of-visited-cells-in-a-grid",difficulty:"困难",rating:2581,situation:"没看懂答案",method:"优先级队列",learn:"",unknown:""},{date:"2024/3/23",no:"2549",name:"统计桌面上的不同数字",slug:"count-distinct-numbers-on-board",difficulty:"简单",rating:1265,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/3/24",no:"322",name:"零钱兑换",slug:"coin-change",difficulty:"中等",rating:null,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/3/25",no:"518",name:"零钱兑换 II",slug:"coin-change-ii",difficulty:"中等",rating:null,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/3/26",no:"2642",name:"设计可以求最短路径的图类",slug:"design-graph-with-shortest-path-calculator",difficulty:"困难",rating:1810,situation:"自己做出",method:"迪杰斯特拉",learn:"复习迪杰斯特拉算法",unknown:""},{date:"2024/3/27",no:"2580",name:"统计将重叠区间合并成组的方案数",slug:"count-ways-to-group-overlapping-ranges",difficulty:"中等",rating:1631,situation:"自己做出",method:"贪心+数学",learn:"",unknown:""},{date:"2024/3/28",no:"1997",name:"访问完所有房间的第一天",slug:"first-day-where-you-have-been-in-all-the-rooms",difficulty:"中等",rating:2260,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/3/29",no:"2908",name:"元素和最小的山形三元组 I",slug:"minimum-sum-of-mountain-triplets-i",difficulty:"简单",rating:1253,situation:"自己做出",method:"前后缀/单调队列",learn:"",unknown:""},{date:"2024/3/30",no:"2952",name:"需要添加的硬币的最小数量",slug:"minimum-number-of-coins-to-be-added",difficulty:"中等",rating:1784,situation:"看思路写出",method:"转化+贪心",learn:"",unknown:""},{date:"2024/3/31",no:"331",name:"验证二叉树的前序序列化",slug:"verify-preorder-serialization-of-a-binary-tree",difficulty:"中等",rating:null,situation:"自己做出",method:"栈/转化",learn:"",unknown:""}],[{date:"2024/4/1",no:"2810",name:"故障键盘",slug:"faulty-keyboard",difficulty:"简单",rating:1192,situation:"自己做出",method:"模拟/双端队列",learn:"",unknown:""},{date:"2024/4/2",no:"894",name:"所有可能的真二叉树",slug:"all-possible-full-binary-trees",difficulty:"中等",rating:1784,situation:"看懂答案",method:"分治/动态规划",learn:"",unknown:""},{date:"2024/4/3",no:"1379",name:"找出克隆二叉树中的相同节点",slug:"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",difficulty:"简单",rating:null,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2024/4/4",no:"2192",name:"有向无环图中一个节点的所有祖先",slug:"all-ancestors-of-a-node-in-a-directed-acyclic-graph",difficulty:"中等",rating:1787,situation:"自己做出",method:"拓扑排序/dfs",learn:"",unknown:""},{date:"2024/4/5",no:"1026",name:"节点与其祖先之间的最大差值",slug:"maximum-difference-between-node-and-ancestor",difficulty:"中等",rating:1446,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2024/4/6",no:"1483",name:"树节点的第 K 个祖先",slug:"kth-ancestor-of-a-tree-node",difficulty:"困难",rating:2115,situation:"没看懂答案",method:"倍增",learn:"",unknown:""},{date:"2024/4/7",no:"1600",name:"王位继承顺序",slug:"throne-inheritance",difficulty:"中等",rating:1768,situation:"自己做出",method:"多叉树的前序遍历",learn:"",unknown:""},{date:"2024/4/8",no:"2009",name:"使数组连续的最少操作数",slug:"minimum-number-of-operations-to-make-array-continuous",difficulty:"困难",rating:2084,situation:"看懂答案",method:"排序+滑动窗口",learn:"",unknown:""},{date:"2024/4/9",no:"2529",name:"正整数和负整数的最大计数",slug:"maximum-count-of-positive-integer-and-negative-integer",difficulty:"简单",rating:1195,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2024/4/10",no:"1702",name:"修改后的最大二进制字符串",slug:"maximum-binary-string-after-change",difficulty:"中等",rating:1825,situation:"看懂答案",method:"模拟+贪心 / 转化",learn:"",unknown:""},{date:"2024/4/11",no:"1766",name:"互质树",slug:"tree-of-coprimes",difficulty:"困难",rating:2231,situation:"看懂答案",method:"dfs",learn:"",unknown:""},{date:"2024/4/12",no:"2923",name:"找到冠军 I",slug:"find-champion-i",difficulty:"简单",rating:1235,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/4/13",no:"2924",name:"找到冠军 II",slug:"find-champion-ii",difficulty:"中等",rating:1430,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/4/14",no:"705",name:"设计哈希集合",slug:"design-hashset",difficulty:"简单",rating:null,situation:"自己做出",method:"链地址法",learn:"",unknown:""},{date:"2024/4/15",no:"706",name:"设计哈希映射",slug:"design-hashmap",difficulty:"简单",rating:null,situation:"自己做出",method:"链地址法",learn:"",unknown:""},{date:"2024/4/16",no:"924",name:"尽量减少恶意软件的传播",slug:"minimize-malware-spread",difficulty:"困难",rating:1868,situation:"看懂答案",method:"并查集",learn:"",unknown:""},{date:"2024/4/17",no:"928",name:"尽量减少恶意软件的传播 II",slug:"minimize-malware-spread-ii",difficulty:"困难",rating:1985,situation:"看懂答案",method:"dfs/并查集",learn:"",unknown:""},{date:"2024/4/18",no:"2007",name:"从双倍数组中还原原数组",slug:"find-original-array-from-doubled-array",difficulty:"中等",rating:1557,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2024/4/19",no:"1883",name:"准时抵达会议现场的最小跳过休息次数",slug:"minimum-skips-to-arrive-at-meeting-on-time",difficulty:"困难",rating:2587,situation:"看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/4/20",no:"39",name:"组合总和",slug:"combination-sum",difficulty:"中等",rating:null,situation:"自己做出",method:"回溯",learn:"",unknown:""},{date:"2024/4/21",no:"216",name:"组合总和 III",slug:"combination-sum-iii",difficulty:"中等",rating:null,situation:"自己做出",method:"二进制枚举/回溯",learn:"",unknown:""},{date:"2024/4/22",no:"377",name:"组合总和 Ⅳ",slug:"combination-sum-iv",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/4/23",no:"1052",name:"爱生气的书店老板",slug:"grumpy-bookstore-owner",difficulty:"",rating:1418,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2024/4/24",no:"2385",name:"感染二叉树需要的总时间",slug:"amount-of-time-for-binary-tree-to-be-infected",difficulty:"中等",rating:1711,situation:"自己做出",method:"dfs+bfs",learn:"",unknown:""},{date:"2024/4/25",no:"2739",name:"总行驶距离",slug:"total-distance-traveled",difficulty:"简单",rating:1262,situation:"自己做出",method:"模拟/数学",learn:"换水问题",unknown:""},{date:"2024/4/26",no:"1146",name:"快照数组",slug:"snapshot-array",difficulty:"中等",rating:1770,situation:"看懂答案",method:"二分",learn:"",unknown:""},{date:"2024/4/27",no:"2639",name:"查询网格图中每一列的宽度",slug:"find-the-width-of-columns-of-a-grid",difficulty:"简单",rating:1282,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/4/28",no:"1017",name:"负二进制转换",slug:"convert-to-base-2",difficulty:"中等",rating:1697,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/4/29",no:"1329",name:"将矩阵按对角线排序",slug:"sort-the-matrix-diagonally",difficulty:"中等",rating:1548,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/4/30",no:"2798",name:"满足目标工作时长的员工数目",slug:"number-of-employees-who-met-the-target",difficulty:"简单",rating:1142,situation:"自己做出",method:"模拟",learn:"",unknown:""}],[{date:"2024/5/1",no:"2462",name:"雇佣 K 位工人的总代价",slug:"total-cost-to-hire-k-workers",difficulty:"中等",rating:1763,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2024/5/2",no:"857",name:"雇佣 K 名工人的最低成本",slug:"minimum-cost-to-hire-k-workers",difficulty:"困难",rating:2259,situation:"看懂答案",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2024/5/3",no:"1491",name:"去掉最低工资和最高工资后的工资平均值",slug:"average-salary-excluding-the-minimum-and-maximum-salary",difficulty:"简单",rating:1201,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/5/4",no:"1235",name:"规划兼职工作",slug:"maximum-profit-in-job-scheduling",difficulty:"困难",rating:2022,situation:"看思路写出",method:"dp+二分",learn:"",unknown:""},{date:"2024/5/5",no:"1652",name:"拆炸弹",slug:"defuse-the-bomb",difficulty:"简单",rating:1416,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2024/5/6",no:"741",name:"摘樱桃",slug:"cherry-pickup",difficulty:"困难",rating:null,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/5/7",no:"1463",name:"摘樱桃 II",slug:"cherry-pickup-ii",difficulty:"困难",rating:1956,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/5/8",no:"2079",name:"给植物浇水",slug:"watering-plants",difficulty:"中等",rating:1320,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/9",no:"2105",name:"给植物浇水 II",slug:"watering-plants-ii",difficulty:"中等",rating:1507,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/10",no:"2960",name:"统计已测试设备",slug:"count-tested-devices-after-test-operations",difficulty:"简单",rating:1169,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/11",no:"2391",name:"收集垃圾的最少总时间",slug:"minimum-amount-of-time-to-collect-garbage",difficulty:"中等",rating:1455,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/5/12",no:"1553",name:"吃掉 N 个橘子的最少天数",slug:"minimum-number-of-days-to-eat-n-oranges",difficulty:"困难",rating:2048,situation:"自己做出",method:"记忆化搜索/ 转化+迪杰斯特拉 /启发式搜索",learn:"",unknown:""},{date:"2024/5/13",no:"994",name:"腐烂的橘子",slug:"rotting-oranges",difficulty:"中等",rating:1432,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/5/14",no:"2244",name:"完成所有任务需要的最少轮数",slug:"minimum-rounds-to-complete-all-tasks",difficulty:"中等",rating:1371,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/5/15",no:"2589",name:"完成所有任务的最少时间",slug:"minimum-time-to-complete-all-tasks",difficulty:"困难",rating:2380,situation:"看懂答案",method:"贪心+排序+（扫描线/二分查找）",learn:"",unknown:""},{date:"2024/5/16",no:"1953",name:"你可以工作的最大周数",slug:"maximum-number-of-weeks-for-which-you-can-work",difficulty:"中等",rating:1803,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/5/17",no:"826",name:"安排工作以达到最大收益",slug:"most-profit-assigning-work",difficulty:"中等",rating:1708,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2024/5/18",no:"2644",name:"找出可整除性得分最大的整数",slug:"find-the-maximum-divisibility-score",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/19",no:"1535",name:"找出数组游戏的赢家",slug:"find-the-winner-of-an-array-game",difficulty:"中等",rating:1433,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/20",no:"1542",name:"找出最长的超赞子字符串",slug:"find-longest-awesome-substring",difficulty:"困难",rating:2221,situation:"自己做出",method:"状态压缩+哈希表",learn:"",unknown:""},{date:"2024/5/21",no:"2769",name:"找出最大的可达成数字",slug:"find-the-maximum-achievable-number",difficulty:"简单",rating:1191,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/5/22",no:"2225",name:"找出输掉零场或一场比赛的玩家",slug:"find-players-with-zero-or-one-losses",difficulty:"中等",rating:1316,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/5/23",no:"2831",name:"找出最长等值子数组",slug:"find-the-longest-equal-subarray",difficulty:"中等",rating:1975,situation:"自己做出",method:"哈希+滑动窗口",learn:"",unknown:""},{date:"2024/5/24",no:"1673",name:"找出最具竞争力的子序列",slug:"find-the-most-competitive-subsequence",difficulty:"中等",rating:1802,situation:"看懂答案",method:"贪心+单调栈",learn:"",unknown:""},{date:"2024/5/25",no:"2903",name:"找出满足差值条件的下标 I",slug:"find-indices-with-index-and-value-difference-i",difficulty:"简单",rating:1157,situation:"自己做出",method:"模拟/双指针",learn:"",unknown:""},{date:"2024/5/26",no:"1738",name:"找出第 K 大的异或坐标值",slug:"find-kth-largest-xor-coordinate-value",difficulty:"中等",rating:1671,situation:"自己做出",method:"前缀和+ 排序/快速选择/优先级队列",learn:"",unknown:""},{date:"2024/5/27",no:"2028",name:"找出缺失的观测数据",slug:"find-missing-observations",difficulty:"中等",rating:1444,situation:"自己做出",method:"构造",learn:"",unknown:""},{date:"2024/5/28",no:"2951",name:"找出峰值",slug:"find-the-peaks",difficulty:"简单",rating:1189,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/29",no:"2981",name:"找出出现至少三次的最长特殊子字符串 I",slug:"find-longest-special-substring-that-occurs-thrice-i",difficulty:"中等",rating:1505,situation:"自己做出",method:"分类讨论",learn:"",unknown:""},{date:"2024/5/30",no:"2982",name:"找出出现至少三次的最长特殊子字符串 II",slug:"find-longest-special-substring-that-occurs-thrice-ii",difficulty:"中等",rating:1772,situation:"自己做出",method:"二分查找/分类讨论",learn:"",unknown:""},{date:"2024/5/31",no:"2965",name:"找出缺失和重复的数字",slug:"find-missing-and-repeated-values",difficulty:"简单",rating:1244,situation:"自己做出",method:"模拟/位运算/数学",learn:"",unknown:""}],[{date:"2024/6/1",no:"2928",name:"给小朋友们分糖果 I",slug:"distribute-candies-among-children-i",difficulty:"简单",rating:1393,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/6/2",no:"575",name:"分糖果",slug:"distribute-candies",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/6/3",no:"1103",name:"分糖果 II",slug:"distribute-candies-to-people",difficulty:"简单",rating:1287,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/6/4",no:"3067",name:"在带权树网络中统计可连接服务器对数目",slug:"count-pairs-of-connectable-servers-in-a-weighted-tree-network",difficulty:"中等",rating:1908,situation:"自己做出",method:"dfs/bfs+数学",learn:"",unknown:""},{date:"2024/6/5",no:"3072",name:"将元素分配到两个数组中 II",slug:"distribute-elements-into-two-arrays-ii",difficulty:"困难",rating:2052,situation:"没看懂答案",method:"树状数组",learn:"",unknown:""},{date:"2024/6/6",no:"2938",name:"区分黑球与白球",slug:"separate-black-and-white-balls",difficulty:"中等",rating:1422,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/6/7",no:"3038",name:"相同分数的最大操作数目 I",slug:"maximum-number-of-operations-with-the-same-score-i",difficulty:"简单",rating:1201,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/8",no:"3040",name:"相同分数的最大操作数目 II",slug:"maximum-number-of-operations-with-the-same-score-ii",difficulty:"中等",rating:1708,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/6/9",no:"312",name:"戳气球",slug:"burst-balloons",difficulty:"困难",rating:null,situation:"看懂答案",method:"记忆化搜索/区间dp",learn:"",unknown:""},{date:"2024/6/10",no:"881",name:"救生艇",slug:"boats-to-save-people",difficulty:"中等",rating:1529,situation:"自己做出",method:"贪心+排序+双指针",learn:"",unknown:""},{date:"2024/6/11",no:"419",name:"甲板上的战舰",slug:"battleships-in-a-board",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/6/12",no:"2806",name:"取整购买后的账户余额",slug:"account-balance-after-rounded-purchase",difficulty:"简单",rating:1214,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/6/13",no:"2813",name:"子序列最大优雅度",slug:"maximum-elegance-of-a-k-length-subsequence",difficulty:"困难",rating:2582,situation:"看懂答案",method:"贪心+哈希",learn:"",unknown:""},{date:"2024/6/14",no:"2786",name:"访问数组中的位置使分数最大",slug:"visit-array-positions-to-maximize-score",difficulty:"中等",rating:1732,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/6/15",no:"2779",name:"数组的最大美丽值",slug:"maximum-beauty-of-an-array-after-applying-operation",difficulty:"中等",rating:1638,situation:"自己做出",method:"排序+滑动窗口 / 差分",learn:"",unknown:""},{date:"2024/6/16",no:"521",name:"最长特殊序列 Ⅰ",slug:"longest-uncommon-subsequence-i",difficulty:"简单",rating:null,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2024/6/17",no:"522",name:"最长特殊序列 II",slug:"longest-uncommon-subsequence-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2024/6/18",no:"2288",name:"价格减免",slug:"apply-discount-to-prices",difficulty:"中等",rating:1577,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/19",no:"2713",name:"矩阵中严格递增的单元格数",slug:"maximum-strictly-increasing-cells-in-a-matrix",difficulty:"困难",rating:2387,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/6/20",no:"2748",name:"美丽下标对的数目",slug:"number-of-beautiful-pairs",difficulty:"简单",rating:1301,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/21",no:"LCP 61",name:"气温变化趋势",slug:"6CE719",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/22",no:"2663",name:"字典序最小的美丽字符串",slug:"lexicographically-smallest-beautiful-string",difficulty:"困难",rating:2415,situation:"没看懂答案",method:"贪心",learn:"",unknown:""},{date:"2024/6/23",no:"520",name:"检测大写字母",slug:"detect-capital",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/24",no:"503",name:"下一个更大元素 II",slug:"next-greater-element-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2024/6/25",no:"2732",name:"找到矩阵中的好子集",slug:"find-a-good-subset-of-the-matrix",difficulty:"困难",rating:2239,situation:"看思路写出",method:"数学+哈希",learn:"",unknown:""},{date:"2024/6/26",no:"2741",name:"特别的排列",slug:"special-permutations",difficulty:"中等",rating:2020,situation:"没看懂答案",method:"状态压缩+ 记忆化搜索/dp",learn:"",unknown:""},{date:"2024/6/27",no:"2734",name:"执行子串操作后的字典序最小字符串",slug:"lexicographically-smallest-string-after-substring-operation",difficulty:"中等",rating:1405,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/6/28",no:"2742",name:"给墙壁刷油漆",slug:"painting-the-walls",difficulty:"困难",rating:2424,situation:"看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/6/29",no:"2710",name:"移除字符串中的尾随零",slug:"remove-trailing-zeros-from-a-string",difficulty:"简单",rating:1164,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/30",no:"494",name:"目标和",slug:"target-sum",difficulty:"中等",rating:null,situation:"自己做出",method:"回溯/dp",learn:"",unknown:"dp"}],[{date:"2024/7/1",no:"2065",name:"最大化一张图中的路径价值",slug:"maximum-path-quality-of-a-graph",difficulty:"困难",rating:2178,situation:"自己做出",method:"dfs+哈希",learn:"",unknown:""},{date:"2024/7/2",no:"3115",name:"质数的最大距离",slug:"maximum-prime-difference",difficulty:"中等",rating:1294,situation:"自己做出",method:"素数筛",learn:"",unknown:""},{date:"2024/7/3",no:"3099",name:"哈沙德数",slug:"harshad-number",difficulty:"简单",rating:1100,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/4",no:"3086",name:"拾起 K 个 1 需要的最少行动次数",slug:"minimum-moves-to-pick-k-ones",difficulty:"困难",rating:2672,situation:"没看懂答案",method:"贪心+二分",learn:"",unknown:""},{date:"2024/7/5",no:"3033",name:"修改矩阵",slug:"modify-the-matrix",difficulty:"简单",rating:1180,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/6",no:"3101",name:"交替子数组计数",slug:"count-alternating-subarrays",difficulty:"中等",rating:1404,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/7/7",no:"1958",name:"检查操作是否合法",slug:"check-if-move-is-legal",difficulty:"中等",rating:1658,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/8",no:"724",name:"寻找数组的中心下标",slug:"find-pivot-index",difficulty:"简单",rating:null,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2024/7/9",no:"3102",name:"最小化曼哈顿距离",slug:"minimize-manhattan-distances",difficulty:"困难",rating:2215,situation:"没看懂答案",method:"数学",learn:"",unknown:"切比雪夫距离"},{date:"2024/7/10",no:"2970",name:"统计移除递增子数组的数目 I",slug:"count-the-number-of-incremovable-subarrays-i",difficulty:"简单",rating:1563,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2024/7/11",no:"2972",name:"统计移除递增子数组的数目 II",slug:"count-the-number-of-incremovable-subarrays-ii",difficulty:"困难",rating:2152,situation:"看懂答案",method:"双指针",learn:"",unknown:""},{date:"2024/7/12",no:"2974",name:"最小数字游戏",slug:"minimum-number-game",difficulty:"简单",rating:1184,situation:"自己做出",method:"排序+模拟",learn:"",unknown:""},{date:"2024/7/13",no:"3011",name:"判断一个数组是否可以变为有序",slug:"find-if-array-can-be-sorted",difficulty:"中等",rating:1496,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/14",no:"807",name:"保持城市天际线",slug:"max-increase-to-keep-city-skyline",difficulty:"中等",rating:1376,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/7/15",no:"721",name:"账户合并",slug:"accounts-merge",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希+并查集",learn:"",unknown:""},{date:"2024/7/16",no:"2956",name:"找到两个数组中的公共元素",slug:"find-common-elements-between-two-arrays",difficulty:"简单",rating:1214,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/7/17",no:"2959",name:"关闭分部的可行集合数目",slug:"number-of-possible-sets-of-closing-branches",difficulty:"困难",rating:2077,situation:"自己做出",method:"状态压缩+floyd算法/迪杰斯特拉",learn:"",unknown:""},{date:"2024/7/18",no:"3112",name:"访问消失节点的最少时间",slug:"minimum-time-to-visit-disappearing-nodes",difficulty:"中等",rating:1756,situation:"自己做出",method:"迪杰斯特拉",learn:"",unknown:""},{date:"2024/7/19",no:"3096",name:"得到更多分数的最少关卡数目",slug:"minimum-levels-to-gain-more-points",difficulty:"中等",rating:1500,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2024/7/20",no:"2850",name:"将石头分散到网格图的最少移动次数",slug:"minimum-moves-to-spread-stones-over-grid",difficulty:"中等",rating:2001,situation:"自己做出",method:"全排列",learn:"",unknown:""},{date:"2024/7/21",no:"1186",name:"删除一次得到子数组最大和",slug:"maximum-subarray-sum-with-one-deletion",difficulty:"中等",rating:1799,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/7/22",no:"2101",name:"引爆最多的炸弹",slug:"detonate-the-maximum-bombs",difficulty:"中等",rating:1880,situation:"自己做出",method:"转化+bfs",learn:"",unknown:""},{date:"2024/7/23",no:"3098",name:"求出所有子序列的能量和",slug:"find-the-sum-of-subsequence-powers",difficulty:"困难",rating:2552,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/7/24",no:"2766",name:"重新放置石块",slug:"relocate-marbles",difficulty:"中等",rating:1613,situation:"自己做出",method:"哈希+模拟",learn:"",unknown:""},{date:"2024/7/25",no:"2844",name:"生成特殊数字的最少操作",slug:"minimum-operations-to-make-a-special-number",difficulty:"中等",rating:1588,situation:"自己做出",method:"数学+转化",learn:"",unknown:""},{date:"2024/7/26",no:"2740",name:"找出分区值",slug:"find-the-value-of-the-partition",difficulty:"中等",rating:1301,situation:"自己做出",method:"转化+排序",learn:"",unknown:""},{date:"2024/7/27",no:"3106",name:"满足距离约束且字典序最小的字符串",slug:"lexicographically-smallest-string-after-operations-with-constraint",difficulty:"中等",rating:1515,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/7/28",no:"699",name:"掉落的方块",slug:"falling-squares",difficulty:"困难",rating:null,situation:"看懂答案",method:"模拟/有序集合/线段树",learn:"",unknown:""},{date:"2024/7/29",no:"682",name:"棒球比赛",slug:"baseball-game",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟+栈",learn:"",unknown:""},{date:"2024/7/30",no:"2961",name:"双模幂运算",slug:"double-modular-exponentiation",difficulty:"中等",rating:1450,situation:"自己做出",method:"数学（+快速幂）",learn:"",unknown:""},{date:"2024/7/31",no:"3111",name:"覆盖所有点的最少矩形数目",slug:"minimum-rectangles-to-cover-points",difficulty:"中等",rating:1401,situation:"自己做出",method:"贪心",learn:"",unknown:""}],[{date:"2024/8/1",no:"LCP 40",name:"心算挑战",slug:"uOAnQW",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心+排序/哈希",learn:"",unknown:""},{date:"2024/8/2",no:"3128",name:"直角三角形",slug:"right-triangles",difficulty:"中等",rating:1540,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/8/3",no:"3143",name:"正方形中的最多点数",slug:"maximum-points-inside-the-square",difficulty:"中等",rating:1696,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/8/4",no:"572",name:"另一棵树的子树",slug:"subtree-of-another-tree",difficulty:"简单",rating:null,situation:"自己做出",method:"dfs/树哈希",learn:"",unknown:"树哈希"},{date:"2024/8/5",no:"600",name:"不含连续1的非负整数",slug:"non-negative-integers-without-consecutive-ones",difficulty:"困难",rating:null,situation:"没看懂答案",method:"数位dp",learn:"",unknown:""},{date:"2024/8/6",no:"3129",name:"找出所有稳定的二进制数组 I",slug:"find-all-possible-stable-binary-arrays-i",difficulty:"中等",rating:2200,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/7",no:"3130",name:"找出所有稳定的二进制数组 II",slug:"find-all-possible-stable-binary-arrays-ii",difficulty:"困难",rating:2824,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/8",no:"3131",name:"找出与数组相加的整数 I",slug:"find-the-integer-added-to-array-i",difficulty:"简单",rating:1160,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/8/9",no:"3132",name:"找出与数组相加的整数 II",slug:"find-the-integer-added-to-array-ii",difficulty:"中等",rating:1620,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2024/8/10",no:"2940",name:"找到 Alice 和 Bob 可以相遇的建筑",slug:"find-building-where-alice-and-bob-can-meet",difficulty:"困难",rating:2327,situation:"自己做出",method:"线段树/单调栈/优先级队列",learn:"",unknown:""},{date:"2024/8/11",no:"1035",name:"不相交的线",slug:"uncrossed-lines",difficulty:"中等",rating:1805,situation:"自己做出",method:"转化+dp",learn:"",unknown:""},{date:"2024/8/12",no:"676",name:"实现一个魔法字典",slug:"implement-magic-dictionary",difficulty:"中等",rating:null,situation:"自己做出",method:"字典树",learn:"",unknown:""},{date:"2024/8/13",no:"3151",name:"特殊数组 I",slug:"special-array-i",difficulty:"简单",rating:1152,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/8/14",no:"3152",name:"特殊数组 II",slug:"special-array-ii",difficulty:"中等",rating:1523,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/8/15",no:"3148",name:"矩阵中的最大得分",slug:"maximum-difference-score-in-a-grid",difficulty:"中等",rating:1819,situation:"自己做出",method:"dp/前缀和",learn:"",unknown:""},{date:"2024/8/16",no:"3117",name:"划分数组得到最小的值之和",slug:"minimum-sum-of-values-by-dividing-array",difficulty:"困难",rating:2735,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/17",no:"3137",name:"K 周期字符串需要的最少操作次数",slug:"minimum-number-of-operations-to-make-word-k-periodic",difficulty:"中等",rating:1491,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2024/8/18",no:"551",name:"学生出勤记录 I",slug:"student-attendance-record-i",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/8/19",no:"552",name:"学生出勤记录 II",slug:"student-attendance-record-ii",difficulty:"困难",rating:null,situation:"自己做出",method:"记忆化搜索/dp/矩阵快速幂",learn:"",unknown:""},{date:"2024/8/20",no:"3154",name:"到达第 K 级台阶的方案数",slug:"find-number-of-ways-to-reach-the-k-th-stair",difficulty:"困难",rating:2071,situation:"没看懂答案",method:"记忆化搜索/数学",learn:"",unknown:""},{date:"2024/8/21",no:"3007",name:"价值和小于等于 K 的最大数字",slug:"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",difficulty:"中等",rating:2258,situation:"没看懂答案",method:"二分+数学",learn:"",unknown:""},{date:"2024/8/22",no:"3133",name:"数组最后一个元素的最小值",slug:"minimum-array-end",difficulty:"中等",rating:1934,situation:"看懂答案",method:"位运算",learn:"",unknown:""},{date:"2024/8/23",no:"3145",name:"大数组元素的乘积",slug:"find-products-of-elements-of-big-array",difficulty:"困难",rating:2859,situation:"没看懂答案",method:"二分",learn:"",unknown:""},{date:"2024/8/24",no:"3146",name:"两个字符串的排列差",slug:"permutation-difference-between-two-strings",difficulty:"简单",rating:1152,situation:"自己做出",method:"模拟（+哈希）",learn:"",unknown:""},{date:"2024/8/25",no:"698",name:"划分为k个相等的子集",slug:"partition-to-k-equal-sum-subsets",difficulty:"中等",rating:null,situation:"看懂答案",method:"状态压缩+记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/26",no:"690",name:"员工的重要性",slug:"employee-importance",difficulty:"中等",rating:null,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2024/8/27",no:"3134",name:"找出唯一性数组的中位数",slug:"find-the-median-of-the-uniqueness-array",difficulty:"困难",rating:2451,situation:"没看懂答案",method:"数学+二分",learn:"",unknown:""},{date:"2024/8/28",no:"3144",name:"分割字符频率相等的最少子字符串",slug:"minimum-substring-partition-of-equal-character-frequency",difficulty:"中等",rating:1917,situation:"自己做出",method:"dp+哈希",learn:"",unknown:""},{date:"2024/8/29",no:"3142",name:"判断矩阵是否满足条件",slug:"check-if-grid-satisfies-conditions",difficulty:"简单",rating:1303,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/8/30",no:"3153",name:"所有数对中数位差之和",slug:"sum-of-digit-differences-of-all-pairs",difficulty:"中等",rating:1645,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/8/31",no:"3127",name:"构造相同颜色的正方形",slug:"make-a-square-with-the-same-color",difficulty:"简单",rating:1337,situation:"自己做出",method:"模拟",learn:"",unknown:""}],[{date:"2024/9/1",no:"1450",name:"在既定时间做作业的学生人数",slug:"number-of-students-doing-homework-at-a-given-time",difficulty:"简单",rating:1129,situation:"自己做出",method:"模拟/差分/二分",learn:"",unknown:""},{date:"2024/9/2",no:"2024",name:"考试的最大困扰度",slug:"maximize-the-confusion-of-an-exam",difficulty:"中等",rating:1643,situation:"看思路写出",method:"滑动窗口",learn:"",unknown:""},{date:"2024/9/3",no:"2708",name:"一个小组的最大实力值",slug:"maximum-strength-of-a-group",difficulty:"中等",rating:1502,situation:"自己做出",method:"分类讨论+贪心 / 位运算",learn:"",unknown:""},{date:"2024/9/4",no:"2860",name:"让所有学生保持开心的分组方法数",slug:"happy-students",difficulty:"中等",rating:1625,situation:"自己做出",method:"排序+贪心",learn:"",unknown:""},{date:"2024/9/5",no:"3174",name:"清除数字",slug:"clear-digits",difficulty:"简单",rating:1255,situation:"自己做出",method:"栈",learn:"",unknown:""},{date:"2024/9/6",no:"3176",name:"求出最长好子序列 I",slug:"find-the-maximum-length-of-a-good-subsequence-i",difficulty:"中等",rating:1849,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/9/7",no:"3177",name:"求出最长好子序列 II",slug:"find-the-maximum-length-of-a-good-subsequence-ii",difficulty:"困难",rating:2364,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/9/8",no:"977",name:"有序数组的平方",slug:"squares-of-a-sorted-array",difficulty:"简单",rating:1129,situation:"自己做出",method:"模拟+排序/双指针",learn:"",unknown:""},{date:"2024/9/9",no:"2181",name:"合并零之间的节点",slug:"merge-nodes-in-between-zeros",difficulty:"中等",rating:1333,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/10",no:"2552",name:"统计上升四元组",slug:"count-increasing-quadruplets",difficulty:"困难",rating:2432,situation:"没看懂答案",method:"数学",learn:"",unknown:""},{date:"2024/9/11",no:"2555",name:"两个线段获得的最多奖品",slug:"maximize-win-from-two-segments",difficulty:"中等",rating:2080,situation:"没看懂答案",method:"二分/双指针+dp",learn:"",unknown:""},{date:"2024/9/12",no:"2576",name:"求出最多标记下标",slug:"find-the-maximum-number-of-marked-indices",difficulty:"中等",rating:1843,situation:"看懂答案",method:"二分查找/双指针",learn:"",unknown:""},{date:"2024/9/13",no:"2398",name:"预算内的最多机器人数目",slug:"maximum-number-of-robots-within-budget",difficulty:"困难",rating:1917,situation:"看懂答案",method:"双指针+单调队列",learn:"",unknown:""},{date:"2024/9/14",no:"2390",name:"从字符串中移除星号",slug:"removing-stars-from-a-string",difficulty:"中等",rating:1347,situation:"自己做出",method:"模拟/栈",learn:"",unknown:""},{date:"2024/9/15",no:"2848",name:"与车相交的点",slug:"points-that-intersect-with-cars",difficulty:"简单",rating:1229,situation:"自己做出",method:"模拟/差分数组",learn:"",unknown:""},{date:"2024/9/16",no:"1184",name:"公交站间的距离",slug:"distance-between-bus-stops",difficulty:"简单",rating:1234,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/17",no:"815",name:"公交路线",slug:"bus-routes",difficulty:"困难",rating:1964,situation:"自己做出",method:"超图+bfs",learn:"",unknown:""},{date:"2024/9/18",no:"2332",name:"坐上公交的最晚时间",slug:"the-latest-time-to-catch-a-bus",difficulty:"中等",rating:1840,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/19",no:"2414",name:"最长的字母序连续子字符串的长度",slug:"length-of-the-longest-alphabetical-continuous-substring",difficulty:"中等",rating:1221,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/20",no:"2376",name:"统计特殊整数",slug:"count-special-integers",difficulty:"困难",rating:2120,situation:"没看懂答案",method:"数位dp",learn:"",unknown:""},{date:"2024/9/21",no:"2374",name:"边积分最高的节点",slug:"node-with-highest-edge-score",difficulty:"中等",rating:1418,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/22",no:"997",name:"找到小镇的法官",slug:"find-the-town-judge",difficulty:"简单",rating:1201,situation:"自己做出",method:"图论",learn:"",unknown:""},{date:"2024/9/23",no:"1014",name:"最佳观光组合",slug:"best-sightseeing-pair",difficulty:"中等",rating:1730,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/9/24",no:"2207",name:"字符串中最多数目的子序列",slug:"maximize-number-of-subsequences-in-a-string",difficulty:"中等",rating:1550,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2024/9/25",no:"2306",name:"公司命名",slug:"naming-a-company",difficulty:"困难",rating:2305,situation:"看懂答案",method:"哈希+数学",learn:"",unknown:""},{date:"2024/9/26",no:"2535",name:"数组元素和与数字和的绝对差",slug:"difference-between-element-sum-and-digit-sum-of-an-array",difficulty:"简单",rating:1222,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/27",no:"2516",name:"每种字符至少取 K 个",slug:"take-k-of-each-character-from-left-and-right",difficulty:"中等",rating:1947,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2024/9/28",no:"2286",name:"以组为单位订音乐会的门票",slug:"booking-concert-tickets-in-groups",difficulty:"困难",rating:2470,situation:"没看懂答案",method:"线段树+二分",learn:"",unknown:""},{date:"2024/9/29",no:"2073",name:"买票需要的时间",slug:"time-needed-to-buy-tickets",difficulty:"简单",rating:1325,situation:"自己做出",method:"模拟/转化",learn:"",unknown:""}]]},NB={daily:uae},cae={month:[[{date:"2023/1/1",no:"2351",name:"第一个出现两次的字母",difficulty:"简单",rating:1155,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"2023/1/2",no:"1801",name:"积压订单中的订单总数",difficulty:"中等",rating:1711,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/1/3",no:"2042",name:"检查句子中的数字是否递增",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/1/4",no:"1802",name:"有界数组中指定下标处的最大值",difficulty:"中等",rating:1929,situation:"自己做出",method:"贪心+二分 / 数学",learn:"",unknown:""},{date:"2023/1/5",no:"1803",name:"统计异或值在范围内的数对有多少",difficulty:"困难",rating:2479,situation:"自己做出",method:"字典树",learn:"字典树",unknown:""},{date:"2023/1/6",no:"2180",name:"统计各位数字之和为偶数的整数个数",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2023/1/7",no:"1658",name:"将x减到0的最小操作数",difficulty:"中等",rating:1817,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/1/8",no:"2185",name:"统计包含给定前缀的字符串",difficulty:"简单",rating:1167,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/1/9",no:"1806",name:"还原排列的最少操作步数",difficulty:"中等",rating:1491,situation:"自己做出",method:"模拟/数学",learn:"",unknown:"数学"},{date:"1/10/23",no:"753",name:"破解保险箱",difficulty:"困难",rating:2273,situation:"看懂答案",method:"hierholzer算法",learn:"hierholzer算法",unknown:"hierholzer算法"},{date:"1/11/23",no:"2283",name:"判断一个数的数字计数是否等于数位的值",difficulty:"简单",rating:1253,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"1/12/23",no:"1807",name:"替换字符串中的括号内容",difficulty:"中等",rating:1481,situation:"自己做出",method:"哈希表",learn:"字符串数组转map方法",unknown:""},{date:"1/13/23",no:"2287",name:"重排字符形成目标字符串",difficulty:"简单",rating:1299,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"1/14/23",no:"1819",name:"序列中不同最大公约数的数目",difficulty:"困难",rating:2539,situation:"看懂答案",method:"转化+数学",learn:"",unknown:""},{date:"1/15/23",no:"2293",name:"极大极小游戏",difficulty:"简单",rating:1241,situation:"自己做出",method:"模拟/递归",learn:"",unknown:""},{date:"1/16/23",no:"1813",name:"句子相似性III",difficulty:"中等",rating:1588,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"1/17/23",no:"1814",name:"统计一个数组中好对子的数目",difficulty:"中等",rating:1737,situation:"自己做出",method:"转化+哈希表",learn:"",unknown:""},{date:"1/18/23",no:"1825",name:"求出MK平均值",difficulty:"困难",rating:2395,situation:"没看懂答案",method:"有序集合",learn:"",unknown:""},{date:"1/19/23",no:"2299",name:"强密码检验器II",difficulty:"简单",rating:1241,situation:"自己做出",method:"正则表达式",learn:"正则预查",unknown:""},{date:"1/20/23",no:"1817",name:"查找用户活跃分钟数",difficulty:"中等",rating:1360,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"1/21/23",no:"1824",name:"最少侧跳次数",difficulty:"中等",rating:1778,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"1/22/23",no:"1815",name:"得到新鲜甜甜圈的最多组数",difficulty:"困难",rating:2559,situation:"没看懂答案",method:"状态压缩+dp",learn:"模拟退火算法",unknown:""},{date:"1/23/23",no:"2303",name:"计算应缴税款总额",difficulty:"简单",rating:1283,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"1/24/23",no:"1828",name:"统计一个圆中点的数目",difficulty:"中等",rating:1380,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"1/25/23",no:"1632",name:"矩阵转换后的秩",difficulty:"困难",rating:2529,situation:"没看懂答案",method:"并查集+拓扑排序",learn:"",unknown:""},{date:"1/26/23",no:"1663",name:"具有给定数值的最小字符串",difficulty:"中等",rating:1460,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"1/27/23",no:"2309",name:"兼具大小写的最好英文字母",difficulty:"简单",rating:1242,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"1/28/23",no:"1664",name:"生成平衡数组的方案数",difficulty:"中等",rating:1590,situation:"自己做出",method:"dp/前缀和",learn:"",unknown:""},{date:"1/29/23",no:"2315",name:"统计星号",difficulty:"简单",rating:1250,situation:"自己做出",method:"模拟",learn:"正则计数方法",unknown:""},{date:"1/30/23",no:"1669",name:"合并两个链表",difficulty:"中等",rating:1428,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"1/31/23",no:"2319",name:"判读矩阵是否是一个X矩阵",difficulty:"简单",rating:1200,situation:"自己做出",method:"模拟",learn:"",unknown:""}],[{date:"2023/2/1",no:"2325",name:"解密消息",difficulty:"简单",rating:1268,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/2/2",no:"1129",name:"颜色交替的最短路径",difficulty:"中等",rating:1779,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/2/3",no:"1145",name:"二叉树着色游戏",difficulty:"中等",rating:1741,situation:"看懂答案",method:"dfs",learn:"树的重心",unknown:""},{date:"2023/2/4",no:"1798",name:"你能构造出连续值的最大数目",difficulty:"中等",rating:1931,situation:"看懂答案",method:"贪心+转化",learn:"",unknown:""},{date:"2023/2/5",no:"1210",name:"穿过迷宫的最少移动次数",difficulty:"困难",rating:2022,situation:"没看懂答案",method:"bfs",learn:"",unknown:""},{date:"2023/2/6",no:"2331",name:"计算布尔二叉树的值",difficulty:"简单",rating:1303,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2023/2/7",no:"1604",name:"警告一小时内使用相同员工卡大于等于三次的人",difficulty:"中等",rating:1606,situation:"自己做出",method:"哈希+排序",learn:"",unknown:""},{date:"2023/2/8",no:"1233",name:"删除子文件夹",difficulty:"中等",rating:1544,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/2/9",no:"1797",name:"设计一个验证系统",difficulty:"中等",rating:1534,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/2/10",no:"1223",name:"掷骰子模拟",difficulty:"困难",rating:2008,situation:"没看懂答案",method:"动态规划",learn:"记忆化搜索",unknown:""},{date:"2023/2/11",no:"2335",name:"装满杯子需要的最短总时长",difficulty:"简单",rating:1360,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2023/2/12",no:"1138",name:"字母板上的路径",difficulty:"中等",rating:1410,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/2/13",no:"1234",name:"替换子串得到平衡字符串",difficulty:"中等",rating:1877,situation:"自己做出",method:"滑动窗口+哈希",learn:"",unknown:""},{date:"2023/2/14",no:"1124",name:"表现良好的最长时间段",difficulty:"中等",rating:1908,situation:"自己做出",method:"贪心/哈希",learn:"",unknown:""},{date:"2023/2/15",no:"1250",name:"检查好数组",difficulty:"困难",rating:1983,situation:"自己做出",method:"数论",learn:"裴蜀定理",unknown:""},{date:"2023/2/16",no:"2341",name:"数组能形成多少数对",difficulty:"简单",rating:1184,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/2/17",no:"1139",name:"最大的以1为边界的正方形",difficulty:"中等",rating:1744,situation:"自己做出",method:"动态规划/前缀和",learn:"",unknown:"动态规划"},{date:"2023/2/18",no:"1237",name:"找出给定方程的正整数解",difficulty:"中等",rating:1404,situation:"自己做出",method:"暴力/二分/双指针",learn:"",unknown:""},{date:"2023/2/19",no:"1792",name:"最大平均通过率",difficulty:"中等",rating:1817,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/2/20",no:"2347",name:"最好的扑克手牌",difficulty:"简单",rating:1241,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/2/21",no:"1326",name:"灌溉花园的最少水龙头数目",difficulty:"困难",rating:1326,situation:"自己做出",method:"动态规划/贪心",learn:"",unknown:""},{date:"2023/2/22",no:"1140",name:"石子游戏II",difficulty:"中等",rating:2034,situation:"看懂答案",method:"后缀和+记忆化搜索/dp",learn:"记忆化搜索",unknown:""},{date:"2023/2/23",no:"1218",name:"循环码排列",difficulty:"中等",rating:1774,situation:"自己做出",method:"模拟",learn:"格雷码生成公式：(i >> 1) ^ i ^ start",unknown:""},{date:"2023/2/24",no:"2357",name:"使数组中所有元素都等于零",difficulty:"简单",rating:1225,situation:"自己做出",method:"哈希/排序",learn:"",unknown:""},{date:"2023/2/25",no:"1247",name:"交换字符使得字符串相同",difficulty:"中等",rating:1591,situation:"自己做出",method:"转化+贪心",learn:"",unknown:""},{date:"2023/2/26",no:"1255",name:"得分最高的单词集合",difficulty:"困难",rating:1881,situation:"自己做出",method:"dfs/状态压缩 +哈希",learn:"状态压缩",unknown:""},{date:"2023/2/27",no:"1144",name:"递减元素使数组呈锯齿状",difficulty:"中等",rating:1558,situation:"自己做出",method:"贪心+分类讨论",learn:"",unknown:""},{date:"2023/2/28",no:"2363",name:"合并相似的物品",difficulty:"简单",rating:1270,situation:"自己做出",method:"哈希",learn:"",unknown:""}],[{date:"2023/3/1",no:"2373",name:"矩阵中的局部最大值",difficulty:"简单",rating:1331,situation:"自己做出",method:"模拟/二维单调队列",learn:"",unknown:""},{date:"2023/3/2",no:"面试题05.02",name:"二进制数转字符串",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/3/3",no:"1487",name:"保证文件名唯一",difficulty:"中等",rating:1696,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/3/4",no:"982",name:"按位与为零的三元组",difficulty:"困难",rating:2084,situation:"自己做出",method:"哈希/快速沃尔什变换",learn:"快速沃尔什变换",unknown:""},{date:"2023/3/5",no:"1599",name:"经营摩天轮的最大利润",difficulty:"中等",rating:1548,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/3/6",no:"1653",name:"使字符串平衡的最少删除次数",difficulty:"中等",rating:1793,situation:"自己做出",method:"动态规划",learn:"",unknown:""},{date:"2023/3/7",no:"1096",name:"花括号展开II",difficulty:"困难",rating:2348,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2023/3/8",no:"剑指Offer 47",name:"礼物的最大价值",difficulty:"中等",rating:null,situation:"自己做出",method:"动态规划",learn:"",unknown:""},{date:"2023/3/9",no:"2379",name:"得到K个黑块的最少涂色次数",difficulty:"简单",rating:1360,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/3/10",no:"1590",name:"使数组和能被P整除",difficulty:"中等",rating:2038,situation:"看懂答案",method:"数学+前缀和+哈希",learn:"",unknown:""},{date:"2023/3/11",no:"面试题17.05",name:"字母与数字",difficulty:"中等",rating:null,situation:"自己做出",method:"前缀和+哈希",learn:"",unknown:""},{date:"2023/3/12",no:"1617",name:"统计子树中城市之间最大距离",difficulty:"困难",rating:2308,situation:"看懂答案",method:"状态压缩+ 动态规划/dfs+bfs",learn:"求树直径的方式：一次dfs找到最远节点，从最远节点dfs找最远节点为树直径。",unknown:""},{date:"2023/3/13",no:"2383",name:"赢得比赛需要的最少训练时长",difficulty:"简单",rating:1413,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/3/14",no:"1605",name:"给定行和列的和求可行矩阵",difficulty:"中等",rating:1867,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/3/15",no:"1615",name:"最大网络秩",difficulty:"中等",rating:1521,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/3/16",no:"2488",name:"统计中位数为K的子数组",difficulty:"困难",rating:1998,situation:"看懂答案",method:"前缀和+哈希",learn:"",unknown:""},{date:"2023/3/17",no:"2389",name:"和有限的最长子序列",difficulty:"简单",rating:1387,situation:"自己做出",method:"排序+二分",learn:"",unknown:""},{date:"2023/3/18",no:"1616",name:"分割两个字符串得到回文串",difficulty:"中等",rating:1868,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/3/19",no:"1625",name:"执行操作后字典序最小的字符串",difficulty:"中等",rating:1992,situation:"自己做出",method:"裴蜀定理/ bfs+哈希",learn:"",unknown:""},{date:"2023/3/20",no:"1012",name:"至少有1位重复的数字",difficulty:"困难",rating:2230,situation:"自己做出",method:"数位dp",learn:"复习数位dp",unknown:""},{date:"2023/3/21",no:"2469",name:"温度转换",difficulty:"简单",rating:1153,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/3/22",no:"1626",name:"无矛盾的最佳球队",difficulty:"中等",rating:2027,situation:"自己做出",method:"排序+dp",learn:"",unknown:""},{date:"2022023/3/3",no:"1630",name:"等差子数组",difficulty:"中等",rating:1421,situation:"自己做出",method:"数学",learn:"O(n)验证重排等差数列的方法",unknown:""},{date:"2023/3/24",no:"1032",name:"字符流",difficulty:"困难",rating:1970,situation:"没看懂答案",method:"AC自动机",learn:"AC自动机",unknown:""},{date:"2023/3/25",no:"1574",name:"删除最短的子数组使剩余数组有序",difficulty:"中等",rating:1931,situation:"看思路写出",method:"贪心+双指针",learn:"",unknown:""},{date:"2023/3/26",no:"2395",name:"和相等的子数组",difficulty:"简单",rating:1249,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/3/27",no:"1638",name:"统计只差一个字符的子串数目",difficulty:"中等",rating:1744,situation:"看懂答案",method:"枚举/dp",learn:"",unknown:""},{date:"2023/3/28",no:"1092",name:"最短公共超序列",difficulty:"困难",rating:1976,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/3/29",no:"1641",name:"统计字典序元音字符串的数目",difficulty:"中等",rating:1519,situation:"自己做出",method:"dp/数学",learn:"",unknown:""},{date:"2023/3/30",no:"1637",name:"两点之间不包含任何点的最宽垂直区域",difficulty:"中等",rating:1486,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/3/31",no:"2367",name:"算术三元组的数目",difficulty:"简单",rating:1203,situation:"自己做出",method:"哈希/三指针",learn:"",unknown:""}],[{date:"2023/4/1",no:"831",name:"隐藏个人信息",difficulty:"中等",rating:1450,situation:"自己做出",method:"模拟/正则",learn:"",unknown:""},{date:"2023/4/2",no:"1039",name:"多边形三角剖分的最低得分",difficulty:"中等",rating:2130,situation:"看懂答案",method:"记忆化搜索/区间dp",learn:"记忆化搜索，区间dp",unknown:""},{date:"2023/4/3",no:"1053",name:"交换一次的先前排列",difficulty:"中等",rating:1633,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/4/4",no:"1000",name:"合并石头的最低成本",difficulty:"困难",rating:2422,situation:"看懂答案",method:"前缀和+ 记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/5",no:"2427",name:"公因子的数目",difficulty:"简单",rating:1172,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/4/6",no:"1017",name:"负二进制转换",difficulty:"中等",rating:1697,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2023/4/7",no:"1040",name:"移动石子直到连续II",difficulty:"中等",rating:2455,situation:"没看懂答案",method:"构造+双指针",learn:"",unknown:""},{date:"2023/4/8",no:"1125",name:"最小的必要团队",difficulty:"困难",rating:2250,situation:"没看懂答案",method:"记忆化搜索/区间dp",learn:"",unknown:""},{date:"2023/4/9",no:"2399",name:"检查相同字母间的距离",difficulty:"简单",rating:1243,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/4/10",no:"1019",name:"链表中的下一个更大节点",difficulty:"中等",rating:1570,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2023/4/11",no:"1041",name:"困于环中的机器人",difficulty:"中等",rating:1541,situation:"看思路写出",method:"模拟/找规律",learn:"",unknown:""},{date:"2023/4/12",no:"1147",name:"段氏回文",difficulty:"困难",rating:1912,situation:"自己做出",method:"贪心+双指针 / 滚动哈希",learn:"",unknown:""},{date:"2023/4/13",no:"2404",name:"出现最频繁的偶数元素",difficulty:"简单",rating:1259,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/4/14",no:"1023",name:"驼峰式匹配",difficulty:"中等",rating:1537,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/4/15",no:"1042",name:"不邻接植花",difficulty:"中等",rating:1712,situation:"自己做出",method:"暴力",learn:"",unknown:""},{date:"2023/4/16",no:"1157",name:"子数组中占绝大多数的元素",difficulty:"困难",rating:2205,situation:"没看懂答案",method:"随机化+二分查找 / 摩尔投票+线段树 / wavelet树",learn:"wavelettree",unknown:""},{date:"2023/4/17",no:"2409",name:"统计共同度过的日子数",difficulty:"简单",rating:1562,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/4/18",no:"1026",name:"节点与其祖先之间的最大差值",difficulty:"中等",rating:1446,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/4/19",no:"1043",name:"分隔数组以得到最大和",difficulty:"中等",rating:1916,situation:"看思路写出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/20",no:"1187",name:"使数组严格递增",difficulty:"困难",rating:2315,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/21",no:"2413",name:"最小偶倍数",difficulty:"简单",rating:1144,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/4/22",no:"1027",name:"最长等差数列",difficulty:"中等",rating:1758,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2022023/3/4",no:"1105",name:"填充书架",difficulty:"中等",rating:2014,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/24",no:"1163",name:"按字典序排在最后的子串",difficulty:"困难",rating:1864,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/4/25",no:"2418",name:"按身高排序",difficulty:"简单",rating:1193,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/4/26",no:"1031",name:"两个非重叠子数组的最大和",difficulty:"中等",rating:1680,situation:"自己做出",method:"dp+滑动窗口 / 前缀和",learn:"",unknown:""},{date:"2023/4/27",no:"1048",name:"最长字符串链",difficulty:"中等",rating:1599,situation:"自己做出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/4/28",no:"1172",name:"餐盘栈",difficulty:"困难",rating:2109,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/4/29",no:"2423",name:"删除字符使频率相同",difficulty:"中等",rating:1648,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/4/30",no:"1033",name:"移动石子直到连续",difficulty:"中等",rating:1421,situation:"自己做出",method:"贪心",learn:"",unknown:""}],[{date:"2023/5/1",no:"1376",name:"通知所有员工所需的时间",difficulty:"中等",rating:1561,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/5/2",no:"970",name:"强整数",difficulty:"中等",rating:1338,situation:"自己做出",method:"枚举",learn:"",unknown:""},{date:"2023/5/3",no:"1003",name:"检查替换后的词是否有效",difficulty:"中等",rating:1426,situation:"自己做出",method:"栈",learn:"",unknown:""},{date:"2023/5/4",no:"2106",name:"摘水果",difficulty:"困难",rating:2062,situation:"自己做出",method:"滑动窗口/二分查找",learn:"",unknown:""},{date:"2023/5/5",no:"2432",name:"处理用时最长的那个任务的员工",difficulty:"简单",rating:1266,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/6",no:"1419",name:"数青蛙",difficulty:"中等",rating:1689,situation:"自己做出",method:"计数",learn:"",unknown:""},{date:"2023/5/7",no:"1010",name:"总持续时间可被60整除的歌曲",difficulty:"中等",rating:1377,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/5/8",no:"1263",name:"推箱子",difficulty:"困难",rating:2297,situation:"没看懂答案",method:"bfs+优先级队列",learn:"",unknown:""},{date:"2023/5/9",no:"2437",name:"有效时间的数目",difficulty:"简单",rating:1426,situation:"自己做出",method:"回溯/分类讨论",learn:"",unknown:""},{date:"2023/5/10",no:"1015",name:"可被K整除的最小整数",difficulty:"中等",rating:1874,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2023/5/11",no:"1016",name:"子串能表示从 1 到 N 数字的二进制串",difficulty:"中等",rating:1779,situation:"看思路写出",method:"数学+滑动窗口+哈希 / 暴力",learn:"",unknown:""},{date:"2023/5/12",no:"1330",name:"翻转子数组得到最大的数组值",difficulty:"困难",rating:2481,situation:"看懂答案",method:"数学+转化",learn:"",unknown:""},{date:"2023/5/13",no:"2441",name:"与对应负数同时存在的最大正整数",difficulty:"困难",rating:1167,situation:"自己做出",method:"枚举/哈希/ 排序+双指针",learn:"",unknown:""},{date:"2023/5/14",no:"1054",name:"距离相等的条形码",difficulty:"中等",rating:1751,situation:"自己做出",method:"堆/计数",learn:"",unknown:""},{date:"2023/5/15",no:"1072",name:"按列翻转得到最大值等行数",difficulty:"中等",rating:1797,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2023/5/16",no:"1335",name:"工作计划的最低难度",difficulty:"困难",rating:2034,situation:"自己做出",method:"记忆化搜索/dp/单调栈",learn:"",unknown:""},{date:"2023/5/17",no:"2446",name:"判断两个事件是否存在冲突",difficulty:"困难",rating:1322,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/18",no:"1073",name:"负二进制数相加",difficulty:"中等",rating:1806,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/5/19",no:"1079",name:"活字印刷",difficulty:"中等",rating:1740,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/5/20",no:"1373",name:"二叉搜索子树的最大键值和",difficulty:"困难",rating:1913,situation:"没看懂答案",method:"递归",learn:"",unknown:""},{date:"2023/5/21",no:"LCP 33",name:"蓄水",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心+数学/优先级队列",learn:"",unknown:""},{date:"2023/5/22",no:"1080",name:"根到叶路径上的不足节点",difficulty:"中等",rating:1804,situation:"看懂答案",method:"dfs",learn:"",unknown:""},{date:"2023/5/23",no:"1090",name:"受标签影响的最大值",difficulty:"中等",rating:1501,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2023/5/24",no:"1377",name:"T秒后青蛙的位置",difficulty:"困难",rating:1823,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/5/25",no:"2451",name:"差值数组不同的字符串",slug:"odd-string-difference",difficulty:"简单",rating:1406,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/26",no:"1091",name:"二进制矩阵中的最短路径",slug:"shortest-path-in-binary-matrix",difficulty:"中等",rating:1658,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/5/27",no:"1093",name:"大样本统计",slug:"statistics-from-a-large-sample",difficulty:"中等",rating:1471,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/5/28",no:"1439",name:"有序矩阵中的第 k 个最小数组和",slug:"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",difficulty:"困难",rating:2133,situation:"自己做出",method:"二分查找+双指针+排序/ 优先级队列",learn:"",unknown:""},{date:"2023/5/29",no:"2455",name:"可被三整除的偶数的平均值",slug:"average-value-of-even-numbers-that-are-divisible-by-three",difficulty:"简单",rating:1151,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/30",no:"1110",name:"删点成林",slug:"delete-nodes-and-return-forest",difficulty:"简单",rating:1511,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/5/31",no:"1130",name:"叶值的最小代价生成树",slug:"minimum-cost-tree-from-leaf-values",difficulty:"中等",rating:1919,situation:"看懂答案",method:"记忆化搜索/区间dp/单调栈",learn:"",unknown:""}],[{date:"2023/6/1",no:"2517",name:"礼盒的最大甜蜜度",slug:"maximum-tastiness-of-candy-basket",difficulty:"中等",rating:2020,situation:"自己做出",method:"排序+二分",learn:"",unknown:""},{date:"2023/6/2",no:"2559",name:"统计范围内的元音字符串数",slug:"count-vowel-strings-in-ranges",difficulty:"中等",rating:1435,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2023/6/3",no:"1156",name:"单字符重复子串的最大长度",slug:"swap-for-longest-repeated-character-substring",difficulty:"中等",rating:1787,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/6/4",no:"1156",name:"不同的平均值数目",slug:"number-of-distinct-averages",difficulty:"简单",rating:1250,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2023/6/5",no:"2460",name:"对数组执行操作",slug:"apply-operations-to-an-array",difficulty:"简单",rating:1223,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/6",no:"2352",name:"相等行列对",slug:"equal-row-and-column-pairs",difficulty:"中等",rating:1286,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/6/7",no:"2611",name:"老鼠和奶酪",slug:"mice-and-cheese",difficulty:"中等",rating:1663,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2023/6/8",no:"1240",name:"铺瓷砖",slug:"tiling-a-rectangle-with-the-fewest-squares",difficulty:"困难",rating:2241,situation:"没看懂答案",method:"回溯",learn:"",unknown:""},{date:"2023/6/9",no:"2699",name:"修改图中的边权",slug:"modify-graph-edge-weights",difficulty:"困难",rating:2873,situation:"没看懂答案",method:"二分+迪杰斯特拉",learn:"",unknown:""},{date:"2023/6/10",no:"1170",name:"比较字符串最小字母出现频次",slug:"compare-strings-by-frequency-of-the-smallest-character",difficulty:"中等",rating:1431,situation:"自己做出",method:"排序/后缀和",learn:"",unknown:""},{date:"2023/6/11",no:"1171",name:"从链表中删去总和值为零的连续节点",slug:"remove-zero-sum-consecutive-nodes-from-linked-list",difficulty:"中等",rating:1782,situation:"看懂答案",method:"哈希",learn:"",unknown:""},{date:"2023/6/12",no:"1483",name:"树节点的第 K 个祖先",slug:"kth-ancestor-of-a-tree-node",difficulty:"困难",rating:2115,situation:"看懂答案",method:"倍增",learn:"倍增",unknown:""},{date:"2023/6/13",no:"2475",name:"数组中不等三元组的数目",slug:"number-of-unequal-triplets-in-array",difficulty:"简单",rating:1255,situation:"自己做出",method:"模拟/排序/哈希",learn:"",unknown:""},{date:"2023/6/14",no:"1375",name:"二进制字符串前缀一致的次数",slug:"number-of-times-binary-string-is-prefix-aligned",difficulty:"中等",rating:1438,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/15",no:"1177",name:"构建回文串检测",slug:"can-make-palindrome-from-substring",difficulty:"中等",rating:1848,situation:"看懂答案",method:"转化+前缀数组+位运算",learn:"位运算",unknown:""},{date:"2023/6/16",no:"1494",name:"并行课程 II",slug:"parallel-courses-ii",difficulty:"困难",rating:2081,situation:"没看懂答案",method:"dp+状态压缩+子集",learn:"",unknown:""},{date:"2023/6/17",no:"2481",name:"分割圆的最少切割次数",slug:"minimum-cuts-to-divide-a-circle",difficulty:"简单",rating:1246,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/18",no:"1254",name:"统计封闭岛屿的数目",slug:"number-of-closed-islands",difficulty:"中等",rating:1658,situation:"自己做出",method:"bfs/dfs/并查集",learn:"",unknown:""},{date:"2023/6/19",no:"1262",name:"可被三整除的最大和",slug:"greatest-sum-divisible-by-three",difficulty:"中等",rating:1762,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/6/20",no:"1595",name:"连通两组点的最小成本",slug:"minimum-cost-to-connect-two-groups-of-points",difficulty:"困难",rating:2537,situation:"没看懂答案",method:"状态压缩+动态规划",learn:"",unknown:""},{date:"2023/6/21",no:"LCP 41",name:"黑白翻转棋",slug:"fHi6rV",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/6/22",no:"面试题16.19",name:"水域大小",slug:"pond-sizes-lcci",difficulty:"中等",rating:null,situation:"自己做出",method:"dfs/bfs + 排序",learn:"",unknown:""},{date:"2023/6/23",no:"2496",name:"数组中字符串的最大值",slug:"maximum-value-of-a-string-in-an-array",difficulty:"简单",rating:1292,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/24",no:"1659",name:"最大化网格幸福感",slug:"maximize-grid-happiness",difficulty:"困难",rating:2655,situation:"没看懂答案",method:"状态压缩+dp",learn:"",unknown:""},{date:"2023/6/25",no:"1401",name:"圆和矩形是否有重叠",slug:"circle-and-rectangle-overlapping",difficulty:"中等",rating:1701,situation:"自己做出",method:"数学+分类讨论",learn:"",unknown:""},{date:"2023/6/26",no:"2485",name:"找出中枢整数",slug:"find-the-pivot-integer",difficulty:"简单",rating:1207,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/6/27",no:"1186",name:"删除一次得到子数组最大和",slug:"maximum-subarray-sum-with-one-deletion",difficulty:"中等",rating:1799,situation:"看思路写出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/6/28",no:"1681",name:"最小不兼容性",slug:"minimum-incompatibility",difficulty:"困难",rating:2389,situation:"没看懂答案",method:"dp+状态压缩+子集",learn:"",unknown:""},{date:"2023/6/29",no:"1253",name:"重构 2 行二进制矩阵",slug:"reconstruct-a-2-row-binary-matrix",difficulty:"中等",rating:1505,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/6/30",no:"2490",name:"回环句",slug:"circular-sentence",difficulty:"简单",rating:1262,situation:"自己做出",method:"",learn:"",unknown:""}],[{date:"2023/7/1",no:"1",name:"两数之和",slug:"two-sum",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"2023/7/2",no:"2",name:"两数相加",slug:"add-two-numbers",difficulty:"中等",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"2023/7/3",no:"445",name:"两数相加II",slug:"add-two-numbers-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"链表+栈",learn:"",unknown:""},{date:"2023/7/4",no:"2679",name:"矩阵中的和",slug:"sum-in-a-matrix",difficulty:"中等",rating:1333,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/7/5",no:"2600",name:"K 件物品的最大和",slug:"k-items-with-the-maximum-sum",difficulty:"中等",rating:1434,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/7/6",no:"2178",name:"拆分成最多数目的正偶数之和",slug:"maximum-split-of-positive-even-integers",difficulty:"中等",rating:1537,situation:"自己做出",method:"贪心+数学",learn:"",unknown:""},{date:"2023/7/7",no:"2532",name:"过桥的时间",slug:"time-to-cross-a-bridge",difficulty:"困难",rating:2588,situation:"没看懂答案",method:"模拟+优先级队列",learn:"",unknown:""},{date:"2023/7/8",no:"167",name:"两数之和 II - 输入有序数组",slug:"two-sum-ii-input-array-is-sorted",difficulty:"中等",rating:null,situation:"自己做出",method:"二分查找/双指针",learn:"",unknown:""},{date:"2023/7/9",no:"15",name:"三数之和",slug:"3sum",difficulty:"中等",rating:null,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2023/7/10",no:"16",name:"最接近的三数之和",slug:"3sum-closest",difficulty:"中等",rating:null,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2023/7/11",no:"1911",name:"最大子序列交替和",slug:"maximum-alternating-subsequence-sum",difficulty:"中等",rating:1785,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/7/12",no:"2544",name:"交替数字和",slug:"alternating-digit-sum",difficulty:"简单",rating:1184,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/7/13",no:"931",name:"下降路径最小和",slug:"minimum-falling-path-sum",difficulty:"中等",rating:1573,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/7/14",no:"979",name:"在二叉树中分配硬币",slug:"distribute-coins-in-binary-tree",difficulty:"中等",rating:1709,situation:"看懂答案",method:"dfs",learn:"",unknown:""},{date:"2023/7/15",no:"18",name:"四数之和",slug:"4sum",difficulty:"中等",rating:null,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2023/7/16",no:"834",name:"树中距离之和",slug:"sum-of-distances-in-tree",difficulty:"困难",rating:2197,situation:"没看懂答案",method:"树形dp",learn:"",unknown:""},{date:"2023/7/17",no:"415",name:"字符串相加",slug:"add-strings",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/7/18",no:"1851",name:"包含每个查询的最小区间",slug:"minimum-interval-to-include-each-query",difficulty:"困难",rating:2286,situation:"没看懂答案",method:"优先级队列",learn:"",unknown:""},{date:"2023/7/19",no:"874",name:"模拟行走机器人",slug:"walking-robot-simulation",difficulty:"中等",rating:1846,situation:"看思路写出",method:"模拟+哈希表",learn:"",unknown:""},{date:"2023/7/20",no:"918",name:"环形子数组的最大和",slug:"maximum-sum-circular-subarray",difficulty:"中等",rating:1777,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/7/21",no:"1499",name:"满足不等式的最大值",slug:"max-value-of-equation",difficulty:"困难",rating:2456,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/7/22",no:"860",name:"柠檬水找零",slug:"lemonade-change",difficulty:"简单",rating:1285,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/7/23",no:"42",name:"接雨水",slug:"trapping-rain-water",difficulty:"困难",rating:null,situation:"看思路写出",method:"dp/单调栈/双指针",learn:"",unknown:""},{date:"2023/7/24",no:"771",name:"宝石与石头",slug:"jewels-and-stones",difficulty:"简单",rating:1164,situation:"自己做出",method:"哈希表/位运算",learn:"",unknown:""},{date:"2023/7/25",no:"771",name:"将数组和减半的最少操作次数",slug:"minimum-operations-to-halve-array-sum",difficulty:"中等",rating:1550,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/7/26",no:"2569",name:"更新数组后处理求和查询",slug:"handling-sum-queries-after-update",difficulty:"困难",rating:2397,situation:"没看懂答案",method:"线段树",learn:"",unknown:""},{date:"2023/7/27",no:"2500",name:"删除每行中的最大值",slug:"delete-greatest-value-in-each-row",difficulty:"简单",rating:1309,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/7/28",no:"2050",name:"并行课程 III",slug:"parallel-courses-iii",difficulty:"困难",rating:2084,situation:"看懂答案",method:"拓扑排序(+记忆化搜索)",learn:"",unknown:""},{date:"2023/7/29",no:"141",name:"环形链表",slug:"linked-list-cycle",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希表/快慢指针",learn:"",unknown:""},{date:"2023/7/30",no:"142",name:"环形链表 II",slug:"linked-list-cycle-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希表/快慢指针",learn:"",unknown:""},{date:"2023/7/31",no:"143",name:"重排链表",slug:"reorder-list",difficulty:"中等",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""}],[{date:"2023/8/1",no:"2681",name:"英雄的力量",slug:"power-of-heroes",difficulty:"困难",rating:2060,situation:"看思路写出",method:"动态规划/数学",learn:"BigInt",unknown:""},{date:"2023/8/2",no:"822",name:"翻转卡片游戏",slug:"card-flipping-game",difficulty:"中等",rating:1594,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2023/8/3",no:"722",name:"删除注释",slug:"remove-comments",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟/正则",learn:"正则技巧",unknown:""},{date:"2023/8/4",no:"980",name:"不同路径 III",slug:"unique-paths-iii",difficulty:"困难",rating:1830,situation:"自己做出",method:"回溯/ 状态压缩+记忆化搜索",learn:"",unknown:""},{date:"2023/8/5",no:"21",name:"合并两个有序链表",slug:"merge-two-sorted-lists",difficulty:"简单",rating:null,situation:"自己做出",method:"双指针/递归",learn:"",unknown:""},{date:"2023/8/6",no:"24",name:"两两交换链表中的节点",slug:"swap-nodes-in-pairs",difficulty:"中等",rating:null,situation:"自己做出",method:"双指针/递归",learn:"",unknown:""},{date:"2023/8/7",no:"344",name:"反转字符串",slug:"reverse-string",difficulty:"简单",rating:null,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/8/8",no:"1749",name:"反转字符串",slug:"任意子数组和的绝对值的最大值",difficulty:"中等",rating:1541,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/8/9",no:"1281",name:"整数的各位积和之差",slug:"subtract-the-product-and-sum-of-digits-of-an-integer",difficulty:"简单",rating:1141,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/10",no:"1289",name:"下降路径最小和 II",slug:"minimum-falling-path-sum-ii",difficulty:"困难",rating:1697,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/8/11",no:"1572",name:"矩阵对角线元素的和",slug:"matrix-diagonal-sum",difficulty:"简单",rating:1280,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/12",no:"23",name:"合并K个升序链表",slug:"merge-k-sorted-lists",difficulty:"困难",rating:null,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/8/13",no:"88",name:"合并两个有序数组",slug:"merge-sorted-array",difficulty:"简单",rating:null,situation:"自己做出",method:"排序/双指针",learn:"",unknown:""},{date:"2023/8/14",no:"617",name:"合并二叉树",slug:"merge-two-binary-trees",difficulty:"简单",rating:null,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/8/15",no:"833",name:"字符串中的查找与替换",slug:"find-and-replace-in-string",difficulty:"中等",rating:1460,situation:"自己做出",method:"排序/哈希表",learn:"",unknown:""},{date:"2023/8/16",no:"2682",name:"找出转圈游戏输家",slug:"find-the-losers-of-the-circular-game",difficulty:"简单",rating:1382,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/17",no:"1444",name:"切披萨的方案数",slug:"find-the-losers-of-the-circular-game",difficulty:"困难",rating:2126,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/8/18",no:"1388",name:"3n块披萨",slug:"pizza-with-3n-slices",difficulty:"困难",rating:2409,situation:"没看懂答案",method:"转化+dp",learn:"",unknown:""},{date:"2023/8/19",no:"2235",name:"两整数相加",slug:"add-two-integers",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/8/20",no:"2236",name:"判断根结点是否等于子结点之和",slug:"root-equals-sum-of-children",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/8/21",no:"2337",name:"移动片段得到字符串",slug:"move-pieces-to-obtain-a-string",difficulty:"中等",rating:1697,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/8/22",no:"849",name:"到最近的人的最大距离",slug:"maximize-distance-to-closest-person",difficulty:"中等",rating:1382,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/8/23",no:"1782",name:"统计点对的数目",slug:"count-pairs-of-nodes",difficulty:"困难",rating:2457,situation:"看懂答案",method:"转化+哈希表+排序+二分查找/双指针",learn:"",unknown:""},{date:"2023/8/24",no:"1267",name:"统计参与通信的服务器",slug:"count-servers-that-communicate",difficulty:"中等",rating:1374,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"2023/8/25",no:"1448",name:"统计二叉树中好节点的数目",slug:"count-good-nodes-in-binary-tree",difficulty:"中等",rating:1360,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/8/26",no:"228",name:"汇总区间",slug:"summary-ranges",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/8/27",no:"56",name:"合并区间",slug:"merge-intervals",difficulty:"中等",rating:null,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/8/28",no:"57",name:"插入区间",slug:"insert-interval",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/29",no:"823",name:"带因子的二叉树",slug:"binary-trees-with-factors",difficulty:"中等",rating:1899,situation:"自己做出",method:"数学+dp",learn:"",unknown:""},{date:"2023/8/30",no:"1654",name:"到家的最少跳跃次数",slug:"minimum-jumps-to-reach-home",difficulty:"中等",rating:2124,situation:"看思路写出",method:"bfs",learn:"",unknown:""},{date:"2023/8/31",no:"143",name:"重排链表",slug:"reorder-list",difficulty:"中等",rating:null,situation:"自己做出",method:"链表+（快慢指针）",learn:"",unknown:""}],[{date:"2023/9/1",no:"2240",name:"买钢笔和铅笔的方案数",slug:"number-of-ways-to-buy-pens-and-pencils",difficulty:"中等",rating:1399,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/9/2",no:"2511",name:"最多可以摧毁的敌人城堡数目",slug:"maximum-enemy-forts-that-can-be-captured",difficulty:"简单",rating:1450,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/9/3",no:"1921",name:"消灭怪物的最大数量",slug:"eliminate-maximum-number-of-monsters",difficulty:"中等",rating:1527,situation:"自己做出",method:"贪心+排序",learn:"",unknown:""},{date:"2023/9/4",no:"449",name:"序列化和反序列化二叉搜索树",slug:"serialize-and-deserialize-bst",difficulty:"中等",rating:null,situation:"自己做出",method:"中序遍历/后序遍历",learn:"",unknown:""},{date:"2023/9/5",no:"2605",name:"从两个数字数组里生成最小数字",slug:"form-smallest-number-from-two-digit-arrays",difficulty:"简单",rating:1241,situation:"自己做出",method:"哈希表/状态压缩",learn:"",unknown:""},{date:"2023/9/6",no:"1123",name:"最深叶节点的最近公共祖先",slug:"lowest-common-ancestor-of-deepest-leaves",difficulty:"中等",rating:1607,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2023/9/7",no:"2594",name:"修车的最少时间",slug:"minimum-time-to-repair-cars",difficulty:"中等",rating:1915,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/9/8",no:"2651",name:"计算列车到站时间",slug:"calculate-delayed-arrival-time",difficulty:"简单",rating:1168,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/9/9",no:"207",name:"课程表",slug:"course-schedule",difficulty:"中等",rating:null,situation:"自己做出",method:"拓扑排序",learn:"",unknown:""},{date:"2023/9/10",no:"210",name:"课程表 II",slug:"course-schedule-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"拓扑排序",learn:"",unknown:""},{date:"2023/9/11",no:"630",name:"课程表 III",slug:"course-schedule-iii",difficulty:"困难",rating:null,situation:"看懂答案",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2023/9/12",no:"1462",name:"课程表 IV",slug:"course-schedule-iv",difficulty:"中等",rating:1692,situation:"自己做出",method:"拓扑排序",learn:"",unknown:""},{date:"2023/9/13",no:"2596",name:"检查骑士巡视方案",slug:"check-knight-tour-configuration",difficulty:"中等",rating:1448,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/9/14",no:"1222",name:"可以攻击国王的皇后",slug:"queens-that-can-attack-the-king",difficulty:"中等",rating:1391,situation:"自己做出",method:"模拟+哈希",learn:"",unknown:""},{date:"2023/9/15",no:"LCP 50",name:"宝石补给",slug:"WHnhjV",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/9/16",no:"198",name:"打家劫舍",slug:"house-robber",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/9/17",no:"212",name:"打家劫舍 II",slug:"house-robber-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/9/18",no:"337",name:"打家劫舍 III",slug:"house-robber-iii",difficulty:"中等",rating:null,situation:"自己做出",method:"树形dp",learn:"",unknown:""},{date:"2023/9/19",no:"2560",name:"打家劫舍 IV",slug:"house-robber-iv",difficulty:"中等",rating:2081,situation:"看思路写出",method:"二分+ 贪心/dp",learn:"",unknown:""},{date:"2023/9/20",no:"LCP 06",name:"拿硬币",slug:"na-ying-bi",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/9/21",no:"2603",name:"收集树中金币",slug:"collect-coins-in-a-tree",difficulty:"困难",rating:2711,situation:"看懂答案",method:"转化+拓扑排序",learn:"",unknown:""},{date:"2023/9/22",no:"2591",name:"将钱分给最多的儿童",slug:"distribute-money-to-maximum-children",difficulty:"简单",rating:1530,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/9/23",no:"1993",name:"树上的操作",slug:"operations-on-tree",difficulty:"中等",rating:1861,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/9/24",no:"146",name:"LRU 缓存",slug:"lru-cache",difficulty:"中等",rating:null,situation:"自己做出",method:"双向链表+hash",learn:"复习LRU 缓存",unknown:""},{date:"2023/9/25",no:"460",name:"LFU 缓存",slug:"lfu-cache",difficulty:"困难",rating:null,situation:"看懂答案",method:"哈希",learn:"LFU缓存",unknown:""},{date:"2023/9/26",no:"2582",name:"递枕头",slug:"pass-the-pillow",difficulty:"简单",rating:1378,situation:"自己做出",method:"模拟（+数学）",learn:"",unknown:""},{date:"2023/9/27",no:"1333",name:"餐厅过滤器",slug:"filter-restaurants-by-vegan-friendly-price-and-distance",difficulty:"中等",rating:1423,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/9/28",no:"2251",name:"花期内花的数目",slug:"number-of-flowers-in-full-bloom",difficulty:"困难",rating:2022,situation:"自己做出",method:"线段树/ 差分数组+离线查询 / 排序+二分",learn:"",unknown:"差分数组+离线查询"},{date:"2023/9/29",no:"605",name:"种花问题",slug:"can-place-flowers",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/9/30",no:"2136",name:"全部开花的最早一天",slug:"earliest-possible-day-of-full-bloom",difficulty:"困难",rating:2033,situation:"自己做出",method:"贪心+排序",learn:"",unknown:""}],[{date:"2023/10/1",no:"121",name:"买卖股票的最佳时机",slug:"best-time-to-buy-and-sell-stock",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/10/2",no:"122",name:"买卖股票的最佳时机 II",slug:"best-time-to-buy-and-sell-stock-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"dp/贪心",learn:"",unknown:""},{date:"2023/10/3",no:"123",name:"买卖股票的最佳时机 III",slug:"best-time-to-buy-and-sell-stock-iii",difficulty:"困难",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/4",no:"188",name:"买卖股票的最佳时机 IV",slug:"best-time-to-buy-and-sell-stock-iv",difficulty:"困难",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/5",no:"309",name:"买卖股票的最佳时机含冷冻期",slug:"best-time-to-buy-and-sell-stock-with-cooldown",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/6",no:"714",name:"买卖股票的最佳时机含手续费",slug:"best-time-to-buy-and-sell-stock-with-transaction-fee",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/7",no:"901",name:"股票价格跨度",slug:"online-stock-span",difficulty:"中等",rating:1708,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2023/10/8",no:"2034",name:"股票价格波动",slug:"stock-price-fluctuation",difficulty:"中等",rating:1831,situation:"看懂答案",method:"哈希+ 优先级队列/有序集合",learn:"",unknown:""},{date:"2023/10/9",no:"2578",name:"最小和分割",slug:"split-with-minimum-sum",difficulty:"简单",rating:1350,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/10/10",no:"2731",name:"移动机器人",slug:"movement-of-robots",difficulty:"中等",rating:1922,situation:"看懂答案",method:"转化+排序+数学",learn:"",unknown:""},{date:"2023/10/11",no:"2512",name:"奖励最顶尖的 K 名学生",slug:"reward-top-k-students",difficulty:"中等",rating:1636,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/10/12",no:"2562",name:"找出数组的串联值",slug:"find-the-array-concatenation-value",difficulty:"简单",rating:1259,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/13",no:"1488",name:"避免洪水泛滥",slug:"find-the-array-concatenation-value",difficulty:"中等",rating:1973,situation:"看思路写出",method:"贪心+二分/优先级队列",learn:"",unknown:""},{date:"2023/10/14",no:"136",name:"只出现一次的数字",slug:"single-number",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希/异或",learn:"",unknown:""},{date:"2023/10/15",no:"137",name:"只出现一次的数字 II",slug:"single-number-ii",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希/位运算",learn:"位运算计数",unknown:""},{date:"2023/10/16",no:"260",name:"只出现一次的数字 III",slug:"single-number-iii",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希/位运算",learn:"位运算计数",unknown:""},{date:"2023/10/17",no:"2652",name:"倍数求和",slug:"sum-multiples",difficulty:"简单",rating:1182,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/10/18",no:"2530",name:"执行 K 次操作后的最大分数",slug:"maximal-score-after-applying-k-operations",difficulty:"简单",rating:1386,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/10/19",no:"1726",name:"同积元组",slug:"tuple-with-same-product",difficulty:"中等",rating:1530,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/10/20",no:"2525",name:"根据规则将箱子分类",slug:"categorize-box-according-to-criteria",difficulty:"中等",rating:1301,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/21",no:"2316",name:"统计无向图中无法互相到达点对数",slug:"count-unreachable-pairs-of-nodes-in-an-undirected-graph",difficulty:"中等",rating:1604,situation:"自己做出",method:"并查集/dfs",learn:"",unknown:""},{date:"2023/10/22",no:"1402",name:"做菜顺序",slug:"reducing-dishes",difficulty:"困难",rating:1679,situation:"自己做出",method:"dp/贪心",learn:"",unknown:""},{date:"2023/10/23",no:"2678",name:"老人的数目",slug:"number-of-senior-citizens",difficulty:"简单",rating:1198,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/24",no:"1155",name:"掷骰子等于目标和的方法数",slug:"number-of-dice-rolls-with-target-sum",difficulty:"中等",rating:1653,situation:"自己做出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/10/25",no:"2698",name:"求一个整数的惩罚数",slug:"find-the-punishment-number-of-an-integer",difficulty:"中等",rating:1678,situation:"自己做出",method:"回溯",learn:"",unknown:""},{date:"2023/10/26",no:"2520",name:"统计能整除数字的位数",slug:"count-the-digits-that-divide-a-number",difficulty:"简单",rating:1260,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/27",no:"1465",name:"切割后面积最大的蛋糕",slug:"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",difficulty:"中等",rating:1444,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/10/28",no:"2558",name:"从数量最多的堆取走礼物",slug:"take-gifts-from-the-richest-pile",difficulty:"简单",rating:1276,situation:"自己做出",method:"堆",learn:"",unknown:""},{date:"2023/10/29",no:"274",name:"H指数",slug:"h-index",difficulty:"简单",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/10/30",no:"275",name:"H指数 II",slug:"h-index-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:"另一种二分写法"},{date:"2023/10/31",no:"2003",name:"每棵子树内缺失的最小基因值",slug:"smallest-missing-genetic-value-in-each-subtree",difficulty:"困难",rating:2415,situation:"没看懂答案",method:"dfs+（启发式合并）",learn:"",unknown:""}],[{date:"2023/11/1",no:"2127",name:"参加会议的最多员工数",slug:"maximum-employees-to-be-invited-to-a-meeting",difficulty:"困难",rating:2449,situation:"自己做出",method:"分类讨论+拓扑排序",learn:"",unknown:""},{date:"2023/11/2",no:"2103",name:"环和杆",slug:"rings-and-rods",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/11/3",no:"117",name:"填充每个节点的下一个右侧节点指针 II",slug:"populating-next-right-pointers-in-each-node-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/11/4",no:"421",name:"数组中两个数的最大异或值",slug:"maximum-xor-of-two-numbers-in-an-array",difficulty:"中等",rating:null,situation:"看懂答案",method:"哈希/字典树",learn:"异或题可以多往答案的每一位思考，想想字典树",unknown:""},{date:"2023/11/5",no:"187",name:"重复的DNA序列",slug:"repeated-dna-sequences",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希（+状态压缩）",learn:"",unknown:""},{date:"2023/11/6",no:"318",name:"最大单词长度乘积",slug:"maximum-product-of-word-lengths",difficulty:"中等",rating:null,situation:"自己做出",method:"位运算",learn:"",unknown:""},{date:"2023/11/7",no:"2586",name:"统计范围内的元音字符串数",slug:"count-the-number-of-vowel-strings-in-range",difficulty:"简单",rating:1178,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/11/8",no:"2609",name:"最长平衡子字符串",slug:"find-the-longest-balanced-substring-of-a-binary-string",difficulty:"简单",rating:1348,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/11/9",no:"2258",name:"逃离火灾",slug:"find-the-longest-balanced-substring-of-a-binary-string",difficulty:"困难",rating:2346,situation:"自己做出",method:"bfs（+二分查找）",learn:"",unknown:""},{date:"2023/11/10",no:"2300",name:"咒语和药水的成功对数",slug:"successful-pairs-of-spells-and-potions",difficulty:"中等",rating:1476,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/11/11",no:"765",name:"情侣牵手",slug:"couples-holding-hands",difficulty:"困难",rating:1999,situation:"看懂答案",method:"并查集",learn:"从数组到节点的方式",unknown:""},{date:"2023/11/12",no:"715",name:"Range模块",slug:"range-module",difficulty:"困难",rating:null,situation:"看懂答案",method:"有序集合/线段树",learn:"复习线段树",unknown:""},{date:"2023/11/13",no:"307",name:"区域和检索 - 数组可修改",slug:"range-sum-query-mutable",difficulty:"中等",rating:null,situation:"看懂答案",method:"树状数组/线段树",learn:"复习线段树",unknown:""},{date:"2023/11/14",no:"1334",name:"阈值距离内邻居最少的城市",slug:"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",difficulty:"中等",rating:1854,situation:"自己做出",method:"bfs/floyd/dijkstra",learn:"",unknown:""},{date:"2023/11/15",no:"2656",name:"K 个元素的最大和",slug:"maximum-sum-with-exactly-k-elements",difficulty:"简单",rating:1213,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/11/16",no:"2760",name:"最长奇偶子数组",slug:"longest-even-odd-subarray-with-threshold",difficulty:"简单",rating:1420,situation:"自己做出",method:"枚举/dp",learn:"",unknown:""},{date:"2023/11/17",no:"2736",name:"最大和查询",slug:"maximum-sum-queries",difficulty:"困难",rating:2533,situation:"看懂答案",method:"单调栈+二分查找",learn:"",unknown:""},{date:"2023/11/18",no:"2342",name:"数位和相等数对的最大和",slug:"max-sum-of-a-pair-with-equal-sum-of-digits",difficulty:"中等",rating:1308,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/11/19",no:"689",name:"三个无重叠子数组的最大和",slug:"maximum-sum-of-3-non-overlapping-subarrays",difficulty:"困难",rating:null,situation:"没看懂答案",method:"滑动窗口/dp",learn:"",unknown:""},{date:"2023/11/20",no:"53",name:"最大子数组和",slug:"maximum-subarray",difficulty:"中等",rating:null,situation:"自己做出",method:"dp/分治",learn:"",unknown:""},{date:"2023/11/21",no:"2216",name:"最大子数组和",slug:"minimum-deletions-to-make-array-beautiful",difficulty:"中等",rating:1509,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/11/22",no:"2304",name:"网格中的最小路径代价",slug:"minimum-path-cost-in-a-grid",difficulty:"中等",rating:1658,situation:"自己做出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/11/23",no:"1410",name:"HTML 实体解析器",slug:"html-entity-parser",difficulty:"中等",rating:1405,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/11/24",no:"2824",name:"统计和小于目标的下标对数目",slug:"count-pairs-whose-sum-is-less-than-target",difficulty:"简单",rating:1165,situation:"自己做出",method:"二分/双指针",learn:"",unknown:""},{date:"2023/11/25",no:"1457",name:"二叉树中的伪回文路径",slug:"pseudo-palindromic-paths-in-a-binary-tree",difficulty:"中等",rating:1405,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/11/26",no:"828",name:"统计子串中的唯一字符",slug:"count-unique-characters-of-all-substrings-of-a-given-string",difficulty:"困难",rating:2034,situation:"自己做出",method:"贡献法",learn:"",unknown:""},{date:"2023/11/27",no:"907",name:"子数组的最小值之和",slug:"sum-of-subarray-minimums",difficulty:"中等",rating:1975,situation:"自己做出",method:"贡献法+单调栈/dp",learn:"",unknown:""},{date:"2023/11/28",no:"1670",name:"设计前中后队列",slug:"design-front-middle-back-queue",difficulty:"中等",rating:1610,situation:"自己做出",method:"双端队列/模拟",learn:"",unknown:""},{date:"2023/11/29",no:"2336",name:"无限集中的最小数字",slug:"smallest-number-in-infinite-set",difficulty:"中等",rating:1375,situation:"自己做出",method:"模拟/优先级队列",learn:"",unknown:""},{date:"2023/11/30",no:"1657",name:"确定两个字符串是否接近",slug:"determine-if-two-strings-are-close",difficulty:"中等",rating:1530,situation:"自己做出",method:"计数",learn:"",unknown:""}],[{date:"2023/12/1",no:"2661",name:"无限集中的最小数字",slug:"first-completely-painted-row-or-column",difficulty:"中等",rating:1502,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/12/2",no:"2661",name:"拼车",slug:"car-pooling",difficulty:"中等",rating:1441,situation:"自己做出",method:"差分",learn:"",unknown:""},{date:"2023/12/3",no:"1423",name:"可获得的最大点数",slug:"maximum-points-you-can-obtain-from-cards",difficulty:"中等",rating:1573,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/12/4",no:"1038",name:"可获得的最大点数",slug:"binary-search-tree-to-greater-sum-tree",difficulty:"中等",rating:1374,situation:"自己做出",method:"morris遍历/逆序中序遍历",learn:"",unknown:"morris遍历"},{date:"2023/12/5",no:"2477",name:"到达首都的最少油耗",slug:"minimum-fuel-cost-to-report-to-the-capital",difficulty:"中等",rating:2011,situation:"看懂答案",method:"贪心+dfs",learn:"",unknown:""},{date:"2023/12/6",no:"2646",name:"最小化旅行的价格总和",slug:"minimize-the-total-price-of-the-trips",difficulty:"困难",rating:2238,situation:"没看懂答案",method:"dfs+dp",learn:"",unknown:""},{date:"2023/12/7",no:"1466",name:"重新规划路线",slug:"reorder-routes-to-make-all-paths-lead-to-the-city-zero",difficulty:"中等",rating:1633,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/12/8",no:"2008",name:"出租车的最大盈利",slug:"reorder-routes-to-make-all-paths-lead-to-the-city-zero",difficulty:"中等",rating:1871,situation:"自己做出",method:"dp+二分",learn:"",unknown:""},{date:"2023/12/9",no:"2048",name:"下一个更大的数值平衡数",slug:"next-greater-numerically-balanced-number",difficulty:"中等",rating:1734,situation:"自己做出",method:"枚举",learn:"",unknown:""},{date:"2023/12/10",no:"70",name:"爬楼梯",slug:"climbing-stairs",difficulty:"简单",rating:null,situation:"自己做出",method:"dp/矩阵快速幂",learn:"",unknown:""},{date:"2023/12/11",no:"1631",name:"最小体力消耗路径",slug:"path-with-minimum-effort",difficulty:"简单",rating:1947,situation:"自己做出",method:"二分查找+bfs / 并查集 / 迪杰斯特拉算法",learn:"",unknown:"迪杰斯特拉算法"},{date:"2023/12/12",no:"2454",name:"下一个更大元素 IV",slug:"next-greater-element-iv",difficulty:"困难",rating:2175,situation:"看懂答案",method:"单调栈（+优先级队列）",learn:"",unknown:""},{date:"2023/12/13",no:"2697",name:"字典序最小回文串",slug:"lexicographically-smallest-palindrome",difficulty:"简单",rating:1303,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/12/14",no:"2132",name:"用邮票贴满网格图",slug:"stamping-the-grid",difficulty:"困难",rating:2364,situation:"没看懂答案",method:"二维前缀和+二维差分",learn:"",unknown:""},{date:"2023/12/15",no:"2415",name:"反转二叉树的奇数层",slug:"reverse-odd-levels-of-binary-tree",difficulty:"困难",rating:1431,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/12/16",no:"2276",name:"统计区间中的整数数目",slug:"count-integers-in-intervals",difficulty:"困难",rating:2222,situation:"自己做出",method:"平衡二叉搜索树/线段树",learn:"复习线段树",unknown:""},{date:"2023/12/17",no:"746",name:"使用最小花费爬楼梯",slug:"min-cost-climbing-stairs",difficulty:"简单",rating:1358,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/12/18",no:"162",name:"寻找峰值",slug:"find-peak-element",difficulty:"简单",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/12/19",no:"1901",name:"寻找峰值 II",slug:"find-a-peak-element-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:"二分方法"},{date:"2023/12/20",no:"2828",name:"判别首字母缩略词",slug:"check-if-a-string-is-an-acronym-of-words",difficulty:"简单",rating:1151,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/12/21",no:"2866",name:"美丽塔 II",slug:"beautiful-towers-ii",difficulty:"中等",rating:2071,situation:"看懂答案",method:"单调栈",learn:"",unknown:""},{date:"2023/12/22",no:"1671",name:"得到山形数组的最少删除次数",slug:"minimum-number-of-removals-to-make-mountain-array",difficulty:"困难",rating:1912,situation:"没看懂答案",method:"dp/二分查找",learn:"",unknown:""},{date:"2023/12/23",no:"1962",name:"移除石子使总数最小",slug:"remove-stones-to-minimize-the-total",difficulty:"中等",rating:1418,situation:"自己做出",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2023/12/24",no:"1954",name:"收集足够苹果的最小花园周长",slug:"minimum-garden-perimeter-to-collect-enough-apples",difficulty:"中等",rating:1758,situation:"自己做出",method:"数学（+二分）",learn:"",unknown:""},{date:"2023/12/25",no:"1276",name:"收集足够苹果的最小花园周长",slug:"number-of-burgers-with-no-waste-of-ingredients",difficulty:"中等",rating:1386,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/12/26",no:"1349",name:"参加考试的最大学生数",slug:"maximum-students-taking-exam",difficulty:"困难",rating:2385,situation:"没看懂答案",method:"状态压缩+记忆化搜索/dp/ 网络流",learn:"",unknown:"dinic"},{date:"2023/12/27",no:"2660",name:"保龄球游戏的获胜者",slug:"determine-the-winner-of-a-bowling-game",difficulty:"简单",rating:1324,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/12/28",no:"2735",name:"收集巧克力",slug:"collecting-chocolates",difficulty:"中等",rating:2043,situation:"自己做出",method:"模拟/二次差分",learn:"",unknown:"二次差分"},{date:"2023/12/29",no:"2706",name:"购买两块巧克力",slug:"buy-two-chocolates",difficulty:"简单",rating:1207,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/12/30",no:"1185",name:"一周中的第几天",slug:"day-of-the-week",difficulty:"简单",rating:1382,situation:"自己做出",method:"模拟/蔡勒公式",learn:"复习蔡勒公式",unknown:""},{date:"2023/12/31",no:"1154",name:"一年中的第几天",slug:"day-of-the-year",difficulty:"简单",rating:1199,situation:"自己做出",method:"模拟",learn:"",unknown:""}]]},dae={situations:[[{type:"自己做出",value:26},{type:"看思路写出",value:0},{type:"看懂答案",value:2},{type:"没看懂答案",value:3}],[{type:"自己做出",value:23},{type:"看思路写出",value:0},{type:"看懂答案",value:3},{type:"没看懂答案",value:2}],[{type:"自己做出",value:24},{type:"看思路写出",value:1},{type:"看懂答案",value:5},{type:"没看懂答案",value:1}],[{type:"自己做出",value:22},{type:"看思路写出",value:2},{type:"看懂答案",value:2},{type:"没看懂答案",value:4}]],difficulty:[]},BB={daily:cae,statistics:dae},fae={month:[[{date:"2022/1/1",no:"605",name:"将一维数组转变为二维数组",difficulty:"简单",situation:"自己做出",method:null,learn:null,unknown:""},{date:"2022/1/2",no:"390",name:"消除游戏",difficulty:"中等",situation:"CV后看懂",method:"转化+数学",learn:null,unknown:""},{date:"2022/1/3",no:"1185",name:"一周中的第几天",difficulty:"简单",situation:"自己做出",method:null,learn:"Zeller公式",unknown:""},{date:"2022/1/4",no:"913",name:"猫和老鼠",difficulty:"困难",situation:"CV后没看懂",method:"dp",learn:null,unknown:""},{date:"2022/1/5",no:"1576",name:"替换所有的问号",difficulty:"简单",situation:"自己做出",method:null,learn:null,unknown:""},{date:"2022/1/6",no:"71",name:"简化路径",difficulty:"中等",situation:"自己做出",method:"栈",learn:null,unknown:""},{date:"2022/1/7",no:"1614",name:"括号的最大嵌套深度",difficulty:"简单",situation:"自己做出",method:"栈",learn:null,unknown:""},{date:"2022/1/8",no:"89",name:"格雷编码",difficulty:"中等",situation:"CV后看懂",method:"位运算/找规律",learn:"格雷码公式ans[i]=(1<0&&a[a.length-1])&&(u[0]===6||u[0]===2)){t=0;continue}if(u[0]===3&&(!a||u[1]>a[0]&&u[1]=e.length&&(e=void 0),{value:e&&e[r++],done:!e}}};throw new TypeError(n?"Object is not iterable.":"Symbol.iterator is not defined.")}function We(e,n){var t=typeof Symbol=="function"&&e[Symbol.iterator];if(!t)return e;var r=t.call(e),i,a=[],o;try{for(;(n===void 0||n-- >0)&&!(i=r.next()).done;)a.push(i.value)}catch(l){o={error:l}}finally{try{i&&!i.done&&(t=r.return)&&t.call(r)}finally{if(o)throw o.error}}return a}function bh(){for(var e=0,n=0,t=arguments.length;n-1:!1},Or=function(e,n){if(!Gi(e))return e;for(var t=[],r=0;ra[l])return 1;if(i[l]t?t:e},v1=function(e,n){var t=n.toString(),r=t.indexOf(".");if(r===-1)return Math.round(e);var i=t.substr(r+1).length;return i>20&&(i=20),parseFloat(e.toFixed(i))},pt=function(e){return ls(e,"Number")},Sae=1e-5;function Er(e,n,t){return t===void 0&&(t=Sae),Math.abs(e-n)r&&(t=a,r=o)}return t}},Cae=function(e,n){if(ge(e)){for(var t,r=1/0,i=0;in?(r&&(clearTimeout(r),r=null),l=c,o=e.apply(i,a),r||(i=a=null)):!r&&t.trailing!==!1&&(r=setTimeout(s,d)),o};return u.cancel=function(){clearTimeout(r),l=0,r=i=a=null},u},Nae=function(e){return Gi(e)?Array.prototype.slice.call(e):[]};var sg={};const ss=function(e){return e=e||"g",sg[e]?sg[e]+=1:sg[e]=1,e+sg[e]},Il=function(){};function vr(e){return ve(e)?0:Gi(e)?e.length:Object.keys(e).length}var ug;const cg=xd(function(e,n){n===void 0&&(n={});var t=n.fontSize,r=n.fontFamily,i=n.fontWeight,a=n.fontStyle,o=n.fontVariant;return ug||(ug=document.createElement("canvas").getContext("2d")),ug.font=[a,o,i,t+"px",r].join(" "),ug.measureText(ct(e)?e:"").width},function(e,n){return n===void 0&&(n={}),bh([e],r0(n)).join("")}),Bae=function(e,n,t,r){r===void 0&&(r="...");var i=16,a=cg(r,t),o=ct(e)?e:dv(e),l=n,s=[],u,c;if(cg(e,t)<=n)return e;for(;u=o.substr(0,i),c=cg(u,t),!(c+a>l&&c>l);)if(s.push(u),l-=c,o=o.substr(i),!o)return s.join("");for(;u=o.substr(0,1),c=cg(u,t),!(c+a>l);)if(s.push(u),l-=c,o=o.substr(1),!o)return s.join("");return""+s.join("")+r};var zae=function(){function e(){this.map={}}return e.prototype.has=function(n){return this.map[n]!==void 0},e.prototype.get=function(n,t){var r=this.map[n];return r===void 0?t:r},e.prototype.set=function(n,t){this.map[n]=t},e.prototype.clear=function(){this.map={}},e.prototype.delete=function(n){delete this.map[n]},e.prototype.size=function(){return Object.keys(this.map).length},e}(),_n;(function(e){e.FORE="fore",e.MID="mid",e.BG="bg"})(_n||(_n={}));var $e;(function(e){e.TOP="top",e.TOP_LEFT="top-left",e.TOP_RIGHT="top-right",e.RIGHT="right",e.RIGHT_TOP="right-top",e.RIGHT_BOTTOM="right-bottom",e.LEFT="left",e.LEFT_TOP="left-top",e.LEFT_BOTTOM="left-bottom",e.BOTTOM="bottom",e.BOTTOM_LEFT="bottom-left",e.BOTTOM_RIGHT="bottom-right",e.RADIUS="radius",e.CIRCLE="circle",e.NONE="none"})($e||($e={}));var fr;(function(e){e.AXIS="axis",e.GRID="grid",e.LEGEND="legend",e.TOOLTIP="tooltip",e.ANNOTATION="annotation",e.SLIDER="slider",e.SCROLLBAR="scrollbar",e.OTHER="other"})(fr||(fr={}));var Ec={FORE:3,MID:2,BG:1},Ot;(function(e){e.BEFORE_RENDER="beforerender",e.AFTER_RENDER="afterrender",e.BEFORE_PAINT="beforepaint",e.AFTER_PAINT="afterpaint",e.BEFORE_CHANGE_DATA="beforechangedata",e.AFTER_CHANGE_DATA="afterchangedata",e.BEFORE_CLEAR="beforeclear",e.AFTER_CLEAR="afterclear",e.BEFORE_DESTROY="beforedestroy",e.BEFORE_CHANGE_SIZE="beforechangesize",e.AFTER_CHANGE_SIZE="afterchangesize"})(Ot||(Ot={}));var Bl;(function(e){e.BEFORE_DRAW_ANIMATE="beforeanimate",e.AFTER_DRAW_ANIMATE="afteranimate",e.BEFORE_RENDER_LABEL="beforerenderlabel",e.AFTER_RENDER_LABEL="afterrenderlabel"})(Bl||(Bl={}));var fi;(function(e){e.MOUSE_ENTER="plot:mouseenter",e.MOUSE_DOWN="plot:mousedown",e.MOUSE_MOVE="plot:mousemove",e.MOUSE_UP="plot:mouseup",e.MOUSE_LEAVE="plot:mouseleave",e.TOUCH_START="plot:touchstart",e.TOUCH_MOVE="plot:touchmove",e.TOUCH_END="plot:touchend",e.TOUCH_CANCEL="plot:touchcancel",e.CLICK="plot:click",e.DBLCLICK="plot:dblclick",e.CONTEXTMENU="plot:contextmenu",e.LEAVE="plot:leave",e.ENTER="plot:enter"})(fi||(fi={}));var xm;(function(e){e.ACTIVE="active",e.INACTIVE="inactive",e.SELECTED="selected",e.DEFAULT="default"})(xm||(xm={}));var cc=["color","shape","size"],sn="_origin",WO=1,GO=1,KO=.25,QB={};function _ae(e){var n=QB[e];if(!n)throw new Error("G engine '".concat(e,"' is not exist, please register it at first."));return n}function ZB(e,n){QB[e]=n}function Hu(e,n,t){if(e){if(typeof e.addEventListener=="function")return e.addEventListener(n,t,!1),{remove:function(){e.removeEventListener(n,t,!1)}};if(typeof e.attachEvent=="function")return e.attachEvent("on"+n,t),{remove:function(){e.detachEvent("on"+n,t)}}}}var lf,p1,JB,dw;function Hae(){lf=document.createElement("table"),p1=document.createElement("tr"),JB=/^\s*<(\w+|!)[^>]*>/,dw={tr:document.createElement("tbody"),tbody:lf,thead:lf,tfoot:lf,td:p1,th:p1,"*":document.createElement("div")}}function zl(e){lf||Hae();var n=JB.test(e)&&RegExp.$1;(!n||!(n in dw))&&(n="*");var t=dw[n];e=typeof e=="string"?e.replace(/(^\s*)|(\s*$)/g,""):e,t.innerHTML=""+e;var r=t.childNodes[0];return r&&t.contains(r)&&t.removeChild(r),r}function mi(e,n,t){var r;try{r=window.getComputedStyle?window.getComputedStyle(e,null)[n]:e.style[n]}catch{}finally{r=r===void 0?t:r}return r}function Vae(e,n){var t=mi(e,"height",n);return t==="auto"&&(t=e.offsetHeight),parseFloat(t)}function jae(e,n){var t=Vae(e,n),r=parseFloat(mi(e,"borderTopWidth"))||0,i=parseFloat(mi(e,"paddingTop"))||0,a=parseFloat(mi(e,"paddingBottom"))||0,o=parseFloat(mi(e,"borderBottomWidth"))||0,l=parseFloat(mi(e,"marginTop"))||0,s=parseFloat(mi(e,"marginBottom"))||0;return t+r+o+i+a+l+s}function Wae(e,n){var t=mi(e,"width",n);return t==="auto"&&(t=e.offsetWidth),parseFloat(t)}function Gae(e,n){var t=Wae(e,n),r=parseFloat(mi(e,"borderLeftWidth"))||0,i=parseFloat(mi(e,"paddingLeft"))||0,a=parseFloat(mi(e,"paddingRight"))||0,o=parseFloat(mi(e,"borderRightWidth"))||0,l=parseFloat(mi(e,"marginRight"))||0,s=parseFloat(mi(e,"marginLeft"))||0;return t+r+o+i+a+s+l}function Kr(e,n){if(e)for(var t in n)n.hasOwnProperty(t)&&(e.style[t]=n[t]);return e}function Kae(e){var n=getComputedStyle(e);return{width:(e.clientWidth||parseInt(n.width,10))-parseInt(n.paddingLeft,10)-parseInt(n.paddingRight,10),height:(e.clientHeight||parseInt(n.height,10))-parseInt(n.paddingTop,10)-parseInt(n.paddingBottom,10)}}function XO(e){return typeof e=="number"&&!isNaN(e)}function YO(e,n,t,r){var i=t,a=r;if(n){var o=Kae(e);i=o.width?o.width:i,a=o.height?o.height:a}return{width:Math.max(XO(i)?i:WO,WO),height:Math.max(XO(a)?a:GO,GO)}}function Xae(e){var n=e.parentNode;n&&n.removeChild(e)}var Yae="*",EE=function(){function e(){this._events={}}return e.prototype.on=function(n,t,r){return this._events[n]||(this._events[n]=[]),this._events[n].push({callback:t,once:!!r}),this},e.prototype.once=function(n,t){return this.on(n,t,!0)},e.prototype.emit=function(n){for(var t=this,r=[],i=1;i tr:last-child > td`]:{borderBottom:0,"&:first-child, &:last-child":{borderRadius:0}}}}},"> th":{position:"relative",color:f,fontWeight:t,textAlign:"start",background:v,borderBottom:b,transition:`background ${h} ease`}}},[`${n}-footer`]:{padding:`${Q(r)} ${Q(i)}`,color:m,background:p}})}},Xie=e=>{const{colorFillAlter:n,colorBgContainer:t,colorTextHeading:r,colorFillSecondary:i,colorFillContent:a,controlItemBgActive:o,controlItemBgActiveHover:l,padding:s,paddingSM:u,paddingXS:c,colorBorderSecondary:d,borderRadiusLG:f,controlHeight:h,colorTextPlaceholder:v,fontSize:g,fontSizeSM:m,lineHeight:p,lineWidth:x,colorIcon:b,colorIconHover:w,opacityLoading:S,controlInteractiveSize:C}=e,E=new yn(i).onBackground(t).toHexShortString(),k=new yn(a).onBackground(t).toHexShortString(),I=new yn(n).onBackground(t).toHexShortString(),$=new yn(b),T=new yn(w),P=C/2-x,F=P*2+x*3;return{headerBg:I,headerColor:r,headerSortActiveBg:E,headerSortHoverBg:k,bodySortBg:I,rowHoverBg:I,rowSelectedBg:o,rowSelectedHoverBg:l,rowExpandedBg:n,cellPaddingBlock:s,cellPaddingInline:s,cellPaddingBlockMD:u,cellPaddingInlineMD:c,cellPaddingBlockSM:c,cellPaddingInlineSM:c,borderColor:d,headerBorderRadius:f,footerBg:I,footerColor:r,cellFontSize:g,cellFontSizeMD:g,cellFontSizeSM:g,headerSplitColor:d,fixedHeaderSortActiveBg:E,headerFilterHoverBg:a,filterDropdownMenuBg:t,filterDropdownBg:t,expandIconBg:t,selectionColumnWidth:h,stickyScrollBarBg:v,stickyScrollBarBorderRadius:100,expandIconMarginTop:(g*p-x*3)/2-Math.ceil((m*1.4-x*3)/2),headerIconColor:$.clone().setAlpha($.getAlpha()*S).toRgbString(),headerIconHoverColor:T.clone().setAlpha(T.getAlpha()*S).toRgbString(),expandIconHalfInner:P,expandIconSize:F,expandIconScale:C/F}},Yie=_r("Table",e=>{const{colorTextHeading:n,colorSplit:t,colorBgContainer:r,controlInteractiveSize:i,headerBg:a,headerColor:o,headerSortActiveBg:l,headerSortHoverBg:s,bodySortBg:u,rowHoverBg:c,rowSelectedBg:d,rowSelectedHoverBg:f,rowExpandedBg:h,cellPaddingBlock:v,cellPaddingInline:g,cellPaddingBlockMD:m,cellPaddingInlineMD:p,cellPaddingBlockSM:x,cellPaddingInlineSM:b,borderColor:w,footerBg:S,footerColor:C,headerBorderRadius:E,cellFontSize:k,cellFontSizeMD:I,cellFontSizeSM:$,headerSplitColor:T,fixedHeaderSortActiveBg:P,headerFilterHoverBg:F,filterDropdownBg:L,expandIconBg:N,selectionColumnWidth:A,stickyScrollBarBg:R,calc:O}=e,B=2,D=fn(e,{tableFontSize:k,tableBg:r,tableRadius:E,tablePaddingVertical:v,tablePaddingHorizontal:g,tablePaddingVerticalMiddle:m,tablePaddingHorizontalMiddle:p,tablePaddingVerticalSmall:x,tablePaddingHorizontalSmall:b,tableBorderColor:w,tableHeaderTextColor:o,tableHeaderBg:a,tableFooterTextColor:C,tableFooterBg:S,tableHeaderCellSplitColor:T,tableHeaderSortBg:l,tableHeaderSortHoverBg:s,tableBodySortBg:u,tableFixedHeaderSortActiveBg:P,tableHeaderFilterActiveBg:F,tableFilterDropdownBg:L,tableRowHoverBg:c,tableSelectedRowBg:d,tableSelectedRowHoverBg:f,zIndexTableFixed:B,zIndexTableSticky:B+1,tableFontSizeMiddle:I,tableFontSizeSmall:$,tableSelectionColumnWidth:A,tableExpandIconBg:N,tableExpandColumnWidth:O(i).add(O(e.padding).mul(2)).equal(),tableExpandedRowBg:h,tableFilterDropdownWidth:120,tableFilterDropdownHeight:264,tableFilterDropdownSearchWidth:140,tableScrollThumbSize:8,tableScrollThumbBg:R,tableScrollThumbBgHover:n,tableScrollBg:t});return[Kie(D),Tie(D),jO(D),_ie(D),Mie(D),yie(D),Aie(D),Eie(D),jO(D),Sie(D),Die(D),$ie(D),Vie(D),bie(D),Bie(D),Fie(D),Gie(D)]},Xie,{unitless:{expandIconScale:!0}}),Uie=[],qie=(e,n)=>{var t,r;const{prefixCls:i,className:a,rootClassName:o,style:l,size:s,bordered:u,dropdownPrefixCls:c,dataSource:d,pagination:f,rowSelection:h,rowKey:v="key",rowClassName:g,columns:m,children:p,childrenColumnName:x,onChange:b,getPopupContainer:w,loading:S,expandIcon:C,expandable:E,expandedRowRender:k,expandIconColumnIndex:I,indentSize:$,scroll:T,sortDirections:P,locale:F,showSorterTooltip:L=!0,virtual:N}=e;dd();const A=y.useMemo(()=>m||fE(p),[m,p]),R=y.useMemo(()=>A.some(He=>He.responsive),[A]),O=V3(R),B=y.useMemo(()=>{const He=new Set(Object.keys(O).filter(Xe=>O[Xe]));return A.filter(Xe=>!Xe.responsive||Xe.responsive.some(gt=>He.has(gt)))},[A,O]),D=ci(e,["className","style","columns"]),{locale:H=ru,direction:j,table:G,renderEmpty:X,getPrefixCls:K,getPopupContainer:q}=y.useContext(Dt),ce=qa(s),ue=Object.assign(Object.assign({},H.Table),F),de=d||Uie,oe=K("table",i),U=K("dropdown",c),[,J]=$r(),ae=Ua(oe),[Z,ee,le]=Yie(oe,ae),he=Object.assign(Object.assign({childrenColumnName:x,expandIconColumnIndex:I},E),{expandIcon:(t=E==null?void 0:E.expandIcon)!==null&&t!==void 0?t:(r=G==null?void 0:G.expandable)===null||r===void 0?void 0:r.expandIcon}),{childrenColumnName:be="children"}=he,fe=y.useMemo(()=>de.some(He=>He==null?void 0:He[be])?"nest":k||E&&E.expandedRowRender?"row":null,[de]),re={body:y.useRef()},pe=_ne(oe),Oe=y.useRef(null),ye=y.useRef(null);Bne(n,()=>Object.assign(Object.assign({},ye.current),{nativeElement:Oe.current}));const Re=y.useMemo(()=>typeof v=="function"?v:He=>He==null?void 0:He[v],[v]),[qe]=eie(de,be,Re),ze={},Ke=function(He,Xe){let gt=arguments.length>2&&arguments[2]!==void 0?arguments[2]:!1;var zt,Ye,Ue;const lt=Object.assign(Object.assign({},ze),He);gt&&((zt=ze.resetPagination)===null||zt===void 0||zt.call(ze),!((Ye=lt.pagination)===null||Ye===void 0)&&Ye.current&&(lt.pagination.current=1),f&&f.onChange&&f.onChange(1,(Ue=lt.pagination)===null||Ue===void 0?void 0:Ue.pageSize)),T&&T.scrollToFirstRowOnChange!==!1&&re.body.current&&fG(0,{getContainer:()=>re.body.current}),b==null||b(lt.pagination,lt.filters,lt.sorter,{currentDataSource:ow(sw(de,lt.sorterStates,be),lt.filterStates,be),action:Xe})},rt=(He,Xe)=>{Ke({sorter:He,sorterStates:Xe},"sort",!1)},[Le,Ae,Ce,dt]=hie({prefixCls:oe,mergedColumns:B,onSorterChange:rt,sortDirections:P||["ascend","descend"],tableLocale:ue,showSorterTooltip:L}),Je=y.useMemo(()=>sw(de,Ae,be),[de,Ae]);ze.sorter=dt(),ze.sorterStates=Ae;const xt=(He,Xe)=>{Ke({filters:He,filterStates:Xe},"filter",!0)},[Qe,ot,et]=Jre({prefixCls:oe,locale:ue,dropdownPrefixCls:U,mergedColumns:B,onFilterChange:xt,getPopupContainer:w||q,rootClassName:ne(o,ae)}),vt=ow(Je,ot,be);ze.filters=et,ze.filterStates=ot;const bt=y.useMemo(()=>{const He={};return Object.keys(et).forEach(Xe=>{et[Xe]!==null&&(He[Xe]=et[Xe])}),Object.assign(Object.assign({},Ce),{filters:He})},[Ce,et]),[Pt]=vie(bt),Bt=(He,Xe)=>{Ke({pagination:Object.assign(Object.assign({},ze.pagination),{current:He,pageSize:Xe})},"paginate")},[Et,De]=rie(vt.length,Bt,f);ze.pagination=f===!1?{}:nie(Et,f),ze.resetPagination=De;const Ee=y.useMemo(()=>{if(f===!1||!Et.pageSize)return vt;const{current:He=1,total:Xe,pageSize:gt=PB}=Et;return vt.lengthgt?vt.slice((He-1)*gt,He*gt):vt:vt.slice((He-1)*gt,He*gt)},[!!f,vt,Et&&Et.current,Et&&Et.pageSize,Et&&Et.total]),[Te,xe]=Dne({prefixCls:oe,data:vt,pageData:Ee,getRowKey:Re,getRecordByKey:qe,expandType:fe,childrenColumnName:be,locale:ue,getPopupContainer:w||q},h),ke=(He,Xe,gt)=>{let zt;return typeof g=="function"?zt=ne(g(He,Xe,gt)):zt=ne(g),ne({[`${oe}-row-selected`]:xe.has(Re(He,Xe))},zt)};he.__PARENT_RENDER_ICON__=he.expandIcon,he.expandIcon=he.expandIcon||C||zne(ue),fe==="nest"&&he.expandIconColumnIndex===void 0?he.expandIconColumnIndex=h?1:0:he.expandIconColumnIndex>0&&h&&(he.expandIconColumnIndex-=1),typeof he.indentSize!="number"&&(he.indentSize=typeof $=="number"?$:15);const Ve=y.useCallback(He=>Pt(Te(Qe(Le(He)))),[Le,Qe,Te]);let je,Ne;if(f!==!1&&(Et!=null&&Et.total)){let He;Et.size?He=Et.size:He=ce==="small"||ce==="middle"?"small":void 0;const Xe=Ye=>y.createElement(Jee,Object.assign({},Et,{className:ne(`${oe}-pagination ${oe}-pagination-${Ye}`,Et.className),size:He})),gt=j==="rtl"?"left":"right",{position:zt}=Et;if(zt!==null&&Array.isArray(zt)){const Ye=zt.find(It=>It.includes("top")),Ue=zt.find(It=>It.includes("bottom")),lt=zt.every(It=>`${It}`=="none");!Ye&&!Ue&&!lt&&(Ne=Xe(gt)),Ye&&(je=Xe(Ye.toLowerCase().replace("top",""))),Ue&&(Ne=Xe(Ue.toLowerCase().replace("bottom","")))}else Ne=Xe(gt)}let Pe;typeof S=="boolean"?Pe={spinning:S}:typeof S=="object"&&(Pe=Object.assign({spinning:!0},S));const Ie=ne(le,ae,`${oe}-wrapper`,G==null?void 0:G.className,{[`${oe}-wrapper-rtl`]:j==="rtl"},a,o,ee),st=Object.assign(Object.assign({},G==null?void 0:G.style),l),kt=F&&F.emptyText||(X==null?void 0:X("Table"))||y.createElement(N3,{componentName:"Table"}),At=N?pie:gie,jt={},Mt=y.useMemo(()=>{const{fontSize:He,lineHeight:Xe,padding:gt,paddingXS:zt,paddingSM:Ye}=J,Ue=Math.floor(He*Xe);switch(ce){case"large":return gt*2+Ue;case"small":return zt*2+Ue;default:return Ye*2+Ue}},[J,ce]);return N&&(jt.listItemHeight=Mt),Z(y.createElement("div",{ref:Oe,className:Ie,style:st},y.createElement(ste,Object.assign({spinning:!1},Pe),je,y.createElement(At,Object.assign({},jt,D,{ref:ye,columns:B,direction:j,expandable:he,prefixCls:oe,className:ne({[`${oe}-middle`]:ce==="middle",[`${oe}-small`]:ce==="small",[`${oe}-bordered`]:u,[`${oe}-empty`]:de.length===0},le,ae,ee),data:Ee,rowKey:Re,rowClassName:ke,emptyText:kt,internalHooks:uv,internalRefs:re,transformColumns:Ve,getContainerWidth:pe})),Ne)))},Qie=y.forwardRef(qie),Zie=(e,n)=>{const t=y.useRef(0);return t.current+=1,y.createElement(Qie,Object.assign({},e,{ref:n,_renderTimes:t.current}))},il=y.forwardRef(Zie);il.SELECTION_COLUMN=dl;il.EXPAND_COLUMN=gl;il.SELECTION_ALL=tw;il.SELECTION_INVERT=nw;il.SELECTION_NONE=rw;il.Column=kne;il.ColumnGroup=Mne;il.Summary=lB;const FB=il,Jie=e=>{const{paddingXXS:n,lineWidth:t,tagPaddingHorizontal:r,componentCls:i,calc:a}=e,o=a(r).sub(t).equal(),l=a(n).sub(t).equal();return{[i]:Object.assign(Object.assign({},Ln(e)),{display:"inline-block",height:"auto",marginInlineEnd:e.marginXS,paddingInline:o,fontSize:e.tagFontSize,lineHeight:e.tagLineHeight,whiteSpace:"nowrap",background:e.defaultBg,border:`${Q(e.lineWidth)} ${e.lineType} ${e.colorBorder}`,borderRadius:e.borderRadiusSM,opacity:1,transition:`all ${e.motionDurationMid}`,textAlign:"start",position:"relative",[`&${i}-rtl`]:{direction:"rtl"},"&, a, a:hover":{color:e.defaultColor},[`${i}-close-icon`]:{marginInlineStart:l,fontSize:e.tagIconSize,color:e.colorTextDescription,cursor:"pointer",transition:`all ${e.motionDurationMid}`,"&:hover":{color:e.colorTextHeading}},[`&${i}-has-color`]:{borderColor:"transparent",[`&, a, a:hover, ${e.iconCls}-close, ${e.iconCls}-close:hover`]:{color:e.colorTextLightSolid}},"&-checkable":{backgroundColor:"transparent",borderColor:"transparent",cursor:"pointer",[`&:not(${i}-checkable-checked):hover`]:{color:e.colorPrimary,backgroundColor:e.colorFillSecondary},"&:active, &-checked":{color:e.colorTextLightSolid},"&-checked":{backgroundColor:e.colorPrimary,"&:hover":{backgroundColor:e.colorPrimaryHover}},"&:active":{backgroundColor:e.colorPrimaryActive}},"&-hidden":{display:"none"},[`> ${e.iconCls} + span, > span + ${e.iconCls}`]:{marginInlineStart:o}}),[`${i}-borderless`]:{borderColor:"transparent",background:e.tagBorderlessBg}}},xE=e=>{const{lineWidth:n,fontSizeIcon:t,calc:r}=e,i=e.fontSizeSM;return fn(e,{tagFontSize:i,tagLineHeight:Q(r(e.lineHeightSM).mul(i).equal()),tagIconSize:r(t).sub(r(n).mul(2)).equal(),tagPaddingHorizontal:8,tagBorderlessBg:e.colorFillTertiary})},bE=e=>({defaultBg:new yn(e.colorFillQuaternary).onBackground(e.colorBgContainer).toHexString(),defaultColor:e.colorText}),LB=_r("Tag",e=>{const n=xE(e);return Jie(n)},bE);var eae=globalThis&&globalThis.__rest||function(e,n){var t={};for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&n.indexOf(r)<0&&(t[r]=e[r]);if(e!=null&&typeof Object.getOwnPropertySymbols=="function")for(var i=0,r=Object.getOwnPropertySymbols(e);i{const{prefixCls:t,style:r,className:i,checked:a,onChange:o,onClick:l}=e,s=eae(e,["prefixCls","style","className","checked","onChange","onClick"]),{getPrefixCls:u,tag:c}=y.useContext(Dt),d=p=>{o==null||o(!a),l==null||l(p)},f=u("tag",t),[h,v,g]=LB(f),m=ne(f,`${f}-checkable`,{[`${f}-checkable-checked`]:a},c==null?void 0:c.className,i,v,g);return h(y.createElement("span",Object.assign({},s,{ref:n,style:Object.assign(Object.assign({},r),c==null?void 0:c.style),className:m,onClick:d})))}),nae=tae,rae=e=>BD(e,(n,t)=>{let{textColor:r,lightBorderColor:i,lightColor:a,darkColor:o}=t;return{[`${e.componentCls}${e.componentCls}-${n}`]:{color:r,background:a,borderColor:i,"&-inverse":{color:e.colorTextLightSolid,background:o,borderColor:o},[`&${e.componentCls}-borderless`]:{borderColor:"transparent"}}}}),iae=$y(["Tag","preset"],e=>{const n=xE(e);return rae(n)},bE);function aae(e){return typeof e!="string"?e:e.charAt(0).toUpperCase()+e.slice(1)}const lg=(e,n,t)=>{const r=aae(t);return{[`${e.componentCls}${e.componentCls}-${n}`]:{color:e[`color${t}`],background:e[`color${r}Bg`],borderColor:e[`color${r}Border`],[`&${e.componentCls}-borderless`]:{borderColor:"transparent"}}}},oae=$y(["Tag","status"],e=>{const n=xE(e);return[lg(n,"success","Success"),lg(n,"processing","Info"),lg(n,"error","Error"),lg(n,"warning","Warning")]},bE);var lae=globalThis&&globalThis.__rest||function(e,n){var t={};for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&n.indexOf(r)<0&&(t[r]=e[r]);if(e!=null&&typeof Object.getOwnPropertySymbols=="function")for(var i=0,r=Object.getOwnPropertySymbols(e);i{const{prefixCls:t,className:r,rootClassName:i,style:a,children:o,icon:l,color:s,onClose:u,closeIcon:c,closable:d,bordered:f=!0}=e,h=lae(e,["prefixCls","className","rootClassName","style","children","icon","color","onClose","closeIcon","closable","bordered"]),{getPrefixCls:v,direction:g,tag:m}=y.useContext(Dt),[p,x]=y.useState(!0);y.useEffect(()=>{"visible"in h&&x(h.visible)},[h.visible]);const b=U3(s),w=Yq(s),S=b||w,C=Object.assign(Object.assign({backgroundColor:s&&!S?s:void 0},m==null?void 0:m.style),a),E=v("tag",t),[k,I,$]=LB(E),T=ne(E,m==null?void 0:m.className,{[`${E}-${s}`]:S,[`${E}-has-color`]:s&&!S,[`${E}-hidden`]:!p,[`${E}-rtl`]:g==="rtl",[`${E}-borderless`]:!f},r,i,I,$),P=O=>{O.stopPropagation(),u==null||u(O),!O.defaultPrevented&&x(!1)},[,F]=NK(d,c??(m==null?void 0:m.closeIcon),O=>O===null?y.createElement(EC,{className:`${E}-close-icon`,onClick:P}):y.createElement("span",{className:`${E}-close-icon`,onClick:P},O),null,!1),L=typeof h.onClick=="function"||o&&o.type==="a",N=l||null,A=N?y.createElement(y.Fragment,null,N,o&&y.createElement("span",null,o)):o,R=y.createElement("span",Object.assign({},h,{ref:n,className:T,style:C}),A,F,b&&y.createElement(iae,{key:"preset",prefixCls:E}),w&&y.createElement(oae,{key:"status",prefixCls:E}));return k(L?y.createElement(ev,{component:"Tag"},R):R)},DB=y.forwardRef(sae);DB.CheckableTag=nae;const hs=DB,uae={month:[[{date:"2024/1/1",no:"1599",name:"经营摩天轮的最大利润",slug:"maximum-profit-of-operating-a-centennial-wheel",difficulty:"中等",rating:1548,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/1/2",no:"466",name:"统计重复个数",slug:"count-the-repetitions",difficulty:"困难",rating:null,situation:"没看懂答案",method:"转化",learn:"",unknown:""},{date:"2024/1/3",no:"2487",name:"从链表中移除节点",slug:"remove-nodes-from-linked-list",difficulty:"中等",rating:1454,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/1/4",no:"2397",name:"被列覆盖的最多行数",slug:"maximum-rows-covered-by-columns",difficulty:"中等",rating:1718,situation:"自己做出",method:"二进制枚举",learn:"Gosper's Hack",unknown:""},{date:"2024/1/5",no:"1944",name:"队列中可以看到的人数",slug:"number-of-visible-people-in-a-queue",difficulty:"困难",rating:2104,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2024/1/6",no:"2807",name:"在链表中插入最大公约数",slug:"insert-greatest-common-divisors-in-linked-list",difficulty:"简单",rating:1279,situation:"自己做出",method:"模拟+链表",learn:"",unknown:""},{date:"2024/1/7",no:"383",name:"赎金信",slug:"ransom-note",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/8",no:"447",name:"回旋镖的数量",slug:"number-of-boomerangs",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/9",no:"2707",name:"字符串中的额外字符",slug:"extra-characters-in-a-string",difficulty:"中等",rating:1735,situation:"自己做出",method:"dp（+字典树）",learn:"",unknown:""},{date:"2024/1/10",no:"2696",name:"删除子串后的字符串最小长度",slug:"minimum-string-length-after-removing-substrings",difficulty:"简单",rating:1282,situation:"自己做出",method:"模拟/栈",learn:"",unknown:""},{date:"2024/1/11",no:"2645",name:"构造有效字符串的最少插入数",slug:"minimum-additions-to-make-valid-string",difficulty:"中等",rating:1477,situation:"自己做出",method:"模拟/dp",learn:"",unknown:""},{date:"2024/1/12",no:"2085",name:"统计出现过一次的公共字符串",slug:"count-common-words-with-one-occurrence",difficulty:"简单",rating:1307,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/13",no:"2182",name:"构造限制重复的字符串",slug:"construct-string-with-repeat-limit",difficulty:"简单",rating:1680,situation:"自己做出",method:"贪心+双指针",learn:"",unknown:""},{date:"2024/1/14",no:"83",name:"删除排序链表中的重复元素",slug:"remove-duplicates-from-sorted-list",difficulty:"简单",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"2024/1/15",no:"82",name:"删除排序链表中的重复元素 II",slug:"remove-duplicates-from-sorted-list",difficulty:"中等",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"2024/1/16",no:"2719",name:"统计整数数目",slug:"count-of-integers",difficulty:"困难",rating:2354,situation:"看懂答案",method:"数位dp",learn:"复习数位dp",unknown:""},{date:"2024/1/17",no:"2744",name:"最大字符串配对数目",slug:"find-maximum-number-of-string-pairs",difficulty:"简单",rating:1405,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/1/18",no:"2171",name:"拿出最少数目的魔法豆",slug:"removing-minimum-number-of-magic-beans",difficulty:"中等",rating:1748,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/1/19",no:"2809",name:"使数组和小于等于 x 的最少时间",slug:"minimum-time-to-make-array-sum-at-most-x",difficulty:"困难",rating:2978,situation:"看懂答案",method:"排序+dp",learn:"",unknown:""},{date:"2024/1/20",no:"2788",name:"按分隔符拆分字符串",slug:"split-strings-by-separator",difficulty:"简单",rating:1299,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/1/21",no:"410",name:"分割数组的最大值",slug:"split-array-largest-sum",difficulty:"困难",rating:null,situation:"自己做出",method:"dp/二分",learn:"",unknown:""},{date:"2024/1/22",no:"670",name:"最大交换",slug:"maximum-swap",difficulty:"中等",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/1/23",no:"2765",name:"最长交替子数组",slug:"longest-alternating-subarray",difficulty:"简单",rating:1580,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/1/24",no:"2865",name:"美丽塔 I",slug:"beautiful-towers-i",difficulty:"中等",rating:1519,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2024/1/25",no:"2859",name:"计算 K 置位下标对应元素的和",slug:"sum-of-values-at-indices-with-k-set-bits",difficulty:"简单",rating:1218,situation:"自己做出",method:"位运算",learn:"位运算计数方法",unknown:""},{date:"2024/1/26",no:"2846",name:"边权重均等查询",slug:"minimum-edge-weight-equilibrium-queries-in-a-tree",difficulty:"困难",rating:2507,situation:"没看懂答案",method:"树上最近公共祖先",learn:"tarjan算法",unknown:""},{date:"2024/1/27",no:"2861",name:"最大合金数",slug:"maximum-number-of-alloys",difficulty:"中等",rating:1981,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2024/1/28",no:"365",name:"水壶问题",slug:"water-and-jug-problem",difficulty:"中等",rating:null,situation:"看思路写出",method:"bfs/dfs/裴蜀定理",learn:"裴蜀定理",unknown:""},{date:"2024/1/29",no:"514",name:"自由之路",slug:"freedom-trail",difficulty:"困难",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/1/30",no:"2808",name:"使循环数组所有元素相等的最少秒数",slug:"minimum-seconds-to-equalize-a-circular-array",difficulty:"中等",rating:1875,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2024/1/31",no:"2670",name:"找出不同元素数目差数组",slug:"find-the-distinct-difference-array",difficulty:"简单",rating:1266,situation:"自己做出",method:"哈希",learn:"",unknown:""}],[{date:"2024/2/1",no:"LCP 24",name:"数字游戏",slug:"5TxKeK",difficulty:"困难",rating:null,situation:"没看懂答案",method:"优先级队列",learn:"",unknown:""},{date:"2024/2/2",no:"1686",name:"石子游戏 VI",slug:"stone-game-vi",difficulty:"中等",rating:2e3,situation:"自己做出",method:"贪心+排序",learn:"",unknown:""},{date:"2024/2/3",no:"1690",name:"石子游戏 VII",slug:"stone-game-vii",difficulty:"中等",rating:1951,situation:"看思路写出",method:"前缀和+ 记忆化搜索/dp",learn:"",unknown:""},{date:"2024/2/4",no:"292",name:"Nim 游戏",slug:"nim-game",difficulty:"简单",rating:null,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/2/5",no:"1696",name:"跳跃游戏 VI",slug:"jump-game-vi",difficulty:"中等",rating:1954,situation:"看思路写出",method:"dp+单调队列",learn:"单调队列，维护区间最值使用单调队列",unknown:""},{date:"2024/2/6",no:"LCP 30",name:"魔塔游戏",slug:"p0NxJO",difficulty:"中等",rating:null,situation:"自己做出",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2024/2/7",no:"2641",name:"二叉树的堂兄弟节点 II",slug:"cousins-in-binary-tree-ii",difficulty:"中等",rating:1676,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/8",no:"993",name:"二叉树的堂兄弟节点",slug:"cousins-in-binary-tree",difficulty:"简单",rating:1287,situation:"自己做出",method:"bfs/dfs",learn:"",unknown:""},{date:"2024/2/9",no:"236",name:"二叉树的最近公共祖先",slug:"lowest-common-ancestor-of-a-binary-tree",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs/dfs",learn:"",unknown:""},{date:"2024/2/10",no:"94",name:"二叉树的中序遍历",slug:"binary-tree-inorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/11",no:"144",name:"二叉树的前序遍历",slug:"binary-tree-preorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/12",no:"145",name:"二叉树的后序遍历",slug:"binary-tree-postorder-traversal",difficulty:"",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/13",no:"987",name:"二叉树的垂序遍历",slug:"vertical-order-traversal-of-a-binary-tree",difficulty:"困难",rating:1675,situation:"自己做出",method:"哈希+排序+dfs/bfs",learn:"",unknown:""},{date:"2024/2/14",no:"102",name:"二叉树的层序遍历",slug:"binary-tree-level-order-traversal",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/15",no:"107",name:"二叉树的层序遍历 II",slug:"binary-tree-level-order-traversal-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/16",no:"103",name:"二叉树的锯齿形层序遍历",slug:"binary-tree-zigzag-level-order-traversal",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/17",no:"429",name:"N 叉树的层序遍历",slug:"n-ary-tree-level-order-traversal",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/2/18",no:"589",name:"N 叉树的前序遍历",slug:"n-ary-tree-preorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2024/2/19",no:"590",name:"N 叉树的后序遍历",slug:"n-ary-tree-postorder-traversal",difficulty:"简单",rating:null,situation:"自己做出",method:"递归/栈",learn:"",unknown:""},{date:"2024/2/20",no:"105",name:"从前序与中序遍历序列构造二叉树",slug:"construct-binary-tree-from-preorder-and-inorder-traversal",difficulty:"中等",rating:null,situation:"看懂答案",method:"递归/转化",learn:"从前序与中序遍历序列构造二叉树的方法",unknown:""},{date:"2024/2/21",no:"106",name:"从中序与后序遍历序列构造二叉树",slug:"construct-binary-tree-from-inorder-and-postorder-traversal",difficulty:"中等",rating:null,situation:"看懂答案",method:"递归/转化",learn:"从中序与后序遍历序列构造二叉树的方法",unknown:""},{date:"2024/2/22",no:"889",name:"根据前序和后序遍历构造二叉树",slug:"construct-binary-tree-from-preorder-and-postorder-traversal",difficulty:"中等",rating:1731,situation:"看懂答案",method:"递归/转化",learn:"从前序与后序遍历序列构造二叉树的方法",unknown:""},{date:"2024/2/23",no:"2583",name:"二叉树中的第 K 大层和",slug:"kth-largest-sum-in-a-binary-tree",difficulty:"中等",rating:1374,situation:"自己做出",method:"bfs+排序/优先级队列",learn:"",unknown:""},{date:"2024/2/24",no:"2476",name:"二叉搜索树最近节点查询",slug:"closest-nodes-queries-in-a-binary-search-tree",difficulty:"中等",rating:1596,situation:"自己做出",method:"递归+二分",learn:"",unknown:""},{date:"2024/2/25",no:"235",name:"二叉搜索树的最近公共祖先",slug:"lowest-common-ancestor-of-a-binary-search-tree",difficulty:"中等",rating:null,situation:"自己做出",method:"二叉搜索树/递归",learn:"复习二叉树最近公共祖先的做法",unknown:""},{date:"2024/2/26",no:"938",name:"二叉搜索树的范围和",slug:"range-sum-of-bst",difficulty:"简单",rating:1335,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2024/2/27",no:"2867",name:"统计树中的合法路径数目",slug:"count-valid-paths-in-a-tree",difficulty:"困难",rating:2428,situation:"没看懂答案",method:"埃氏筛+dfs",learn:"复习埃氏筛",unknown:""},{date:"2024/2/28",no:"2673",name:"使二叉树所有路径值相等的最小代价",slug:"make-costs-of-paths-equal-in-a-binary-tree",difficulty:"中等",rating:1917,situation:"自己做出",method:"转化+贪心 / 递归",learn:"",unknown:""},{date:"2024/2/29",no:"2581",name:"统计可能的树根数目",slug:"count-number-of-possible-root-nodes",difficulty:"困难",rating:2228,situation:"没看懂答案",method:"树形dp",learn:"",unknown:""}],[{date:"2024/3/1",no:"2369",name:"检查数组是否存在有效划分",slug:"check-if-there-is-a-valid-partition-for-the-array",difficulty:"中等",rating:1779,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/3/2",no:"2368",name:"受限条件下可到达节点的数目",slug:"reachable-nodes-with-restrictions",difficulty:"中等",rating:1476,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2024/3/3",no:"225",name:"用队列实现栈",slug:"implement-stack-using-queues",difficulty:"简单",rating:null,situation:"自己做出",method:"栈+队列",learn:"",unknown:""},{date:"2024/3/4",no:"232",name:"用栈实现队列",slug:"implement-queue-using-stacks",difficulty:"简单",rating:null,situation:"自己做出",method:"栈+队列",learn:"",unknown:""},{date:"2024/3/5",no:"1976",name:"到达目的地的方案数",slug:"number-of-ways-to-arrive-at-destination",difficulty:"中等",rating:2094,situation:"看懂答案",method:"迪杰斯特拉",learn:"复习迪杰斯特拉",unknown:""},{date:"2024/3/6",no:"2917",name:"找出数组中的 K-or 值",slug:"find-the-k-or-of-an-array",difficulty:"简单",rating:1388,situation:"自己做出",method:"位运算",learn:"",unknown:""},{date:"2024/3/7",no:"2575",name:"找出字符串的可整除数组",slug:"find-the-divisibility-array-of-a-string",difficulty:"中等",rating:1541,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/3/8",no:"2834",name:"找出美丽数组的最小和",slug:"find-the-minimum-possible-sum-of-a-beautiful-array",difficulty:"中等",rating:1409,situation:"自己做出",method:"贪心+数学",learn:"",unknown:""},{date:"2024/3/9",no:"2386",name:"找出数组的第 K 大和",slug:"find-the-k-sum-of-an-array",difficulty:"困难",rating:2647,situation:"看懂答案",method:"转化+优先级队列",learn:"",unknown:""},{date:"2024/3/10",no:"299",name:"猜数字游戏",slug:"bulls-and-cows",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/3/11",no:"2129",name:"将标题首字母大写",slug:"capitalize-the-title",difficulty:"简单",rating:1274,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/3/12",no:"1261",name:"在受污染的二叉树中查找元素",slug:"find-elements-in-a-contaminated-binary-tree",difficulty:"中等",rating:1439,situation:"自己做出",method:"dfs+ 哈希/位运算",learn:"",unknown:""},{date:"2024/3/13",no:"2864",name:"最大二进制奇数",slug:"maximum-odd-binary-number",difficulty:"简单",rating:1237,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/3/14",no:"2789",name:"合并后数组中的最大元素",slug:"largest-element-in-an-array-after-merge-operations",difficulty:"中等",rating:1484,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/3/15",no:"2312",name:"卖木头块",slug:"selling-pieces-of-wood",difficulty:"困难",rating:2363,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/3/16",no:"2684",name:"矩阵中移动的最大次数",slug:"maximum-number-of-moves-in-a-grid",difficulty:"中等",rating:1625,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/3/17",no:"310",name:"最小高度树",slug:"minimum-height-trees",difficulty:"中等",rating:null,situation:"看思路写出",method:"转化+dfs/bfs/拓扑排序",learn:"",unknown:""},{date:"2024/3/18",no:"303",name:"区域和检索 - 数组不可变",slug:"range-sum-query-immutable",difficulty:"简单",rating:null,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2024/3/19",no:"1793",name:"好子数组的最大分数",slug:"maximum-score-of-a-good-subarray",difficulty:"困难",rating:1945,situation:"看懂答案",method:"双指针",learn:"",unknown:""},{date:"2024/3/20",no:"1969",name:"数组元素的最小非零乘积",slug:"minimum-non-zero-product-of-the-array-elements",difficulty:"中等",rating:1966,situation:"看懂答案",method:"贪心+数学+快速幂",learn:"快速幂",unknown:""},{date:"2024/3/21",no:"2671",name:"频率跟踪器",slug:"frequency-tracker",difficulty:"中等",rating:1509,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/3/22",no:"2617",name:"网格图中最少访问的格子数",slug:"minimum-number-of-visited-cells-in-a-grid",difficulty:"困难",rating:2581,situation:"没看懂答案",method:"优先级队列",learn:"",unknown:""},{date:"2024/3/23",no:"2549",name:"统计桌面上的不同数字",slug:"count-distinct-numbers-on-board",difficulty:"简单",rating:1265,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/3/24",no:"322",name:"零钱兑换",slug:"coin-change",difficulty:"中等",rating:null,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/3/25",no:"518",name:"零钱兑换 II",slug:"coin-change-ii",difficulty:"中等",rating:null,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/3/26",no:"2642",name:"设计可以求最短路径的图类",slug:"design-graph-with-shortest-path-calculator",difficulty:"困难",rating:1810,situation:"自己做出",method:"迪杰斯特拉",learn:"复习迪杰斯特拉算法",unknown:""},{date:"2024/3/27",no:"2580",name:"统计将重叠区间合并成组的方案数",slug:"count-ways-to-group-overlapping-ranges",difficulty:"中等",rating:1631,situation:"自己做出",method:"贪心+数学",learn:"",unknown:""},{date:"2024/3/28",no:"1997",name:"访问完所有房间的第一天",slug:"first-day-where-you-have-been-in-all-the-rooms",difficulty:"中等",rating:2260,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/3/29",no:"2908",name:"元素和最小的山形三元组 I",slug:"minimum-sum-of-mountain-triplets-i",difficulty:"简单",rating:1253,situation:"自己做出",method:"前后缀/单调队列",learn:"",unknown:""},{date:"2024/3/30",no:"2952",name:"需要添加的硬币的最小数量",slug:"minimum-number-of-coins-to-be-added",difficulty:"中等",rating:1784,situation:"看思路写出",method:"转化+贪心",learn:"",unknown:""},{date:"2024/3/31",no:"331",name:"验证二叉树的前序序列化",slug:"verify-preorder-serialization-of-a-binary-tree",difficulty:"中等",rating:null,situation:"自己做出",method:"栈/转化",learn:"",unknown:""}],[{date:"2024/4/1",no:"2810",name:"故障键盘",slug:"faulty-keyboard",difficulty:"简单",rating:1192,situation:"自己做出",method:"模拟/双端队列",learn:"",unknown:""},{date:"2024/4/2",no:"894",name:"所有可能的真二叉树",slug:"all-possible-full-binary-trees",difficulty:"中等",rating:1784,situation:"看懂答案",method:"分治/动态规划",learn:"",unknown:""},{date:"2024/4/3",no:"1379",name:"找出克隆二叉树中的相同节点",slug:"find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",difficulty:"简单",rating:null,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2024/4/4",no:"2192",name:"有向无环图中一个节点的所有祖先",slug:"all-ancestors-of-a-node-in-a-directed-acyclic-graph",difficulty:"中等",rating:1787,situation:"自己做出",method:"拓扑排序/dfs",learn:"",unknown:""},{date:"2024/4/5",no:"1026",name:"节点与其祖先之间的最大差值",slug:"maximum-difference-between-node-and-ancestor",difficulty:"中等",rating:1446,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2024/4/6",no:"1483",name:"树节点的第 K 个祖先",slug:"kth-ancestor-of-a-tree-node",difficulty:"困难",rating:2115,situation:"没看懂答案",method:"倍增",learn:"",unknown:""},{date:"2024/4/7",no:"1600",name:"王位继承顺序",slug:"throne-inheritance",difficulty:"中等",rating:1768,situation:"自己做出",method:"多叉树的前序遍历",learn:"",unknown:""},{date:"2024/4/8",no:"2009",name:"使数组连续的最少操作数",slug:"minimum-number-of-operations-to-make-array-continuous",difficulty:"困难",rating:2084,situation:"看懂答案",method:"排序+滑动窗口",learn:"",unknown:""},{date:"2024/4/9",no:"2529",name:"正整数和负整数的最大计数",slug:"maximum-count-of-positive-integer-and-negative-integer",difficulty:"简单",rating:1195,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2024/4/10",no:"1702",name:"修改后的最大二进制字符串",slug:"maximum-binary-string-after-change",difficulty:"中等",rating:1825,situation:"看懂答案",method:"模拟+贪心 / 转化",learn:"",unknown:""},{date:"2024/4/11",no:"1766",name:"互质树",slug:"tree-of-coprimes",difficulty:"困难",rating:2231,situation:"看懂答案",method:"dfs",learn:"",unknown:""},{date:"2024/4/12",no:"2923",name:"找到冠军 I",slug:"find-champion-i",difficulty:"简单",rating:1235,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/4/13",no:"2924",name:"找到冠军 II",slug:"find-champion-ii",difficulty:"中等",rating:1430,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/4/14",no:"705",name:"设计哈希集合",slug:"design-hashset",difficulty:"简单",rating:null,situation:"自己做出",method:"链地址法",learn:"",unknown:""},{date:"2024/4/15",no:"706",name:"设计哈希映射",slug:"design-hashmap",difficulty:"简单",rating:null,situation:"自己做出",method:"链地址法",learn:"",unknown:""},{date:"2024/4/16",no:"924",name:"尽量减少恶意软件的传播",slug:"minimize-malware-spread",difficulty:"困难",rating:1868,situation:"看懂答案",method:"并查集",learn:"",unknown:""},{date:"2024/4/17",no:"928",name:"尽量减少恶意软件的传播 II",slug:"minimize-malware-spread-ii",difficulty:"困难",rating:1985,situation:"看懂答案",method:"dfs/并查集",learn:"",unknown:""},{date:"2024/4/18",no:"2007",name:"从双倍数组中还原原数组",slug:"find-original-array-from-doubled-array",difficulty:"中等",rating:1557,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2024/4/19",no:"1883",name:"准时抵达会议现场的最小跳过休息次数",slug:"minimum-skips-to-arrive-at-meeting-on-time",difficulty:"困难",rating:2587,situation:"看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/4/20",no:"39",name:"组合总和",slug:"combination-sum",difficulty:"中等",rating:null,situation:"自己做出",method:"回溯",learn:"",unknown:""},{date:"2024/4/21",no:"216",name:"组合总和 III",slug:"combination-sum-iii",difficulty:"中等",rating:null,situation:"自己做出",method:"二进制枚举/回溯",learn:"",unknown:""},{date:"2024/4/22",no:"377",name:"组合总和 Ⅳ",slug:"combination-sum-iv",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/4/23",no:"1052",name:"爱生气的书店老板",slug:"grumpy-bookstore-owner",difficulty:"",rating:1418,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2024/4/24",no:"2385",name:"感染二叉树需要的总时间",slug:"amount-of-time-for-binary-tree-to-be-infected",difficulty:"中等",rating:1711,situation:"自己做出",method:"dfs+bfs",learn:"",unknown:""},{date:"2024/4/25",no:"2739",name:"总行驶距离",slug:"total-distance-traveled",difficulty:"简单",rating:1262,situation:"自己做出",method:"模拟/数学",learn:"换水问题",unknown:""},{date:"2024/4/26",no:"1146",name:"快照数组",slug:"snapshot-array",difficulty:"中等",rating:1770,situation:"看懂答案",method:"二分",learn:"",unknown:""},{date:"2024/4/27",no:"2639",name:"查询网格图中每一列的宽度",slug:"find-the-width-of-columns-of-a-grid",difficulty:"简单",rating:1282,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/4/28",no:"1017",name:"负二进制转换",slug:"convert-to-base-2",difficulty:"中等",rating:1697,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/4/29",no:"1329",name:"将矩阵按对角线排序",slug:"sort-the-matrix-diagonally",difficulty:"中等",rating:1548,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/4/30",no:"2798",name:"满足目标工作时长的员工数目",slug:"number-of-employees-who-met-the-target",difficulty:"简单",rating:1142,situation:"自己做出",method:"模拟",learn:"",unknown:""}],[{date:"2024/5/1",no:"2462",name:"雇佣 K 位工人的总代价",slug:"total-cost-to-hire-k-workers",difficulty:"中等",rating:1763,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2024/5/2",no:"857",name:"雇佣 K 名工人的最低成本",slug:"minimum-cost-to-hire-k-workers",difficulty:"困难",rating:2259,situation:"看懂答案",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2024/5/3",no:"1491",name:"去掉最低工资和最高工资后的工资平均值",slug:"average-salary-excluding-the-minimum-and-maximum-salary",difficulty:"简单",rating:1201,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/5/4",no:"1235",name:"规划兼职工作",slug:"maximum-profit-in-job-scheduling",difficulty:"困难",rating:2022,situation:"看思路写出",method:"dp+二分",learn:"",unknown:""},{date:"2024/5/5",no:"1652",name:"拆炸弹",slug:"defuse-the-bomb",difficulty:"简单",rating:1416,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2024/5/6",no:"741",name:"摘樱桃",slug:"cherry-pickup",difficulty:"困难",rating:null,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/5/7",no:"1463",name:"摘樱桃 II",slug:"cherry-pickup-ii",difficulty:"困难",rating:1956,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/5/8",no:"2079",name:"给植物浇水",slug:"watering-plants",difficulty:"中等",rating:1320,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/9",no:"2105",name:"给植物浇水 II",slug:"watering-plants-ii",difficulty:"中等",rating:1507,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/10",no:"2960",name:"统计已测试设备",slug:"count-tested-devices-after-test-operations",difficulty:"简单",rating:1169,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/11",no:"2391",name:"收集垃圾的最少总时间",slug:"minimum-amount-of-time-to-collect-garbage",difficulty:"中等",rating:1455,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/5/12",no:"1553",name:"吃掉 N 个橘子的最少天数",slug:"minimum-number-of-days-to-eat-n-oranges",difficulty:"困难",rating:2048,situation:"自己做出",method:"记忆化搜索/ 转化+迪杰斯特拉 /启发式搜索",learn:"",unknown:""},{date:"2024/5/13",no:"994",name:"腐烂的橘子",slug:"rotting-oranges",difficulty:"中等",rating:1432,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/5/14",no:"2244",name:"完成所有任务需要的最少轮数",slug:"minimum-rounds-to-complete-all-tasks",difficulty:"中等",rating:1371,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/5/15",no:"2589",name:"完成所有任务的最少时间",slug:"minimum-time-to-complete-all-tasks",difficulty:"困难",rating:2380,situation:"看懂答案",method:"贪心+排序+（扫描线/二分查找）",learn:"",unknown:""},{date:"2024/5/16",no:"1953",name:"你可以工作的最大周数",slug:"maximum-number-of-weeks-for-which-you-can-work",difficulty:"中等",rating:1803,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/5/17",no:"826",name:"安排工作以达到最大收益",slug:"most-profit-assigning-work",difficulty:"中等",rating:1708,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2024/5/18",no:"2644",name:"找出可整除性得分最大的整数",slug:"find-the-maximum-divisibility-score",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/19",no:"1535",name:"找出数组游戏的赢家",slug:"find-the-winner-of-an-array-game",difficulty:"中等",rating:1433,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/20",no:"1542",name:"找出最长的超赞子字符串",slug:"find-longest-awesome-substring",difficulty:"困难",rating:2221,situation:"自己做出",method:"状态压缩+哈希表",learn:"",unknown:""},{date:"2024/5/21",no:"2769",name:"找出最大的可达成数字",slug:"find-the-maximum-achievable-number",difficulty:"简单",rating:1191,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/5/22",no:"2225",name:"找出输掉零场或一场比赛的玩家",slug:"find-players-with-zero-or-one-losses",difficulty:"中等",rating:1316,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/5/23",no:"2831",name:"找出最长等值子数组",slug:"find-the-longest-equal-subarray",difficulty:"中等",rating:1975,situation:"自己做出",method:"哈希+滑动窗口",learn:"",unknown:""},{date:"2024/5/24",no:"1673",name:"找出最具竞争力的子序列",slug:"find-the-most-competitive-subsequence",difficulty:"中等",rating:1802,situation:"看懂答案",method:"贪心+单调栈",learn:"",unknown:""},{date:"2024/5/25",no:"2903",name:"找出满足差值条件的下标 I",slug:"find-indices-with-index-and-value-difference-i",difficulty:"简单",rating:1157,situation:"自己做出",method:"模拟/双指针",learn:"",unknown:""},{date:"2024/5/26",no:"1738",name:"找出第 K 大的异或坐标值",slug:"find-kth-largest-xor-coordinate-value",difficulty:"中等",rating:1671,situation:"自己做出",method:"前缀和+ 排序/快速选择/优先级队列",learn:"",unknown:""},{date:"2024/5/27",no:"2028",name:"找出缺失的观测数据",slug:"find-missing-observations",difficulty:"中等",rating:1444,situation:"自己做出",method:"构造",learn:"",unknown:""},{date:"2024/5/28",no:"2951",name:"找出峰值",slug:"find-the-peaks",difficulty:"简单",rating:1189,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/5/29",no:"2981",name:"找出出现至少三次的最长特殊子字符串 I",slug:"find-longest-special-substring-that-occurs-thrice-i",difficulty:"中等",rating:1505,situation:"自己做出",method:"分类讨论",learn:"",unknown:""},{date:"2024/5/30",no:"2982",name:"找出出现至少三次的最长特殊子字符串 II",slug:"find-longest-special-substring-that-occurs-thrice-ii",difficulty:"中等",rating:1772,situation:"自己做出",method:"二分查找/分类讨论",learn:"",unknown:""},{date:"2024/5/31",no:"2965",name:"找出缺失和重复的数字",slug:"find-missing-and-repeated-values",difficulty:"简单",rating:1244,situation:"自己做出",method:"模拟/位运算/数学",learn:"",unknown:""}],[{date:"2024/6/1",no:"2928",name:"给小朋友们分糖果 I",slug:"distribute-candies-among-children-i",difficulty:"简单",rating:1393,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/6/2",no:"575",name:"分糖果",slug:"distribute-candies",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/6/3",no:"1103",name:"分糖果 II",slug:"distribute-candies-to-people",difficulty:"简单",rating:1287,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2024/6/4",no:"3067",name:"在带权树网络中统计可连接服务器对数目",slug:"count-pairs-of-connectable-servers-in-a-weighted-tree-network",difficulty:"中等",rating:1908,situation:"自己做出",method:"dfs/bfs+数学",learn:"",unknown:""},{date:"2024/6/5",no:"3072",name:"将元素分配到两个数组中 II",slug:"distribute-elements-into-two-arrays-ii",difficulty:"困难",rating:2052,situation:"没看懂答案",method:"树状数组",learn:"",unknown:""},{date:"2024/6/6",no:"2938",name:"区分黑球与白球",slug:"separate-black-and-white-balls",difficulty:"中等",rating:1422,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/6/7",no:"3038",name:"相同分数的最大操作数目 I",slug:"maximum-number-of-operations-with-the-same-score-i",difficulty:"简单",rating:1201,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/8",no:"3040",name:"相同分数的最大操作数目 II",slug:"maximum-number-of-operations-with-the-same-score-ii",difficulty:"中等",rating:1708,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/6/9",no:"312",name:"戳气球",slug:"burst-balloons",difficulty:"困难",rating:null,situation:"看懂答案",method:"记忆化搜索/区间dp",learn:"",unknown:""},{date:"2024/6/10",no:"881",name:"救生艇",slug:"boats-to-save-people",difficulty:"中等",rating:1529,situation:"自己做出",method:"贪心+排序+双指针",learn:"",unknown:""},{date:"2024/6/11",no:"419",name:"甲板上的战舰",slug:"battleships-in-a-board",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2024/6/12",no:"2806",name:"取整购买后的账户余额",slug:"account-balance-after-rounded-purchase",difficulty:"简单",rating:1214,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/6/13",no:"2813",name:"子序列最大优雅度",slug:"maximum-elegance-of-a-k-length-subsequence",difficulty:"困难",rating:2582,situation:"看懂答案",method:"贪心+哈希",learn:"",unknown:""},{date:"2024/6/14",no:"2786",name:"访问数组中的位置使分数最大",slug:"visit-array-positions-to-maximize-score",difficulty:"中等",rating:1732,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/6/15",no:"2779",name:"数组的最大美丽值",slug:"maximum-beauty-of-an-array-after-applying-operation",difficulty:"中等",rating:1638,situation:"自己做出",method:"排序+滑动窗口 / 差分",learn:"",unknown:""},{date:"2024/6/16",no:"521",name:"最长特殊序列 Ⅰ",slug:"longest-uncommon-subsequence-i",difficulty:"简单",rating:null,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2024/6/17",no:"522",name:"最长特殊序列 II",slug:"longest-uncommon-subsequence-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2024/6/18",no:"2288",name:"价格减免",slug:"apply-discount-to-prices",difficulty:"中等",rating:1577,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/19",no:"2713",name:"矩阵中严格递增的单元格数",slug:"maximum-strictly-increasing-cells-in-a-matrix",difficulty:"困难",rating:2387,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/6/20",no:"2748",name:"美丽下标对的数目",slug:"number-of-beautiful-pairs",difficulty:"简单",rating:1301,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/21",no:"LCP 61",name:"气温变化趋势",slug:"6CE719",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/22",no:"2663",name:"字典序最小的美丽字符串",slug:"lexicographically-smallest-beautiful-string",difficulty:"困难",rating:2415,situation:"没看懂答案",method:"贪心",learn:"",unknown:""},{date:"2024/6/23",no:"520",name:"检测大写字母",slug:"detect-capital",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/24",no:"503",name:"下一个更大元素 II",slug:"next-greater-element-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2024/6/25",no:"2732",name:"找到矩阵中的好子集",slug:"find-a-good-subset-of-the-matrix",difficulty:"困难",rating:2239,situation:"看思路写出",method:"数学+哈希",learn:"",unknown:""},{date:"2024/6/26",no:"2741",name:"特别的排列",slug:"special-permutations",difficulty:"中等",rating:2020,situation:"没看懂答案",method:"状态压缩+ 记忆化搜索/dp",learn:"",unknown:""},{date:"2024/6/27",no:"2734",name:"执行子串操作后的字典序最小字符串",slug:"lexicographically-smallest-string-after-substring-operation",difficulty:"中等",rating:1405,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/6/28",no:"2742",name:"给墙壁刷油漆",slug:"painting-the-walls",difficulty:"困难",rating:2424,situation:"看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/6/29",no:"2710",name:"移除字符串中的尾随零",slug:"remove-trailing-zeros-from-a-string",difficulty:"简单",rating:1164,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/6/30",no:"494",name:"目标和",slug:"target-sum",difficulty:"中等",rating:null,situation:"自己做出",method:"回溯/dp",learn:"",unknown:"dp"}],[{date:"2024/7/1",no:"2065",name:"最大化一张图中的路径价值",slug:"maximum-path-quality-of-a-graph",difficulty:"困难",rating:2178,situation:"自己做出",method:"dfs+哈希",learn:"",unknown:""},{date:"2024/7/2",no:"3115",name:"质数的最大距离",slug:"maximum-prime-difference",difficulty:"中等",rating:1294,situation:"自己做出",method:"素数筛",learn:"",unknown:""},{date:"2024/7/3",no:"3099",name:"哈沙德数",slug:"harshad-number",difficulty:"简单",rating:1100,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/4",no:"3086",name:"拾起 K 个 1 需要的最少行动次数",slug:"minimum-moves-to-pick-k-ones",difficulty:"困难",rating:2672,situation:"没看懂答案",method:"贪心+二分",learn:"",unknown:""},{date:"2024/7/5",no:"3033",name:"修改矩阵",slug:"modify-the-matrix",difficulty:"简单",rating:1180,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/6",no:"3101",name:"交替子数组计数",slug:"count-alternating-subarrays",difficulty:"中等",rating:1404,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/7/7",no:"1958",name:"检查操作是否合法",slug:"check-if-move-is-legal",difficulty:"中等",rating:1658,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/8",no:"724",name:"寻找数组的中心下标",slug:"find-pivot-index",difficulty:"简单",rating:null,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2024/7/9",no:"3102",name:"最小化曼哈顿距离",slug:"minimize-manhattan-distances",difficulty:"困难",rating:2215,situation:"没看懂答案",method:"数学",learn:"",unknown:"切比雪夫距离"},{date:"2024/7/10",no:"2970",name:"统计移除递增子数组的数目 I",slug:"count-the-number-of-incremovable-subarrays-i",difficulty:"简单",rating:1563,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2024/7/11",no:"2972",name:"统计移除递增子数组的数目 II",slug:"count-the-number-of-incremovable-subarrays-ii",difficulty:"困难",rating:2152,situation:"看懂答案",method:"双指针",learn:"",unknown:""},{date:"2024/7/12",no:"2974",name:"最小数字游戏",slug:"minimum-number-game",difficulty:"简单",rating:1184,situation:"自己做出",method:"排序+模拟",learn:"",unknown:""},{date:"2024/7/13",no:"3011",name:"判断一个数组是否可以变为有序",slug:"find-if-array-can-be-sorted",difficulty:"中等",rating:1496,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/7/14",no:"807",name:"保持城市天际线",slug:"max-increase-to-keep-city-skyline",difficulty:"中等",rating:1376,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/7/15",no:"721",name:"账户合并",slug:"accounts-merge",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希+并查集",learn:"",unknown:""},{date:"2024/7/16",no:"2956",name:"找到两个数组中的公共元素",slug:"find-common-elements-between-two-arrays",difficulty:"简单",rating:1214,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2024/7/17",no:"2959",name:"关闭分部的可行集合数目",slug:"number-of-possible-sets-of-closing-branches",difficulty:"困难",rating:2077,situation:"自己做出",method:"状态压缩+floyd算法/迪杰斯特拉",learn:"",unknown:""},{date:"2024/7/18",no:"3112",name:"访问消失节点的最少时间",slug:"minimum-time-to-visit-disappearing-nodes",difficulty:"中等",rating:1756,situation:"自己做出",method:"迪杰斯特拉",learn:"",unknown:""},{date:"2024/7/19",no:"3096",name:"得到更多分数的最少关卡数目",slug:"minimum-levels-to-gain-more-points",difficulty:"中等",rating:1500,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2024/7/20",no:"2850",name:"将石头分散到网格图的最少移动次数",slug:"minimum-moves-to-spread-stones-over-grid",difficulty:"中等",rating:2001,situation:"自己做出",method:"全排列",learn:"",unknown:""},{date:"2024/7/21",no:"1186",name:"删除一次得到子数组最大和",slug:"maximum-subarray-sum-with-one-deletion",difficulty:"中等",rating:1799,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/7/22",no:"2101",name:"引爆最多的炸弹",slug:"detonate-the-maximum-bombs",difficulty:"中等",rating:1880,situation:"自己做出",method:"转化+bfs",learn:"",unknown:""},{date:"2024/7/23",no:"3098",name:"求出所有子序列的能量和",slug:"find-the-sum-of-subsequence-powers",difficulty:"困难",rating:2552,situation:"没看懂答案",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2024/7/24",no:"2766",name:"重新放置石块",slug:"relocate-marbles",difficulty:"中等",rating:1613,situation:"自己做出",method:"哈希+模拟",learn:"",unknown:""},{date:"2024/7/25",no:"2844",name:"生成特殊数字的最少操作",slug:"minimum-operations-to-make-a-special-number",difficulty:"中等",rating:1588,situation:"自己做出",method:"数学+转化",learn:"",unknown:""},{date:"2024/7/26",no:"2740",name:"找出分区值",slug:"find-the-value-of-the-partition",difficulty:"中等",rating:1301,situation:"自己做出",method:"转化+排序",learn:"",unknown:""},{date:"2024/7/27",no:"3106",name:"满足距离约束且字典序最小的字符串",slug:"lexicographically-smallest-string-after-operations-with-constraint",difficulty:"中等",rating:1515,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/7/28",no:"699",name:"掉落的方块",slug:"falling-squares",difficulty:"困难",rating:null,situation:"看懂答案",method:"模拟/有序集合/线段树",learn:"",unknown:""},{date:"2024/7/29",no:"682",name:"棒球比赛",slug:"baseball-game",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟+栈",learn:"",unknown:""},{date:"2024/7/30",no:"2961",name:"双模幂运算",slug:"double-modular-exponentiation",difficulty:"中等",rating:1450,situation:"自己做出",method:"数学（+快速幂）",learn:"",unknown:""},{date:"2024/7/31",no:"3111",name:"覆盖所有点的最少矩形数目",slug:"minimum-rectangles-to-cover-points",difficulty:"中等",rating:1401,situation:"自己做出",method:"贪心",learn:"",unknown:""}],[{date:"2024/8/1",no:"LCP 40",name:"心算挑战",slug:"uOAnQW",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心+排序/哈希",learn:"",unknown:""},{date:"2024/8/2",no:"3128",name:"直角三角形",slug:"right-triangles",difficulty:"中等",rating:1540,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/8/3",no:"3143",name:"正方形中的最多点数",slug:"maximum-points-inside-the-square",difficulty:"中等",rating:1696,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2024/8/4",no:"572",name:"另一棵树的子树",slug:"subtree-of-another-tree",difficulty:"简单",rating:null,situation:"自己做出",method:"dfs/树哈希",learn:"",unknown:"树哈希"},{date:"2024/8/5",no:"600",name:"不含连续1的非负整数",slug:"non-negative-integers-without-consecutive-ones",difficulty:"困难",rating:null,situation:"没看懂答案",method:"数位dp",learn:"",unknown:""},{date:"2024/8/6",no:"3129",name:"找出所有稳定的二进制数组 I",slug:"find-all-possible-stable-binary-arrays-i",difficulty:"中等",rating:2200,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/7",no:"3130",name:"找出所有稳定的二进制数组 II",slug:"find-all-possible-stable-binary-arrays-ii",difficulty:"困难",rating:2824,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/8",no:"3131",name:"找出与数组相加的整数 I",slug:"find-the-integer-added-to-array-i",difficulty:"简单",rating:1160,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2024/8/9",no:"3132",name:"找出与数组相加的整数 II",slug:"find-the-integer-added-to-array-ii",difficulty:"中等",rating:1620,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2024/8/10",no:"2940",name:"找到 Alice 和 Bob 可以相遇的建筑",slug:"find-building-where-alice-and-bob-can-meet",difficulty:"困难",rating:2327,situation:"自己做出",method:"线段树/单调栈/优先级队列",learn:"",unknown:""},{date:"2024/8/11",no:"1035",name:"不相交的线",slug:"uncrossed-lines",difficulty:"中等",rating:1805,situation:"自己做出",method:"转化+dp",learn:"",unknown:""},{date:"2024/8/12",no:"676",name:"实现一个魔法字典",slug:"implement-magic-dictionary",difficulty:"中等",rating:null,situation:"自己做出",method:"字典树",learn:"",unknown:""},{date:"2024/8/13",no:"3151",name:"特殊数组 I",slug:"special-array-i",difficulty:"简单",rating:1152,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/8/14",no:"3152",name:"特殊数组 II",slug:"special-array-ii",difficulty:"中等",rating:1523,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2024/8/15",no:"3148",name:"矩阵中的最大得分",slug:"maximum-difference-score-in-a-grid",difficulty:"中等",rating:1819,situation:"自己做出",method:"dp/前缀和",learn:"",unknown:""},{date:"2024/8/16",no:"3117",name:"划分数组得到最小的值之和",slug:"minimum-sum-of-values-by-dividing-array",difficulty:"困难",rating:2735,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/17",no:"3137",name:"K 周期字符串需要的最少操作次数",slug:"minimum-number-of-operations-to-make-word-k-periodic",difficulty:"中等",rating:1491,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2024/8/18",no:"551",name:"学生出勤记录 I",slug:"student-attendance-record-i",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/8/19",no:"552",name:"学生出勤记录 II",slug:"student-attendance-record-ii",difficulty:"困难",rating:null,situation:"自己做出",method:"记忆化搜索/dp/矩阵快速幂",learn:"",unknown:""},{date:"2024/8/20",no:"3154",name:"到达第 K 级台阶的方案数",slug:"find-number-of-ways-to-reach-the-k-th-stair",difficulty:"困难",rating:2071,situation:"没看懂答案",method:"记忆化搜索/数学",learn:"",unknown:""},{date:"2024/8/21",no:"3007",name:"价值和小于等于 K 的最大数字",slug:"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",difficulty:"中等",rating:2258,situation:"没看懂答案",method:"二分+数学",learn:"",unknown:""},{date:"2024/8/22",no:"3133",name:"数组最后一个元素的最小值",slug:"minimum-array-end",difficulty:"中等",rating:1934,situation:"看懂答案",method:"位运算",learn:"",unknown:""},{date:"2024/8/23",no:"3145",name:"大数组元素的乘积",slug:"find-products-of-elements-of-big-array",difficulty:"困难",rating:2859,situation:"没看懂答案",method:"二分",learn:"",unknown:""},{date:"2024/8/24",no:"3146",name:"两个字符串的排列差",slug:"permutation-difference-between-two-strings",difficulty:"简单",rating:1152,situation:"自己做出",method:"模拟（+哈希）",learn:"",unknown:""},{date:"2024/8/25",no:"698",name:"划分为k个相等的子集",slug:"partition-to-k-equal-sum-subsets",difficulty:"中等",rating:null,situation:"看懂答案",method:"状态压缩+记忆化搜索/dp",learn:"",unknown:""},{date:"2024/8/26",no:"690",name:"员工的重要性",slug:"employee-importance",difficulty:"中等",rating:null,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2024/8/27",no:"3134",name:"找出唯一性数组的中位数",slug:"find-the-median-of-the-uniqueness-array",difficulty:"困难",rating:2451,situation:"没看懂答案",method:"数学+二分",learn:"",unknown:""},{date:"2024/8/28",no:"3144",name:"分割字符频率相等的最少子字符串",slug:"minimum-substring-partition-of-equal-character-frequency",difficulty:"中等",rating:1917,situation:"自己做出",method:"dp+哈希",learn:"",unknown:""},{date:"2024/8/29",no:"3142",name:"判断矩阵是否满足条件",slug:"check-if-grid-satisfies-conditions",difficulty:"简单",rating:1303,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/8/30",no:"3153",name:"所有数对中数位差之和",slug:"sum-of-digit-differences-of-all-pairs",difficulty:"中等",rating:1645,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2024/8/31",no:"3127",name:"构造相同颜色的正方形",slug:"make-a-square-with-the-same-color",difficulty:"简单",rating:1337,situation:"自己做出",method:"模拟",learn:"",unknown:""}],[{date:"2024/9/1",no:"1450",name:"在既定时间做作业的学生人数",slug:"number-of-students-doing-homework-at-a-given-time",difficulty:"简单",rating:1129,situation:"自己做出",method:"模拟/差分/二分",learn:"",unknown:""},{date:"2024/9/2",no:"2024",name:"考试的最大困扰度",slug:"maximize-the-confusion-of-an-exam",difficulty:"中等",rating:1643,situation:"看思路写出",method:"滑动窗口",learn:"",unknown:""},{date:"2024/9/3",no:"2708",name:"一个小组的最大实力值",slug:"maximum-strength-of-a-group",difficulty:"中等",rating:1502,situation:"自己做出",method:"分类讨论+贪心 / 位运算",learn:"",unknown:""},{date:"2024/9/4",no:"2860",name:"让所有学生保持开心的分组方法数",slug:"happy-students",difficulty:"中等",rating:1625,situation:"自己做出",method:"排序+贪心",learn:"",unknown:""},{date:"2024/9/5",no:"3174",name:"清除数字",slug:"clear-digits",difficulty:"简单",rating:1255,situation:"自己做出",method:"栈",learn:"",unknown:""},{date:"2024/9/6",no:"3176",name:"求出最长好子序列 I",slug:"find-the-maximum-length-of-a-good-subsequence-i",difficulty:"中等",rating:1849,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/9/7",no:"3177",name:"求出最长好子序列 II",slug:"find-the-maximum-length-of-a-good-subsequence-ii",difficulty:"困难",rating:2364,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/9/8",no:"977",name:"有序数组的平方",slug:"squares-of-a-sorted-array",difficulty:"简单",rating:1129,situation:"自己做出",method:"模拟+排序/双指针",learn:"",unknown:""},{date:"2024/9/9",no:"2181",name:"合并零之间的节点",slug:"merge-nodes-in-between-zeros",difficulty:"中等",rating:1333,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/10",no:"2552",name:"统计上升四元组",slug:"count-increasing-quadruplets",difficulty:"困难",rating:2432,situation:"没看懂答案",method:"数学",learn:"",unknown:""},{date:"2024/9/11",no:"2555",name:"两个线段获得的最多奖品",slug:"maximize-win-from-two-segments",difficulty:"中等",rating:2080,situation:"没看懂答案",method:"二分/双指针+dp",learn:"",unknown:""},{date:"2024/9/12",no:"2576",name:"求出最多标记下标",slug:"find-the-maximum-number-of-marked-indices",difficulty:"中等",rating:1843,situation:"看懂答案",method:"二分查找/双指针",learn:"",unknown:""},{date:"2024/9/13",no:"2398",name:"预算内的最多机器人数目",slug:"maximum-number-of-robots-within-budget",difficulty:"困难",rating:1917,situation:"看懂答案",method:"双指针+单调队列",learn:"",unknown:""},{date:"2024/9/14",no:"2390",name:"从字符串中移除星号",slug:"removing-stars-from-a-string",difficulty:"中等",rating:1347,situation:"自己做出",method:"模拟/栈",learn:"",unknown:""},{date:"2024/9/15",no:"2848",name:"与车相交的点",slug:"points-that-intersect-with-cars",difficulty:"简单",rating:1229,situation:"自己做出",method:"模拟/差分数组",learn:"",unknown:""},{date:"2024/9/16",no:"1184",name:"公交站间的距离",slug:"distance-between-bus-stops",difficulty:"简单",rating:1234,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/17",no:"815",name:"公交路线",slug:"bus-routes",difficulty:"困难",rating:1964,situation:"自己做出",method:"超图+bfs",learn:"",unknown:""},{date:"2024/9/18",no:"2332",name:"坐上公交的最晚时间",slug:"the-latest-time-to-catch-a-bus",difficulty:"中等",rating:1840,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/19",no:"2414",name:"最长的字母序连续子字符串的长度",slug:"length-of-the-longest-alphabetical-continuous-substring",difficulty:"中等",rating:1221,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/20",no:"2376",name:"统计特殊整数",slug:"count-special-integers",difficulty:"困难",rating:2120,situation:"没看懂答案",method:"数位dp",learn:"",unknown:""},{date:"2024/9/21",no:"2374",name:"边积分最高的节点",slug:"node-with-highest-edge-score",difficulty:"中等",rating:1418,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/22",no:"997",name:"找到小镇的法官",slug:"find-the-town-judge",difficulty:"简单",rating:1201,situation:"自己做出",method:"图论",learn:"",unknown:""},{date:"2024/9/23",no:"1014",name:"最佳观光组合",slug:"best-sightseeing-pair",difficulty:"中等",rating:1730,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2024/9/24",no:"2207",name:"字符串中最多数目的子序列",slug:"maximize-number-of-subsequences-in-a-string",difficulty:"中等",rating:1550,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2024/9/25",no:"2306",name:"公司命名",slug:"naming-a-company",difficulty:"困难",rating:2305,situation:"看懂答案",method:"哈希+数学",learn:"",unknown:""},{date:"2024/9/26",no:"2535",name:"数组元素和与数字和的绝对差",slug:"difference-between-element-sum-and-digit-sum-of-an-array",difficulty:"简单",rating:1222,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2024/9/27",no:"2516",name:"每种字符至少取 K 个",slug:"take-k-of-each-character-from-left-and-right",difficulty:"中等",rating:1947,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2024/9/28",no:"2286",name:"以组为单位订音乐会的门票",slug:"booking-concert-tickets-in-groups",difficulty:"困难",rating:2470,situation:"没看懂答案",method:"线段树+二分",learn:"",unknown:""},{date:"2024/9/29",no:"2073",name:"买票需要的时间",slug:"time-needed-to-buy-tickets",difficulty:"简单",rating:1325,situation:"自己做出",method:"模拟/转化",learn:"",unknown:""},{date:"2024/9/30",no:"1845",name:"座位预约管理系统",slug:"seat-reservation-manager",difficulty:"中等",rating:1428,situation:"自己做出",method:"优先级队列",learn:"",unknown:""}],[{date:"2024/10/1",no:"983",name:"最低票价",slug:"minimum-cost-for-tickets",difficulty:"中等",rating:1786,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2024/10/2",no:"1870",name:"准时到达的列车最小时速",slug:"minimum-speed-to-arrive-on-time",difficulty:"中等",rating:1675,situation:"自己做出",method:"二分",learn:"",unknown:""}]]},NB={daily:uae},cae={month:[[{date:"2023/1/1",no:"2351",name:"第一个出现两次的字母",difficulty:"简单",rating:1155,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"2023/1/2",no:"1801",name:"积压订单中的订单总数",difficulty:"中等",rating:1711,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/1/3",no:"2042",name:"检查句子中的数字是否递增",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/1/4",no:"1802",name:"有界数组中指定下标处的最大值",difficulty:"中等",rating:1929,situation:"自己做出",method:"贪心+二分 / 数学",learn:"",unknown:""},{date:"2023/1/5",no:"1803",name:"统计异或值在范围内的数对有多少",difficulty:"困难",rating:2479,situation:"自己做出",method:"字典树",learn:"字典树",unknown:""},{date:"2023/1/6",no:"2180",name:"统计各位数字之和为偶数的整数个数",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2023/1/7",no:"1658",name:"将x减到0的最小操作数",difficulty:"中等",rating:1817,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/1/8",no:"2185",name:"统计包含给定前缀的字符串",difficulty:"简单",rating:1167,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/1/9",no:"1806",name:"还原排列的最少操作步数",difficulty:"中等",rating:1491,situation:"自己做出",method:"模拟/数学",learn:"",unknown:"数学"},{date:"1/10/23",no:"753",name:"破解保险箱",difficulty:"困难",rating:2273,situation:"看懂答案",method:"hierholzer算法",learn:"hierholzer算法",unknown:"hierholzer算法"},{date:"1/11/23",no:"2283",name:"判断一个数的数字计数是否等于数位的值",difficulty:"简单",rating:1253,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"1/12/23",no:"1807",name:"替换字符串中的括号内容",difficulty:"中等",rating:1481,situation:"自己做出",method:"哈希表",learn:"字符串数组转map方法",unknown:""},{date:"1/13/23",no:"2287",name:"重排字符形成目标字符串",difficulty:"简单",rating:1299,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"1/14/23",no:"1819",name:"序列中不同最大公约数的数目",difficulty:"困难",rating:2539,situation:"看懂答案",method:"转化+数学",learn:"",unknown:""},{date:"1/15/23",no:"2293",name:"极大极小游戏",difficulty:"简单",rating:1241,situation:"自己做出",method:"模拟/递归",learn:"",unknown:""},{date:"1/16/23",no:"1813",name:"句子相似性III",difficulty:"中等",rating:1588,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"1/17/23",no:"1814",name:"统计一个数组中好对子的数目",difficulty:"中等",rating:1737,situation:"自己做出",method:"转化+哈希表",learn:"",unknown:""},{date:"1/18/23",no:"1825",name:"求出MK平均值",difficulty:"困难",rating:2395,situation:"没看懂答案",method:"有序集合",learn:"",unknown:""},{date:"1/19/23",no:"2299",name:"强密码检验器II",difficulty:"简单",rating:1241,situation:"自己做出",method:"正则表达式",learn:"正则预查",unknown:""},{date:"1/20/23",no:"1817",name:"查找用户活跃分钟数",difficulty:"中等",rating:1360,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"1/21/23",no:"1824",name:"最少侧跳次数",difficulty:"中等",rating:1778,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"1/22/23",no:"1815",name:"得到新鲜甜甜圈的最多组数",difficulty:"困难",rating:2559,situation:"没看懂答案",method:"状态压缩+dp",learn:"模拟退火算法",unknown:""},{date:"1/23/23",no:"2303",name:"计算应缴税款总额",difficulty:"简单",rating:1283,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"1/24/23",no:"1828",name:"统计一个圆中点的数目",difficulty:"中等",rating:1380,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"1/25/23",no:"1632",name:"矩阵转换后的秩",difficulty:"困难",rating:2529,situation:"没看懂答案",method:"并查集+拓扑排序",learn:"",unknown:""},{date:"1/26/23",no:"1663",name:"具有给定数值的最小字符串",difficulty:"中等",rating:1460,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"1/27/23",no:"2309",name:"兼具大小写的最好英文字母",difficulty:"简单",rating:1242,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"1/28/23",no:"1664",name:"生成平衡数组的方案数",difficulty:"中等",rating:1590,situation:"自己做出",method:"dp/前缀和",learn:"",unknown:""},{date:"1/29/23",no:"2315",name:"统计星号",difficulty:"简单",rating:1250,situation:"自己做出",method:"模拟",learn:"正则计数方法",unknown:""},{date:"1/30/23",no:"1669",name:"合并两个链表",difficulty:"中等",rating:1428,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"1/31/23",no:"2319",name:"判读矩阵是否是一个X矩阵",difficulty:"简单",rating:1200,situation:"自己做出",method:"模拟",learn:"",unknown:""}],[{date:"2023/2/1",no:"2325",name:"解密消息",difficulty:"简单",rating:1268,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/2/2",no:"1129",name:"颜色交替的最短路径",difficulty:"中等",rating:1779,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/2/3",no:"1145",name:"二叉树着色游戏",difficulty:"中等",rating:1741,situation:"看懂答案",method:"dfs",learn:"树的重心",unknown:""},{date:"2023/2/4",no:"1798",name:"你能构造出连续值的最大数目",difficulty:"中等",rating:1931,situation:"看懂答案",method:"贪心+转化",learn:"",unknown:""},{date:"2023/2/5",no:"1210",name:"穿过迷宫的最少移动次数",difficulty:"困难",rating:2022,situation:"没看懂答案",method:"bfs",learn:"",unknown:""},{date:"2023/2/6",no:"2331",name:"计算布尔二叉树的值",difficulty:"简单",rating:1303,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2023/2/7",no:"1604",name:"警告一小时内使用相同员工卡大于等于三次的人",difficulty:"中等",rating:1606,situation:"自己做出",method:"哈希+排序",learn:"",unknown:""},{date:"2023/2/8",no:"1233",name:"删除子文件夹",difficulty:"中等",rating:1544,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/2/9",no:"1797",name:"设计一个验证系统",difficulty:"中等",rating:1534,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/2/10",no:"1223",name:"掷骰子模拟",difficulty:"困难",rating:2008,situation:"没看懂答案",method:"动态规划",learn:"记忆化搜索",unknown:""},{date:"2023/2/11",no:"2335",name:"装满杯子需要的最短总时长",difficulty:"简单",rating:1360,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2023/2/12",no:"1138",name:"字母板上的路径",difficulty:"中等",rating:1410,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/2/13",no:"1234",name:"替换子串得到平衡字符串",difficulty:"中等",rating:1877,situation:"自己做出",method:"滑动窗口+哈希",learn:"",unknown:""},{date:"2023/2/14",no:"1124",name:"表现良好的最长时间段",difficulty:"中等",rating:1908,situation:"自己做出",method:"贪心/哈希",learn:"",unknown:""},{date:"2023/2/15",no:"1250",name:"检查好数组",difficulty:"困难",rating:1983,situation:"自己做出",method:"数论",learn:"裴蜀定理",unknown:""},{date:"2023/2/16",no:"2341",name:"数组能形成多少数对",difficulty:"简单",rating:1184,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/2/17",no:"1139",name:"最大的以1为边界的正方形",difficulty:"中等",rating:1744,situation:"自己做出",method:"动态规划/前缀和",learn:"",unknown:"动态规划"},{date:"2023/2/18",no:"1237",name:"找出给定方程的正整数解",difficulty:"中等",rating:1404,situation:"自己做出",method:"暴力/二分/双指针",learn:"",unknown:""},{date:"2023/2/19",no:"1792",name:"最大平均通过率",difficulty:"中等",rating:1817,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/2/20",no:"2347",name:"最好的扑克手牌",difficulty:"简单",rating:1241,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/2/21",no:"1326",name:"灌溉花园的最少水龙头数目",difficulty:"困难",rating:1326,situation:"自己做出",method:"动态规划/贪心",learn:"",unknown:""},{date:"2023/2/22",no:"1140",name:"石子游戏II",difficulty:"中等",rating:2034,situation:"看懂答案",method:"后缀和+记忆化搜索/dp",learn:"记忆化搜索",unknown:""},{date:"2023/2/23",no:"1218",name:"循环码排列",difficulty:"中等",rating:1774,situation:"自己做出",method:"模拟",learn:"格雷码生成公式：(i >> 1) ^ i ^ start",unknown:""},{date:"2023/2/24",no:"2357",name:"使数组中所有元素都等于零",difficulty:"简单",rating:1225,situation:"自己做出",method:"哈希/排序",learn:"",unknown:""},{date:"2023/2/25",no:"1247",name:"交换字符使得字符串相同",difficulty:"中等",rating:1591,situation:"自己做出",method:"转化+贪心",learn:"",unknown:""},{date:"2023/2/26",no:"1255",name:"得分最高的单词集合",difficulty:"困难",rating:1881,situation:"自己做出",method:"dfs/状态压缩 +哈希",learn:"状态压缩",unknown:""},{date:"2023/2/27",no:"1144",name:"递减元素使数组呈锯齿状",difficulty:"中等",rating:1558,situation:"自己做出",method:"贪心+分类讨论",learn:"",unknown:""},{date:"2023/2/28",no:"2363",name:"合并相似的物品",difficulty:"简单",rating:1270,situation:"自己做出",method:"哈希",learn:"",unknown:""}],[{date:"2023/3/1",no:"2373",name:"矩阵中的局部最大值",difficulty:"简单",rating:1331,situation:"自己做出",method:"模拟/二维单调队列",learn:"",unknown:""},{date:"2023/3/2",no:"面试题05.02",name:"二进制数转字符串",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/3/3",no:"1487",name:"保证文件名唯一",difficulty:"中等",rating:1696,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/3/4",no:"982",name:"按位与为零的三元组",difficulty:"困难",rating:2084,situation:"自己做出",method:"哈希/快速沃尔什变换",learn:"快速沃尔什变换",unknown:""},{date:"2023/3/5",no:"1599",name:"经营摩天轮的最大利润",difficulty:"中等",rating:1548,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/3/6",no:"1653",name:"使字符串平衡的最少删除次数",difficulty:"中等",rating:1793,situation:"自己做出",method:"动态规划",learn:"",unknown:""},{date:"2023/3/7",no:"1096",name:"花括号展开II",difficulty:"困难",rating:2348,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2023/3/8",no:"剑指Offer 47",name:"礼物的最大价值",difficulty:"中等",rating:null,situation:"自己做出",method:"动态规划",learn:"",unknown:""},{date:"2023/3/9",no:"2379",name:"得到K个黑块的最少涂色次数",difficulty:"简单",rating:1360,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/3/10",no:"1590",name:"使数组和能被P整除",difficulty:"中等",rating:2038,situation:"看懂答案",method:"数学+前缀和+哈希",learn:"",unknown:""},{date:"2023/3/11",no:"面试题17.05",name:"字母与数字",difficulty:"中等",rating:null,situation:"自己做出",method:"前缀和+哈希",learn:"",unknown:""},{date:"2023/3/12",no:"1617",name:"统计子树中城市之间最大距离",difficulty:"困难",rating:2308,situation:"看懂答案",method:"状态压缩+ 动态规划/dfs+bfs",learn:"求树直径的方式：一次dfs找到最远节点，从最远节点dfs找最远节点为树直径。",unknown:""},{date:"2023/3/13",no:"2383",name:"赢得比赛需要的最少训练时长",difficulty:"简单",rating:1413,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/3/14",no:"1605",name:"给定行和列的和求可行矩阵",difficulty:"中等",rating:1867,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/3/15",no:"1615",name:"最大网络秩",difficulty:"中等",rating:1521,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/3/16",no:"2488",name:"统计中位数为K的子数组",difficulty:"困难",rating:1998,situation:"看懂答案",method:"前缀和+哈希",learn:"",unknown:""},{date:"2023/3/17",no:"2389",name:"和有限的最长子序列",difficulty:"简单",rating:1387,situation:"自己做出",method:"排序+二分",learn:"",unknown:""},{date:"2023/3/18",no:"1616",name:"分割两个字符串得到回文串",difficulty:"中等",rating:1868,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/3/19",no:"1625",name:"执行操作后字典序最小的字符串",difficulty:"中等",rating:1992,situation:"自己做出",method:"裴蜀定理/ bfs+哈希",learn:"",unknown:""},{date:"2023/3/20",no:"1012",name:"至少有1位重复的数字",difficulty:"困难",rating:2230,situation:"自己做出",method:"数位dp",learn:"复习数位dp",unknown:""},{date:"2023/3/21",no:"2469",name:"温度转换",difficulty:"简单",rating:1153,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/3/22",no:"1626",name:"无矛盾的最佳球队",difficulty:"中等",rating:2027,situation:"自己做出",method:"排序+dp",learn:"",unknown:""},{date:"2022023/3/3",no:"1630",name:"等差子数组",difficulty:"中等",rating:1421,situation:"自己做出",method:"数学",learn:"O(n)验证重排等差数列的方法",unknown:""},{date:"2023/3/24",no:"1032",name:"字符流",difficulty:"困难",rating:1970,situation:"没看懂答案",method:"AC自动机",learn:"AC自动机",unknown:""},{date:"2023/3/25",no:"1574",name:"删除最短的子数组使剩余数组有序",difficulty:"中等",rating:1931,situation:"看思路写出",method:"贪心+双指针",learn:"",unknown:""},{date:"2023/3/26",no:"2395",name:"和相等的子数组",difficulty:"简单",rating:1249,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/3/27",no:"1638",name:"统计只差一个字符的子串数目",difficulty:"中等",rating:1744,situation:"看懂答案",method:"枚举/dp",learn:"",unknown:""},{date:"2023/3/28",no:"1092",name:"最短公共超序列",difficulty:"困难",rating:1976,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/3/29",no:"1641",name:"统计字典序元音字符串的数目",difficulty:"中等",rating:1519,situation:"自己做出",method:"dp/数学",learn:"",unknown:""},{date:"2023/3/30",no:"1637",name:"两点之间不包含任何点的最宽垂直区域",difficulty:"中等",rating:1486,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/3/31",no:"2367",name:"算术三元组的数目",difficulty:"简单",rating:1203,situation:"自己做出",method:"哈希/三指针",learn:"",unknown:""}],[{date:"2023/4/1",no:"831",name:"隐藏个人信息",difficulty:"中等",rating:1450,situation:"自己做出",method:"模拟/正则",learn:"",unknown:""},{date:"2023/4/2",no:"1039",name:"多边形三角剖分的最低得分",difficulty:"中等",rating:2130,situation:"看懂答案",method:"记忆化搜索/区间dp",learn:"记忆化搜索，区间dp",unknown:""},{date:"2023/4/3",no:"1053",name:"交换一次的先前排列",difficulty:"中等",rating:1633,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/4/4",no:"1000",name:"合并石头的最低成本",difficulty:"困难",rating:2422,situation:"看懂答案",method:"前缀和+ 记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/5",no:"2427",name:"公因子的数目",difficulty:"简单",rating:1172,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/4/6",no:"1017",name:"负二进制转换",difficulty:"中等",rating:1697,situation:"自己做出",method:"模拟/数学",learn:"",unknown:""},{date:"2023/4/7",no:"1040",name:"移动石子直到连续II",difficulty:"中等",rating:2455,situation:"没看懂答案",method:"构造+双指针",learn:"",unknown:""},{date:"2023/4/8",no:"1125",name:"最小的必要团队",difficulty:"困难",rating:2250,situation:"没看懂答案",method:"记忆化搜索/区间dp",learn:"",unknown:""},{date:"2023/4/9",no:"2399",name:"检查相同字母间的距离",difficulty:"简单",rating:1243,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/4/10",no:"1019",name:"链表中的下一个更大节点",difficulty:"中等",rating:1570,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2023/4/11",no:"1041",name:"困于环中的机器人",difficulty:"中等",rating:1541,situation:"看思路写出",method:"模拟/找规律",learn:"",unknown:""},{date:"2023/4/12",no:"1147",name:"段氏回文",difficulty:"困难",rating:1912,situation:"自己做出",method:"贪心+双指针 / 滚动哈希",learn:"",unknown:""},{date:"2023/4/13",no:"2404",name:"出现最频繁的偶数元素",difficulty:"简单",rating:1259,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/4/14",no:"1023",name:"驼峰式匹配",difficulty:"中等",rating:1537,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/4/15",no:"1042",name:"不邻接植花",difficulty:"中等",rating:1712,situation:"自己做出",method:"暴力",learn:"",unknown:""},{date:"2023/4/16",no:"1157",name:"子数组中占绝大多数的元素",difficulty:"困难",rating:2205,situation:"没看懂答案",method:"随机化+二分查找 / 摩尔投票+线段树 / wavelet树",learn:"wavelettree",unknown:""},{date:"2023/4/17",no:"2409",name:"统计共同度过的日子数",difficulty:"简单",rating:1562,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/4/18",no:"1026",name:"节点与其祖先之间的最大差值",difficulty:"中等",rating:1446,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/4/19",no:"1043",name:"分隔数组以得到最大和",difficulty:"中等",rating:1916,situation:"看思路写出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/20",no:"1187",name:"使数组严格递增",difficulty:"困难",rating:2315,situation:"没看懂答案",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/21",no:"2413",name:"最小偶倍数",difficulty:"简单",rating:1144,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/4/22",no:"1027",name:"最长等差数列",difficulty:"中等",rating:1758,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2022023/3/4",no:"1105",name:"填充书架",difficulty:"中等",rating:2014,situation:"自己做出",method:"记忆化搜索/dp",learn:"",unknown:""},{date:"2023/4/24",no:"1163",name:"按字典序排在最后的子串",difficulty:"困难",rating:1864,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/4/25",no:"2418",name:"按身高排序",difficulty:"简单",rating:1193,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/4/26",no:"1031",name:"两个非重叠子数组的最大和",difficulty:"中等",rating:1680,situation:"自己做出",method:"dp+滑动窗口 / 前缀和",learn:"",unknown:""},{date:"2023/4/27",no:"1048",name:"最长字符串链",difficulty:"中等",rating:1599,situation:"自己做出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/4/28",no:"1172",name:"餐盘栈",difficulty:"困难",rating:2109,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/4/29",no:"2423",name:"删除字符使频率相同",difficulty:"中等",rating:1648,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/4/30",no:"1033",name:"移动石子直到连续",difficulty:"中等",rating:1421,situation:"自己做出",method:"贪心",learn:"",unknown:""}],[{date:"2023/5/1",no:"1376",name:"通知所有员工所需的时间",difficulty:"中等",rating:1561,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/5/2",no:"970",name:"强整数",difficulty:"中等",rating:1338,situation:"自己做出",method:"枚举",learn:"",unknown:""},{date:"2023/5/3",no:"1003",name:"检查替换后的词是否有效",difficulty:"中等",rating:1426,situation:"自己做出",method:"栈",learn:"",unknown:""},{date:"2023/5/4",no:"2106",name:"摘水果",difficulty:"困难",rating:2062,situation:"自己做出",method:"滑动窗口/二分查找",learn:"",unknown:""},{date:"2023/5/5",no:"2432",name:"处理用时最长的那个任务的员工",difficulty:"简单",rating:1266,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/6",no:"1419",name:"数青蛙",difficulty:"中等",rating:1689,situation:"自己做出",method:"计数",learn:"",unknown:""},{date:"2023/5/7",no:"1010",name:"总持续时间可被60整除的歌曲",difficulty:"中等",rating:1377,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/5/8",no:"1263",name:"推箱子",difficulty:"困难",rating:2297,situation:"没看懂答案",method:"bfs+优先级队列",learn:"",unknown:""},{date:"2023/5/9",no:"2437",name:"有效时间的数目",difficulty:"简单",rating:1426,situation:"自己做出",method:"回溯/分类讨论",learn:"",unknown:""},{date:"2023/5/10",no:"1015",name:"可被K整除的最小整数",difficulty:"中等",rating:1874,situation:"自己做出",method:"转化",learn:"",unknown:""},{date:"2023/5/11",no:"1016",name:"子串能表示从 1 到 N 数字的二进制串",difficulty:"中等",rating:1779,situation:"看思路写出",method:"数学+滑动窗口+哈希 / 暴力",learn:"",unknown:""},{date:"2023/5/12",no:"1330",name:"翻转子数组得到最大的数组值",difficulty:"困难",rating:2481,situation:"看懂答案",method:"数学+转化",learn:"",unknown:""},{date:"2023/5/13",no:"2441",name:"与对应负数同时存在的最大正整数",difficulty:"困难",rating:1167,situation:"自己做出",method:"枚举/哈希/ 排序+双指针",learn:"",unknown:""},{date:"2023/5/14",no:"1054",name:"距离相等的条形码",difficulty:"中等",rating:1751,situation:"自己做出",method:"堆/计数",learn:"",unknown:""},{date:"2023/5/15",no:"1072",name:"按列翻转得到最大值等行数",difficulty:"中等",rating:1797,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2023/5/16",no:"1335",name:"工作计划的最低难度",difficulty:"困难",rating:2034,situation:"自己做出",method:"记忆化搜索/dp/单调栈",learn:"",unknown:""},{date:"2023/5/17",no:"2446",name:"判断两个事件是否存在冲突",difficulty:"困难",rating:1322,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/18",no:"1073",name:"负二进制数相加",difficulty:"中等",rating:1806,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/5/19",no:"1079",name:"活字印刷",difficulty:"中等",rating:1740,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/5/20",no:"1373",name:"二叉搜索子树的最大键值和",difficulty:"困难",rating:1913,situation:"没看懂答案",method:"递归",learn:"",unknown:""},{date:"2023/5/21",no:"LCP 33",name:"蓄水",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心+数学/优先级队列",learn:"",unknown:""},{date:"2023/5/22",no:"1080",name:"根到叶路径上的不足节点",difficulty:"中等",rating:1804,situation:"看懂答案",method:"dfs",learn:"",unknown:""},{date:"2023/5/23",no:"1090",name:"受标签影响的最大值",difficulty:"中等",rating:1501,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2023/5/24",no:"1377",name:"T秒后青蛙的位置",difficulty:"困难",rating:1823,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/5/25",no:"2451",name:"差值数组不同的字符串",slug:"odd-string-difference",difficulty:"简单",rating:1406,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/26",no:"1091",name:"二进制矩阵中的最短路径",slug:"shortest-path-in-binary-matrix",difficulty:"中等",rating:1658,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/5/27",no:"1093",name:"大样本统计",slug:"statistics-from-a-large-sample",difficulty:"中等",rating:1471,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/5/28",no:"1439",name:"有序矩阵中的第 k 个最小数组和",slug:"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",difficulty:"困难",rating:2133,situation:"自己做出",method:"二分查找+双指针+排序/ 优先级队列",learn:"",unknown:""},{date:"2023/5/29",no:"2455",name:"可被三整除的偶数的平均值",slug:"average-value-of-even-numbers-that-are-divisible-by-three",difficulty:"简单",rating:1151,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/5/30",no:"1110",name:"删点成林",slug:"delete-nodes-and-return-forest",difficulty:"简单",rating:1511,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/5/31",no:"1130",name:"叶值的最小代价生成树",slug:"minimum-cost-tree-from-leaf-values",difficulty:"中等",rating:1919,situation:"看懂答案",method:"记忆化搜索/区间dp/单调栈",learn:"",unknown:""}],[{date:"2023/6/1",no:"2517",name:"礼盒的最大甜蜜度",slug:"maximum-tastiness-of-candy-basket",difficulty:"中等",rating:2020,situation:"自己做出",method:"排序+二分",learn:"",unknown:""},{date:"2023/6/2",no:"2559",name:"统计范围内的元音字符串数",slug:"count-vowel-strings-in-ranges",difficulty:"中等",rating:1435,situation:"自己做出",method:"前缀和",learn:"",unknown:""},{date:"2023/6/3",no:"1156",name:"单字符重复子串的最大长度",slug:"swap-for-longest-repeated-character-substring",difficulty:"中等",rating:1787,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/6/4",no:"1156",name:"不同的平均值数目",slug:"number-of-distinct-averages",difficulty:"简单",rating:1250,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2023/6/5",no:"2460",name:"对数组执行操作",slug:"apply-operations-to-an-array",difficulty:"简单",rating:1223,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/6",no:"2352",name:"相等行列对",slug:"equal-row-and-column-pairs",difficulty:"中等",rating:1286,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/6/7",no:"2611",name:"老鼠和奶酪",slug:"mice-and-cheese",difficulty:"中等",rating:1663,situation:"自己做出",method:"排序+哈希",learn:"",unknown:""},{date:"2023/6/8",no:"1240",name:"铺瓷砖",slug:"tiling-a-rectangle-with-the-fewest-squares",difficulty:"困难",rating:2241,situation:"没看懂答案",method:"回溯",learn:"",unknown:""},{date:"2023/6/9",no:"2699",name:"修改图中的边权",slug:"modify-graph-edge-weights",difficulty:"困难",rating:2873,situation:"没看懂答案",method:"二分+迪杰斯特拉",learn:"",unknown:""},{date:"2023/6/10",no:"1170",name:"比较字符串最小字母出现频次",slug:"compare-strings-by-frequency-of-the-smallest-character",difficulty:"中等",rating:1431,situation:"自己做出",method:"排序/后缀和",learn:"",unknown:""},{date:"2023/6/11",no:"1171",name:"从链表中删去总和值为零的连续节点",slug:"remove-zero-sum-consecutive-nodes-from-linked-list",difficulty:"中等",rating:1782,situation:"看懂答案",method:"哈希",learn:"",unknown:""},{date:"2023/6/12",no:"1483",name:"树节点的第 K 个祖先",slug:"kth-ancestor-of-a-tree-node",difficulty:"困难",rating:2115,situation:"看懂答案",method:"倍增",learn:"倍增",unknown:""},{date:"2023/6/13",no:"2475",name:"数组中不等三元组的数目",slug:"number-of-unequal-triplets-in-array",difficulty:"简单",rating:1255,situation:"自己做出",method:"模拟/排序/哈希",learn:"",unknown:""},{date:"2023/6/14",no:"1375",name:"二进制字符串前缀一致的次数",slug:"number-of-times-binary-string-is-prefix-aligned",difficulty:"中等",rating:1438,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/15",no:"1177",name:"构建回文串检测",slug:"can-make-palindrome-from-substring",difficulty:"中等",rating:1848,situation:"看懂答案",method:"转化+前缀数组+位运算",learn:"位运算",unknown:""},{date:"2023/6/16",no:"1494",name:"并行课程 II",slug:"parallel-courses-ii",difficulty:"困难",rating:2081,situation:"没看懂答案",method:"dp+状态压缩+子集",learn:"",unknown:""},{date:"2023/6/17",no:"2481",name:"分割圆的最少切割次数",slug:"minimum-cuts-to-divide-a-circle",difficulty:"简单",rating:1246,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/18",no:"1254",name:"统计封闭岛屿的数目",slug:"number-of-closed-islands",difficulty:"中等",rating:1658,situation:"自己做出",method:"bfs/dfs/并查集",learn:"",unknown:""},{date:"2023/6/19",no:"1262",name:"可被三整除的最大和",slug:"greatest-sum-divisible-by-three",difficulty:"中等",rating:1762,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/6/20",no:"1595",name:"连通两组点的最小成本",slug:"minimum-cost-to-connect-two-groups-of-points",difficulty:"困难",rating:2537,situation:"没看懂答案",method:"状态压缩+动态规划",learn:"",unknown:""},{date:"2023/6/21",no:"LCP 41",name:"黑白翻转棋",slug:"fHi6rV",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/6/22",no:"面试题16.19",name:"水域大小",slug:"pond-sizes-lcci",difficulty:"中等",rating:null,situation:"自己做出",method:"dfs/bfs + 排序",learn:"",unknown:""},{date:"2023/6/23",no:"2496",name:"数组中字符串的最大值",slug:"maximum-value-of-a-string-in-an-array",difficulty:"简单",rating:1292,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/6/24",no:"1659",name:"最大化网格幸福感",slug:"maximize-grid-happiness",difficulty:"困难",rating:2655,situation:"没看懂答案",method:"状态压缩+dp",learn:"",unknown:""},{date:"2023/6/25",no:"1401",name:"圆和矩形是否有重叠",slug:"circle-and-rectangle-overlapping",difficulty:"中等",rating:1701,situation:"自己做出",method:"数学+分类讨论",learn:"",unknown:""},{date:"2023/6/26",no:"2485",name:"找出中枢整数",slug:"find-the-pivot-integer",difficulty:"简单",rating:1207,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/6/27",no:"1186",name:"删除一次得到子数组最大和",slug:"maximum-subarray-sum-with-one-deletion",difficulty:"中等",rating:1799,situation:"看思路写出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/6/28",no:"1681",name:"最小不兼容性",slug:"minimum-incompatibility",difficulty:"困难",rating:2389,situation:"没看懂答案",method:"dp+状态压缩+子集",learn:"",unknown:""},{date:"2023/6/29",no:"1253",name:"重构 2 行二进制矩阵",slug:"reconstruct-a-2-row-binary-matrix",difficulty:"中等",rating:1505,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/6/30",no:"2490",name:"回环句",slug:"circular-sentence",difficulty:"简单",rating:1262,situation:"自己做出",method:"",learn:"",unknown:""}],[{date:"2023/7/1",no:"1",name:"两数之和",slug:"two-sum",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"2023/7/2",no:"2",name:"两数相加",slug:"add-two-numbers",difficulty:"中等",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""},{date:"2023/7/3",no:"445",name:"两数相加II",slug:"add-two-numbers-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"链表+栈",learn:"",unknown:""},{date:"2023/7/4",no:"2679",name:"矩阵中的和",slug:"sum-in-a-matrix",difficulty:"中等",rating:1333,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/7/5",no:"2600",name:"K 件物品的最大和",slug:"k-items-with-the-maximum-sum",difficulty:"中等",rating:1434,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/7/6",no:"2178",name:"拆分成最多数目的正偶数之和",slug:"maximum-split-of-positive-even-integers",difficulty:"中等",rating:1537,situation:"自己做出",method:"贪心+数学",learn:"",unknown:""},{date:"2023/7/7",no:"2532",name:"过桥的时间",slug:"time-to-cross-a-bridge",difficulty:"困难",rating:2588,situation:"没看懂答案",method:"模拟+优先级队列",learn:"",unknown:""},{date:"2023/7/8",no:"167",name:"两数之和 II - 输入有序数组",slug:"two-sum-ii-input-array-is-sorted",difficulty:"中等",rating:null,situation:"自己做出",method:"二分查找/双指针",learn:"",unknown:""},{date:"2023/7/9",no:"15",name:"三数之和",slug:"3sum",difficulty:"中等",rating:null,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2023/7/10",no:"16",name:"最接近的三数之和",slug:"3sum-closest",difficulty:"中等",rating:null,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2023/7/11",no:"1911",name:"最大子序列交替和",slug:"maximum-alternating-subsequence-sum",difficulty:"中等",rating:1785,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/7/12",no:"2544",name:"交替数字和",slug:"alternating-digit-sum",difficulty:"简单",rating:1184,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/7/13",no:"931",name:"下降路径最小和",slug:"minimum-falling-path-sum",difficulty:"中等",rating:1573,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/7/14",no:"979",name:"在二叉树中分配硬币",slug:"distribute-coins-in-binary-tree",difficulty:"中等",rating:1709,situation:"看懂答案",method:"dfs",learn:"",unknown:""},{date:"2023/7/15",no:"18",name:"四数之和",slug:"4sum",difficulty:"中等",rating:null,situation:"自己做出",method:"排序+双指针",learn:"",unknown:""},{date:"2023/7/16",no:"834",name:"树中距离之和",slug:"sum-of-distances-in-tree",difficulty:"困难",rating:2197,situation:"没看懂答案",method:"树形dp",learn:"",unknown:""},{date:"2023/7/17",no:"415",name:"字符串相加",slug:"add-strings",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/7/18",no:"1851",name:"包含每个查询的最小区间",slug:"minimum-interval-to-include-each-query",difficulty:"困难",rating:2286,situation:"没看懂答案",method:"优先级队列",learn:"",unknown:""},{date:"2023/7/19",no:"874",name:"模拟行走机器人",slug:"walking-robot-simulation",difficulty:"中等",rating:1846,situation:"看思路写出",method:"模拟+哈希表",learn:"",unknown:""},{date:"2023/7/20",no:"918",name:"环形子数组的最大和",slug:"maximum-sum-circular-subarray",difficulty:"中等",rating:1777,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/7/21",no:"1499",name:"满足不等式的最大值",slug:"max-value-of-equation",difficulty:"困难",rating:2456,situation:"看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/7/22",no:"860",name:"柠檬水找零",slug:"lemonade-change",difficulty:"简单",rating:1285,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/7/23",no:"42",name:"接雨水",slug:"trapping-rain-water",difficulty:"困难",rating:null,situation:"看思路写出",method:"dp/单调栈/双指针",learn:"",unknown:""},{date:"2023/7/24",no:"771",name:"宝石与石头",slug:"jewels-and-stones",difficulty:"简单",rating:1164,situation:"自己做出",method:"哈希表/位运算",learn:"",unknown:""},{date:"2023/7/25",no:"771",name:"将数组和减半的最少操作次数",slug:"minimum-operations-to-halve-array-sum",difficulty:"中等",rating:1550,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/7/26",no:"2569",name:"更新数组后处理求和查询",slug:"handling-sum-queries-after-update",difficulty:"困难",rating:2397,situation:"没看懂答案",method:"线段树",learn:"",unknown:""},{date:"2023/7/27",no:"2500",name:"删除每行中的最大值",slug:"delete-greatest-value-in-each-row",difficulty:"简单",rating:1309,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/7/28",no:"2050",name:"并行课程 III",slug:"parallel-courses-iii",difficulty:"困难",rating:2084,situation:"看懂答案",method:"拓扑排序(+记忆化搜索)",learn:"",unknown:""},{date:"2023/7/29",no:"141",name:"环形链表",slug:"linked-list-cycle",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希表/快慢指针",learn:"",unknown:""},{date:"2023/7/30",no:"142",name:"环形链表 II",slug:"linked-list-cycle-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希表/快慢指针",learn:"",unknown:""},{date:"2023/7/31",no:"143",name:"重排链表",slug:"reorder-list",difficulty:"中等",rating:null,situation:"自己做出",method:"链表",learn:"",unknown:""}],[{date:"2023/8/1",no:"2681",name:"英雄的力量",slug:"power-of-heroes",difficulty:"困难",rating:2060,situation:"看思路写出",method:"动态规划/数学",learn:"BigInt",unknown:""},{date:"2023/8/2",no:"822",name:"翻转卡片游戏",slug:"card-flipping-game",difficulty:"中等",rating:1594,situation:"自己做出",method:"转化+哈希",learn:"",unknown:""},{date:"2023/8/3",no:"722",name:"删除注释",slug:"remove-comments",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟/正则",learn:"正则技巧",unknown:""},{date:"2023/8/4",no:"980",name:"不同路径 III",slug:"unique-paths-iii",difficulty:"困难",rating:1830,situation:"自己做出",method:"回溯/ 状态压缩+记忆化搜索",learn:"",unknown:""},{date:"2023/8/5",no:"21",name:"合并两个有序链表",slug:"merge-two-sorted-lists",difficulty:"简单",rating:null,situation:"自己做出",method:"双指针/递归",learn:"",unknown:""},{date:"2023/8/6",no:"24",name:"两两交换链表中的节点",slug:"swap-nodes-in-pairs",difficulty:"中等",rating:null,situation:"自己做出",method:"双指针/递归",learn:"",unknown:""},{date:"2023/8/7",no:"344",name:"反转字符串",slug:"reverse-string",difficulty:"简单",rating:null,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/8/8",no:"1749",name:"反转字符串",slug:"任意子数组和的绝对值的最大值",difficulty:"中等",rating:1541,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/8/9",no:"1281",name:"整数的各位积和之差",slug:"subtract-the-product-and-sum-of-digits-of-an-integer",difficulty:"简单",rating:1141,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/10",no:"1289",name:"下降路径最小和 II",slug:"minimum-falling-path-sum-ii",difficulty:"困难",rating:1697,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/8/11",no:"1572",name:"矩阵对角线元素的和",slug:"matrix-diagonal-sum",difficulty:"简单",rating:1280,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/12",no:"23",name:"合并K个升序链表",slug:"merge-k-sorted-lists",difficulty:"困难",rating:null,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/8/13",no:"88",name:"合并两个有序数组",slug:"merge-sorted-array",difficulty:"简单",rating:null,situation:"自己做出",method:"排序/双指针",learn:"",unknown:""},{date:"2023/8/14",no:"617",name:"合并二叉树",slug:"merge-two-binary-trees",difficulty:"简单",rating:null,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/8/15",no:"833",name:"字符串中的查找与替换",slug:"find-and-replace-in-string",difficulty:"中等",rating:1460,situation:"自己做出",method:"排序/哈希表",learn:"",unknown:""},{date:"2023/8/16",no:"2682",name:"找出转圈游戏输家",slug:"find-the-losers-of-the-circular-game",difficulty:"简单",rating:1382,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/17",no:"1444",name:"切披萨的方案数",slug:"find-the-losers-of-the-circular-game",difficulty:"困难",rating:2126,situation:"没看懂答案",method:"dp",learn:"",unknown:""},{date:"2023/8/18",no:"1388",name:"3n块披萨",slug:"pizza-with-3n-slices",difficulty:"困难",rating:2409,situation:"没看懂答案",method:"转化+dp",learn:"",unknown:""},{date:"2023/8/19",no:"2235",name:"两整数相加",slug:"add-two-integers",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/8/20",no:"2236",name:"判断根结点是否等于子结点之和",slug:"root-equals-sum-of-children",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/8/21",no:"2337",name:"移动片段得到字符串",slug:"move-pieces-to-obtain-a-string",difficulty:"中等",rating:1697,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/8/22",no:"849",name:"到最近的人的最大距离",slug:"maximize-distance-to-closest-person",difficulty:"中等",rating:1382,situation:"自己做出",method:"双指针",learn:"",unknown:""},{date:"2023/8/23",no:"1782",name:"统计点对的数目",slug:"count-pairs-of-nodes",difficulty:"困难",rating:2457,situation:"看懂答案",method:"转化+哈希表+排序+二分查找/双指针",learn:"",unknown:""},{date:"2023/8/24",no:"1267",name:"统计参与通信的服务器",slug:"count-servers-that-communicate",difficulty:"中等",rating:1374,situation:"自己做出",method:"哈希表",learn:"",unknown:""},{date:"2023/8/25",no:"1448",name:"统计二叉树中好节点的数目",slug:"count-good-nodes-in-binary-tree",difficulty:"中等",rating:1360,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/8/26",no:"228",name:"汇总区间",slug:"summary-ranges",difficulty:"简单",rating:null,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/8/27",no:"56",name:"合并区间",slug:"merge-intervals",difficulty:"中等",rating:null,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/8/28",no:"57",name:"插入区间",slug:"insert-interval",difficulty:"中等",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/8/29",no:"823",name:"带因子的二叉树",slug:"binary-trees-with-factors",difficulty:"中等",rating:1899,situation:"自己做出",method:"数学+dp",learn:"",unknown:""},{date:"2023/8/30",no:"1654",name:"到家的最少跳跃次数",slug:"minimum-jumps-to-reach-home",difficulty:"中等",rating:2124,situation:"看思路写出",method:"bfs",learn:"",unknown:""},{date:"2023/8/31",no:"143",name:"重排链表",slug:"reorder-list",difficulty:"中等",rating:null,situation:"自己做出",method:"链表+（快慢指针）",learn:"",unknown:""}],[{date:"2023/9/1",no:"2240",name:"买钢笔和铅笔的方案数",slug:"number-of-ways-to-buy-pens-and-pencils",difficulty:"中等",rating:1399,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/9/2",no:"2511",name:"最多可以摧毁的敌人城堡数目",slug:"maximum-enemy-forts-that-can-be-captured",difficulty:"简单",rating:1450,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/9/3",no:"1921",name:"消灭怪物的最大数量",slug:"eliminate-maximum-number-of-monsters",difficulty:"中等",rating:1527,situation:"自己做出",method:"贪心+排序",learn:"",unknown:""},{date:"2023/9/4",no:"449",name:"序列化和反序列化二叉搜索树",slug:"serialize-and-deserialize-bst",difficulty:"中等",rating:null,situation:"自己做出",method:"中序遍历/后序遍历",learn:"",unknown:""},{date:"2023/9/5",no:"2605",name:"从两个数字数组里生成最小数字",slug:"form-smallest-number-from-two-digit-arrays",difficulty:"简单",rating:1241,situation:"自己做出",method:"哈希表/状态压缩",learn:"",unknown:""},{date:"2023/9/6",no:"1123",name:"最深叶节点的最近公共祖先",slug:"lowest-common-ancestor-of-deepest-leaves",difficulty:"中等",rating:1607,situation:"自己做出",method:"递归",learn:"",unknown:""},{date:"2023/9/7",no:"2594",name:"修车的最少时间",slug:"minimum-time-to-repair-cars",difficulty:"中等",rating:1915,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/9/8",no:"2651",name:"计算列车到站时间",slug:"calculate-delayed-arrival-time",difficulty:"简单",rating:1168,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/9/9",no:"207",name:"课程表",slug:"course-schedule",difficulty:"中等",rating:null,situation:"自己做出",method:"拓扑排序",learn:"",unknown:""},{date:"2023/9/10",no:"210",name:"课程表 II",slug:"course-schedule-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"拓扑排序",learn:"",unknown:""},{date:"2023/9/11",no:"630",name:"课程表 III",slug:"course-schedule-iii",difficulty:"困难",rating:null,situation:"看懂答案",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2023/9/12",no:"1462",name:"课程表 IV",slug:"course-schedule-iv",difficulty:"中等",rating:1692,situation:"自己做出",method:"拓扑排序",learn:"",unknown:""},{date:"2023/9/13",no:"2596",name:"检查骑士巡视方案",slug:"check-knight-tour-configuration",difficulty:"中等",rating:1448,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/9/14",no:"1222",name:"可以攻击国王的皇后",slug:"queens-that-can-attack-the-king",difficulty:"中等",rating:1391,situation:"自己做出",method:"模拟+哈希",learn:"",unknown:""},{date:"2023/9/15",no:"LCP 50",name:"宝石补给",slug:"WHnhjV",difficulty:"简单",rating:null,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/9/16",no:"198",name:"打家劫舍",slug:"house-robber",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/9/17",no:"212",name:"打家劫舍 II",slug:"house-robber-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/9/18",no:"337",name:"打家劫舍 III",slug:"house-robber-iii",difficulty:"中等",rating:null,situation:"自己做出",method:"树形dp",learn:"",unknown:""},{date:"2023/9/19",no:"2560",name:"打家劫舍 IV",slug:"house-robber-iv",difficulty:"中等",rating:2081,situation:"看思路写出",method:"二分+ 贪心/dp",learn:"",unknown:""},{date:"2023/9/20",no:"LCP 06",name:"拿硬币",slug:"na-ying-bi",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/9/21",no:"2603",name:"收集树中金币",slug:"collect-coins-in-a-tree",difficulty:"困难",rating:2711,situation:"看懂答案",method:"转化+拓扑排序",learn:"",unknown:""},{date:"2023/9/22",no:"2591",name:"将钱分给最多的儿童",slug:"distribute-money-to-maximum-children",difficulty:"简单",rating:1530,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/9/23",no:"1993",name:"树上的操作",slug:"operations-on-tree",difficulty:"中等",rating:1861,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/9/24",no:"146",name:"LRU 缓存",slug:"lru-cache",difficulty:"中等",rating:null,situation:"自己做出",method:"双向链表+hash",learn:"复习LRU 缓存",unknown:""},{date:"2023/9/25",no:"460",name:"LFU 缓存",slug:"lfu-cache",difficulty:"困难",rating:null,situation:"看懂答案",method:"哈希",learn:"LFU缓存",unknown:""},{date:"2023/9/26",no:"2582",name:"递枕头",slug:"pass-the-pillow",difficulty:"简单",rating:1378,situation:"自己做出",method:"模拟（+数学）",learn:"",unknown:""},{date:"2023/9/27",no:"1333",name:"餐厅过滤器",slug:"filter-restaurants-by-vegan-friendly-price-and-distance",difficulty:"中等",rating:1423,situation:"自己做出",method:"排序",learn:"",unknown:""},{date:"2023/9/28",no:"2251",name:"花期内花的数目",slug:"number-of-flowers-in-full-bloom",difficulty:"困难",rating:2022,situation:"自己做出",method:"线段树/ 差分数组+离线查询 / 排序+二分",learn:"",unknown:"差分数组+离线查询"},{date:"2023/9/29",no:"605",name:"种花问题",slug:"can-place-flowers",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/9/30",no:"2136",name:"全部开花的最早一天",slug:"earliest-possible-day-of-full-bloom",difficulty:"困难",rating:2033,situation:"自己做出",method:"贪心+排序",learn:"",unknown:""}],[{date:"2023/10/1",no:"121",name:"买卖股票的最佳时机",slug:"best-time-to-buy-and-sell-stock",difficulty:"简单",rating:null,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/10/2",no:"122",name:"买卖股票的最佳时机 II",slug:"best-time-to-buy-and-sell-stock-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"dp/贪心",learn:"",unknown:""},{date:"2023/10/3",no:"123",name:"买卖股票的最佳时机 III",slug:"best-time-to-buy-and-sell-stock-iii",difficulty:"困难",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/4",no:"188",name:"买卖股票的最佳时机 IV",slug:"best-time-to-buy-and-sell-stock-iv",difficulty:"困难",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/5",no:"309",name:"买卖股票的最佳时机含冷冻期",slug:"best-time-to-buy-and-sell-stock-with-cooldown",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/6",no:"714",name:"买卖股票的最佳时机含手续费",slug:"best-time-to-buy-and-sell-stock-with-transaction-fee",difficulty:"中等",rating:null,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/10/7",no:"901",name:"股票价格跨度",slug:"online-stock-span",difficulty:"中等",rating:1708,situation:"自己做出",method:"单调栈",learn:"",unknown:""},{date:"2023/10/8",no:"2034",name:"股票价格波动",slug:"stock-price-fluctuation",difficulty:"中等",rating:1831,situation:"看懂答案",method:"哈希+ 优先级队列/有序集合",learn:"",unknown:""},{date:"2023/10/9",no:"2578",name:"最小和分割",slug:"split-with-minimum-sum",difficulty:"简单",rating:1350,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/10/10",no:"2731",name:"移动机器人",slug:"movement-of-robots",difficulty:"中等",rating:1922,situation:"看懂答案",method:"转化+排序+数学",learn:"",unknown:""},{date:"2023/10/11",no:"2512",name:"奖励最顶尖的 K 名学生",slug:"reward-top-k-students",difficulty:"中等",rating:1636,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/10/12",no:"2562",name:"找出数组的串联值",slug:"find-the-array-concatenation-value",difficulty:"简单",rating:1259,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/13",no:"1488",name:"避免洪水泛滥",slug:"find-the-array-concatenation-value",difficulty:"中等",rating:1973,situation:"看思路写出",method:"贪心+二分/优先级队列",learn:"",unknown:""},{date:"2023/10/14",no:"136",name:"只出现一次的数字",slug:"single-number",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希/异或",learn:"",unknown:""},{date:"2023/10/15",no:"137",name:"只出现一次的数字 II",slug:"single-number-ii",difficulty:"简单",rating:null,situation:"自己做出",method:"哈希/位运算",learn:"位运算计数",unknown:""},{date:"2023/10/16",no:"260",name:"只出现一次的数字 III",slug:"single-number-iii",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希/位运算",learn:"位运算计数",unknown:""},{date:"2023/10/17",no:"2652",name:"倍数求和",slug:"sum-multiples",difficulty:"简单",rating:1182,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/10/18",no:"2530",name:"执行 K 次操作后的最大分数",slug:"maximal-score-after-applying-k-operations",difficulty:"简单",rating:1386,situation:"自己做出",method:"优先级队列",learn:"",unknown:""},{date:"2023/10/19",no:"1726",name:"同积元组",slug:"tuple-with-same-product",difficulty:"中等",rating:1530,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/10/20",no:"2525",name:"根据规则将箱子分类",slug:"categorize-box-according-to-criteria",difficulty:"中等",rating:1301,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/21",no:"2316",name:"统计无向图中无法互相到达点对数",slug:"count-unreachable-pairs-of-nodes-in-an-undirected-graph",difficulty:"中等",rating:1604,situation:"自己做出",method:"并查集/dfs",learn:"",unknown:""},{date:"2023/10/22",no:"1402",name:"做菜顺序",slug:"reducing-dishes",difficulty:"困难",rating:1679,situation:"自己做出",method:"dp/贪心",learn:"",unknown:""},{date:"2023/10/23",no:"2678",name:"老人的数目",slug:"number-of-senior-citizens",difficulty:"简单",rating:1198,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/24",no:"1155",name:"掷骰子等于目标和的方法数",slug:"number-of-dice-rolls-with-target-sum",difficulty:"中等",rating:1653,situation:"自己做出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/10/25",no:"2698",name:"求一个整数的惩罚数",slug:"find-the-punishment-number-of-an-integer",difficulty:"中等",rating:1678,situation:"自己做出",method:"回溯",learn:"",unknown:""},{date:"2023/10/26",no:"2520",name:"统计能整除数字的位数",slug:"count-the-digits-that-divide-a-number",difficulty:"简单",rating:1260,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/10/27",no:"1465",name:"切割后面积最大的蛋糕",slug:"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",difficulty:"中等",rating:1444,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/10/28",no:"2558",name:"从数量最多的堆取走礼物",slug:"take-gifts-from-the-richest-pile",difficulty:"简单",rating:1276,situation:"自己做出",method:"堆",learn:"",unknown:""},{date:"2023/10/29",no:"274",name:"H指数",slug:"h-index",difficulty:"简单",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/10/30",no:"275",name:"H指数 II",slug:"h-index-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:"另一种二分写法"},{date:"2023/10/31",no:"2003",name:"每棵子树内缺失的最小基因值",slug:"smallest-missing-genetic-value-in-each-subtree",difficulty:"困难",rating:2415,situation:"没看懂答案",method:"dfs+（启发式合并）",learn:"",unknown:""}],[{date:"2023/11/1",no:"2127",name:"参加会议的最多员工数",slug:"maximum-employees-to-be-invited-to-a-meeting",difficulty:"困难",rating:2449,situation:"自己做出",method:"分类讨论+拓扑排序",learn:"",unknown:""},{date:"2023/11/2",no:"2103",name:"环和杆",slug:"rings-and-rods",difficulty:"简单",rating:1257,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/11/3",no:"117",name:"填充每个节点的下一个右侧节点指针 II",slug:"populating-next-right-pointers-in-each-node-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"bfs",learn:"",unknown:""},{date:"2023/11/4",no:"421",name:"数组中两个数的最大异或值",slug:"maximum-xor-of-two-numbers-in-an-array",difficulty:"中等",rating:null,situation:"看懂答案",method:"哈希/字典树",learn:"异或题可以多往答案的每一位思考，想想字典树",unknown:""},{date:"2023/11/5",no:"187",name:"重复的DNA序列",slug:"repeated-dna-sequences",difficulty:"中等",rating:null,situation:"自己做出",method:"哈希（+状态压缩）",learn:"",unknown:""},{date:"2023/11/6",no:"318",name:"最大单词长度乘积",slug:"maximum-product-of-word-lengths",difficulty:"中等",rating:null,situation:"自己做出",method:"位运算",learn:"",unknown:""},{date:"2023/11/7",no:"2586",name:"统计范围内的元音字符串数",slug:"count-the-number-of-vowel-strings-in-range",difficulty:"简单",rating:1178,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/11/8",no:"2609",name:"最长平衡子字符串",slug:"find-the-longest-balanced-substring-of-a-binary-string",difficulty:"简单",rating:1348,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/11/9",no:"2258",name:"逃离火灾",slug:"find-the-longest-balanced-substring-of-a-binary-string",difficulty:"困难",rating:2346,situation:"自己做出",method:"bfs（+二分查找）",learn:"",unknown:""},{date:"2023/11/10",no:"2300",name:"咒语和药水的成功对数",slug:"successful-pairs-of-spells-and-potions",difficulty:"中等",rating:1476,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/11/11",no:"765",name:"情侣牵手",slug:"couples-holding-hands",difficulty:"困难",rating:1999,situation:"看懂答案",method:"并查集",learn:"从数组到节点的方式",unknown:""},{date:"2023/11/12",no:"715",name:"Range模块",slug:"range-module",difficulty:"困难",rating:null,situation:"看懂答案",method:"有序集合/线段树",learn:"复习线段树",unknown:""},{date:"2023/11/13",no:"307",name:"区域和检索 - 数组可修改",slug:"range-sum-query-mutable",difficulty:"中等",rating:null,situation:"看懂答案",method:"树状数组/线段树",learn:"复习线段树",unknown:""},{date:"2023/11/14",no:"1334",name:"阈值距离内邻居最少的城市",slug:"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",difficulty:"中等",rating:1854,situation:"自己做出",method:"bfs/floyd/dijkstra",learn:"",unknown:""},{date:"2023/11/15",no:"2656",name:"K 个元素的最大和",slug:"maximum-sum-with-exactly-k-elements",difficulty:"简单",rating:1213,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/11/16",no:"2760",name:"最长奇偶子数组",slug:"longest-even-odd-subarray-with-threshold",difficulty:"简单",rating:1420,situation:"自己做出",method:"枚举/dp",learn:"",unknown:""},{date:"2023/11/17",no:"2736",name:"最大和查询",slug:"maximum-sum-queries",difficulty:"困难",rating:2533,situation:"看懂答案",method:"单调栈+二分查找",learn:"",unknown:""},{date:"2023/11/18",no:"2342",name:"数位和相等数对的最大和",slug:"max-sum-of-a-pair-with-equal-sum-of-digits",difficulty:"中等",rating:1308,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/11/19",no:"689",name:"三个无重叠子数组的最大和",slug:"maximum-sum-of-3-non-overlapping-subarrays",difficulty:"困难",rating:null,situation:"没看懂答案",method:"滑动窗口/dp",learn:"",unknown:""},{date:"2023/11/20",no:"53",name:"最大子数组和",slug:"maximum-subarray",difficulty:"中等",rating:null,situation:"自己做出",method:"dp/分治",learn:"",unknown:""},{date:"2023/11/21",no:"2216",name:"最大子数组和",slug:"minimum-deletions-to-make-array-beautiful",difficulty:"中等",rating:1509,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/11/22",no:"2304",name:"网格中的最小路径代价",slug:"minimum-path-cost-in-a-grid",difficulty:"中等",rating:1658,situation:"自己做出",method:"dp/记忆化搜索",learn:"",unknown:""},{date:"2023/11/23",no:"1410",name:"HTML 实体解析器",slug:"html-entity-parser",difficulty:"中等",rating:1405,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/11/24",no:"2824",name:"统计和小于目标的下标对数目",slug:"count-pairs-whose-sum-is-less-than-target",difficulty:"简单",rating:1165,situation:"自己做出",method:"二分/双指针",learn:"",unknown:""},{date:"2023/11/25",no:"1457",name:"二叉树中的伪回文路径",slug:"pseudo-palindromic-paths-in-a-binary-tree",difficulty:"中等",rating:1405,situation:"自己做出",method:"dfs",learn:"",unknown:""},{date:"2023/11/26",no:"828",name:"统计子串中的唯一字符",slug:"count-unique-characters-of-all-substrings-of-a-given-string",difficulty:"困难",rating:2034,situation:"自己做出",method:"贡献法",learn:"",unknown:""},{date:"2023/11/27",no:"907",name:"子数组的最小值之和",slug:"sum-of-subarray-minimums",difficulty:"中等",rating:1975,situation:"自己做出",method:"贡献法+单调栈/dp",learn:"",unknown:""},{date:"2023/11/28",no:"1670",name:"设计前中后队列",slug:"design-front-middle-back-queue",difficulty:"中等",rating:1610,situation:"自己做出",method:"双端队列/模拟",learn:"",unknown:""},{date:"2023/11/29",no:"2336",name:"无限集中的最小数字",slug:"smallest-number-in-infinite-set",difficulty:"中等",rating:1375,situation:"自己做出",method:"模拟/优先级队列",learn:"",unknown:""},{date:"2023/11/30",no:"1657",name:"确定两个字符串是否接近",slug:"determine-if-two-strings-are-close",difficulty:"中等",rating:1530,situation:"自己做出",method:"计数",learn:"",unknown:""}],[{date:"2023/12/1",no:"2661",name:"无限集中的最小数字",slug:"first-completely-painted-row-or-column",difficulty:"中等",rating:1502,situation:"自己做出",method:"哈希",learn:"",unknown:""},{date:"2023/12/2",no:"2661",name:"拼车",slug:"car-pooling",difficulty:"中等",rating:1441,situation:"自己做出",method:"差分",learn:"",unknown:""},{date:"2023/12/3",no:"1423",name:"可获得的最大点数",slug:"maximum-points-you-can-obtain-from-cards",difficulty:"中等",rating:1573,situation:"自己做出",method:"滑动窗口",learn:"",unknown:""},{date:"2023/12/4",no:"1038",name:"可获得的最大点数",slug:"binary-search-tree-to-greater-sum-tree",difficulty:"中等",rating:1374,situation:"自己做出",method:"morris遍历/逆序中序遍历",learn:"",unknown:"morris遍历"},{date:"2023/12/5",no:"2477",name:"到达首都的最少油耗",slug:"minimum-fuel-cost-to-report-to-the-capital",difficulty:"中等",rating:2011,situation:"看懂答案",method:"贪心+dfs",learn:"",unknown:""},{date:"2023/12/6",no:"2646",name:"最小化旅行的价格总和",slug:"minimize-the-total-price-of-the-trips",difficulty:"困难",rating:2238,situation:"没看懂答案",method:"dfs+dp",learn:"",unknown:""},{date:"2023/12/7",no:"1466",name:"重新规划路线",slug:"reorder-routes-to-make-all-paths-lead-to-the-city-zero",difficulty:"中等",rating:1633,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/12/8",no:"2008",name:"出租车的最大盈利",slug:"reorder-routes-to-make-all-paths-lead-to-the-city-zero",difficulty:"中等",rating:1871,situation:"自己做出",method:"dp+二分",learn:"",unknown:""},{date:"2023/12/9",no:"2048",name:"下一个更大的数值平衡数",slug:"next-greater-numerically-balanced-number",difficulty:"中等",rating:1734,situation:"自己做出",method:"枚举",learn:"",unknown:""},{date:"2023/12/10",no:"70",name:"爬楼梯",slug:"climbing-stairs",difficulty:"简单",rating:null,situation:"自己做出",method:"dp/矩阵快速幂",learn:"",unknown:""},{date:"2023/12/11",no:"1631",name:"最小体力消耗路径",slug:"path-with-minimum-effort",difficulty:"简单",rating:1947,situation:"自己做出",method:"二分查找+bfs / 并查集 / 迪杰斯特拉算法",learn:"",unknown:"迪杰斯特拉算法"},{date:"2023/12/12",no:"2454",name:"下一个更大元素 IV",slug:"next-greater-element-iv",difficulty:"困难",rating:2175,situation:"看懂答案",method:"单调栈（+优先级队列）",learn:"",unknown:""},{date:"2023/12/13",no:"2697",name:"字典序最小回文串",slug:"lexicographically-smallest-palindrome",difficulty:"简单",rating:1303,situation:"自己做出",method:"贪心",learn:"",unknown:""},{date:"2023/12/14",no:"2132",name:"用邮票贴满网格图",slug:"stamping-the-grid",difficulty:"困难",rating:2364,situation:"没看懂答案",method:"二维前缀和+二维差分",learn:"",unknown:""},{date:"2023/12/15",no:"2415",name:"反转二叉树的奇数层",slug:"reverse-odd-levels-of-binary-tree",difficulty:"困难",rating:1431,situation:"自己做出",method:"dfs/bfs",learn:"",unknown:""},{date:"2023/12/16",no:"2276",name:"统计区间中的整数数目",slug:"count-integers-in-intervals",difficulty:"困难",rating:2222,situation:"自己做出",method:"平衡二叉搜索树/线段树",learn:"复习线段树",unknown:""},{date:"2023/12/17",no:"746",name:"使用最小花费爬楼梯",slug:"min-cost-climbing-stairs",difficulty:"简单",rating:1358,situation:"自己做出",method:"dp",learn:"",unknown:""},{date:"2023/12/18",no:"162",name:"寻找峰值",slug:"find-peak-element",difficulty:"简单",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:""},{date:"2023/12/19",no:"1901",name:"寻找峰值 II",slug:"find-a-peak-element-ii",difficulty:"中等",rating:null,situation:"自己做出",method:"二分",learn:"",unknown:"二分方法"},{date:"2023/12/20",no:"2828",name:"判别首字母缩略词",slug:"check-if-a-string-is-an-acronym-of-words",difficulty:"简单",rating:1151,situation:"自己做出",method:"",learn:"",unknown:""},{date:"2023/12/21",no:"2866",name:"美丽塔 II",slug:"beautiful-towers-ii",difficulty:"中等",rating:2071,situation:"看懂答案",method:"单调栈",learn:"",unknown:""},{date:"2023/12/22",no:"1671",name:"得到山形数组的最少删除次数",slug:"minimum-number-of-removals-to-make-mountain-array",difficulty:"困难",rating:1912,situation:"没看懂答案",method:"dp/二分查找",learn:"",unknown:""},{date:"2023/12/23",no:"1962",name:"移除石子使总数最小",slug:"remove-stones-to-minimize-the-total",difficulty:"中等",rating:1418,situation:"自己做出",method:"贪心+优先级队列",learn:"",unknown:""},{date:"2023/12/24",no:"1954",name:"收集足够苹果的最小花园周长",slug:"minimum-garden-perimeter-to-collect-enough-apples",difficulty:"中等",rating:1758,situation:"自己做出",method:"数学（+二分）",learn:"",unknown:""},{date:"2023/12/25",no:"1276",name:"收集足够苹果的最小花园周长",slug:"number-of-burgers-with-no-waste-of-ingredients",difficulty:"中等",rating:1386,situation:"自己做出",method:"数学",learn:"",unknown:""},{date:"2023/12/26",no:"1349",name:"参加考试的最大学生数",slug:"maximum-students-taking-exam",difficulty:"困难",rating:2385,situation:"没看懂答案",method:"状态压缩+记忆化搜索/dp/ 网络流",learn:"",unknown:"dinic"},{date:"2023/12/27",no:"2660",name:"保龄球游戏的获胜者",slug:"determine-the-winner-of-a-bowling-game",difficulty:"简单",rating:1324,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/12/28",no:"2735",name:"收集巧克力",slug:"collecting-chocolates",difficulty:"中等",rating:2043,situation:"自己做出",method:"模拟/二次差分",learn:"",unknown:"二次差分"},{date:"2023/12/29",no:"2706",name:"购买两块巧克力",slug:"buy-two-chocolates",difficulty:"简单",rating:1207,situation:"自己做出",method:"模拟",learn:"",unknown:""},{date:"2023/12/30",no:"1185",name:"一周中的第几天",slug:"day-of-the-week",difficulty:"简单",rating:1382,situation:"自己做出",method:"模拟/蔡勒公式",learn:"复习蔡勒公式",unknown:""},{date:"2023/12/31",no:"1154",name:"一年中的第几天",slug:"day-of-the-year",difficulty:"简单",rating:1199,situation:"自己做出",method:"模拟",learn:"",unknown:""}]]},dae={situations:[[{type:"自己做出",value:26},{type:"看思路写出",value:0},{type:"看懂答案",value:2},{type:"没看懂答案",value:3}],[{type:"自己做出",value:23},{type:"看思路写出",value:0},{type:"看懂答案",value:3},{type:"没看懂答案",value:2}],[{type:"自己做出",value:24},{type:"看思路写出",value:1},{type:"看懂答案",value:5},{type:"没看懂答案",value:1}],[{type:"自己做出",value:22},{type:"看思路写出",value:2},{type:"看懂答案",value:2},{type:"没看懂答案",value:4}]],difficulty:[]},BB={daily:cae,statistics:dae},fae={month:[[{date:"2022/1/1",no:"605",name:"将一维数组转变为二维数组",difficulty:"简单",situation:"自己做出",method:null,learn:null,unknown:""},{date:"2022/1/2",no:"390",name:"消除游戏",difficulty:"中等",situation:"CV后看懂",method:"转化+数学",learn:null,unknown:""},{date:"2022/1/3",no:"1185",name:"一周中的第几天",difficulty:"简单",situation:"自己做出",method:null,learn:"Zeller公式",unknown:""},{date:"2022/1/4",no:"913",name:"猫和老鼠",difficulty:"困难",situation:"CV后没看懂",method:"dp",learn:null,unknown:""},{date:"2022/1/5",no:"1576",name:"替换所有的问号",difficulty:"简单",situation:"自己做出",method:null,learn:null,unknown:""},{date:"2022/1/6",no:"71",name:"简化路径",difficulty:"中等",situation:"自己做出",method:"栈",learn:null,unknown:""},{date:"2022/1/7",no:"1614",name:"括号的最大嵌套深度",difficulty:"简单",situation:"自己做出",method:"栈",learn:null,unknown:""},{date:"2022/1/8",no:"89",name:"格雷编码",difficulty:"中等",situation:"CV后看懂",method:"位运算/找规律",learn:"格雷码公式ans[i]=(1<0&&a[a.length-1])&&(u[0]===6||u[0]===2)){t=0;continue}if(u[0]===3&&(!a||u[1]>a[0]&&u[1]=e.length&&(e=void 0),{value:e&&e[r++],done:!e}}};throw new TypeError(n?"Object is not iterable.":"Symbol.iterator is not defined.")}function We(e,n){var t=typeof Symbol=="function"&&e[Symbol.iterator];if(!t)return e;var r=t.call(e),i,a=[],o;try{for(;(n===void 0||n-- >0)&&!(i=r.next()).done;)a.push(i.value)}catch(l){o={error:l}}finally{try{i&&!i.done&&(t=r.return)&&t.call(r)}finally{if(o)throw o.error}}return a}function bh(){for(var e=0,n=0,t=arguments.length;n-1:!1},Or=function(e,n){if(!Gi(e))return e;for(var t=[],r=0;ra[l])return 1;if(i[l]t?t:e},v1=function(e,n){var t=n.toString(),r=t.indexOf(".");if(r===-1)return Math.round(e);var i=t.substr(r+1).length;return i>20&&(i=20),parseFloat(e.toFixed(i))},pt=function(e){return ls(e,"Number")},Sae=1e-5;function Er(e,n,t){return t===void 0&&(t=Sae),Math.abs(e-n)r&&(t=a,r=o)}return t}},Cae=function(e,n){if(ge(e)){for(var t,r=1/0,i=0;in?(r&&(clearTimeout(r),r=null),l=c,o=e.apply(i,a),r||(i=a=null)):!r&&t.trailing!==!1&&(r=setTimeout(s,d)),o};return u.cancel=function(){clearTimeout(r),l=0,r=i=a=null},u},Nae=function(e){return Gi(e)?Array.prototype.slice.call(e):[]};var sg={};const ss=function(e){return e=e||"g",sg[e]?sg[e]+=1:sg[e]=1,e+sg[e]},Il=function(){};function vr(e){return ve(e)?0:Gi(e)?e.length:Object.keys(e).length}var ug;const cg=xd(function(e,n){n===void 0&&(n={});var t=n.fontSize,r=n.fontFamily,i=n.fontWeight,a=n.fontStyle,o=n.fontVariant;return ug||(ug=document.createElement("canvas").getContext("2d")),ug.font=[a,o,i,t+"px",r].join(" "),ug.measureText(ct(e)?e:"").width},function(e,n){return n===void 0&&(n={}),bh([e],r0(n)).join("")}),Bae=function(e,n,t,r){r===void 0&&(r="...");var i=16,a=cg(r,t),o=ct(e)?e:dv(e),l=n,s=[],u,c;if(cg(e,t)<=n)return e;for(;u=o.substr(0,i),c=cg(u,t),!(c+a>l&&c>l);)if(s.push(u),l-=c,o=o.substr(i),!o)return s.join("");for(;u=o.substr(0,1),c=cg(u,t),!(c+a>l);)if(s.push(u),l-=c,o=o.substr(1),!o)return s.join("");return""+s.join("")+r};var zae=function(){function e(){this.map={}}return e.prototype.has=function(n){return this.map[n]!==void 0},e.prototype.get=function(n,t){var r=this.map[n];return r===void 0?t:r},e.prototype.set=function(n,t){this.map[n]=t},e.prototype.clear=function(){this.map={}},e.prototype.delete=function(n){delete this.map[n]},e.prototype.size=function(){return Object.keys(this.map).length},e}(),_n;(function(e){e.FORE="fore",e.MID="mid",e.BG="bg"})(_n||(_n={}));var $e;(function(e){e.TOP="top",e.TOP_LEFT="top-left",e.TOP_RIGHT="top-right",e.RIGHT="right",e.RIGHT_TOP="right-top",e.RIGHT_BOTTOM="right-bottom",e.LEFT="left",e.LEFT_TOP="left-top",e.LEFT_BOTTOM="left-bottom",e.BOTTOM="bottom",e.BOTTOM_LEFT="bottom-left",e.BOTTOM_RIGHT="bottom-right",e.RADIUS="radius",e.CIRCLE="circle",e.NONE="none"})($e||($e={}));var fr;(function(e){e.AXIS="axis",e.GRID="grid",e.LEGEND="legend",e.TOOLTIP="tooltip",e.ANNOTATION="annotation",e.SLIDER="slider",e.SCROLLBAR="scrollbar",e.OTHER="other"})(fr||(fr={}));var Ec={FORE:3,MID:2,BG:1},Ot;(function(e){e.BEFORE_RENDER="beforerender",e.AFTER_RENDER="afterrender",e.BEFORE_PAINT="beforepaint",e.AFTER_PAINT="afterpaint",e.BEFORE_CHANGE_DATA="beforechangedata",e.AFTER_CHANGE_DATA="afterchangedata",e.BEFORE_CLEAR="beforeclear",e.AFTER_CLEAR="afterclear",e.BEFORE_DESTROY="beforedestroy",e.BEFORE_CHANGE_SIZE="beforechangesize",e.AFTER_CHANGE_SIZE="afterchangesize"})(Ot||(Ot={}));var Bl;(function(e){e.BEFORE_DRAW_ANIMATE="beforeanimate",e.AFTER_DRAW_ANIMATE="afteranimate",e.BEFORE_RENDER_LABEL="beforerenderlabel",e.AFTER_RENDER_LABEL="afterrenderlabel"})(Bl||(Bl={}));var fi;(function(e){e.MOUSE_ENTER="plot:mouseenter",e.MOUSE_DOWN="plot:mousedown",e.MOUSE_MOVE="plot:mousemove",e.MOUSE_UP="plot:mouseup",e.MOUSE_LEAVE="plot:mouseleave",e.TOUCH_START="plot:touchstart",e.TOUCH_MOVE="plot:touchmove",e.TOUCH_END="plot:touchend",e.TOUCH_CANCEL="plot:touchcancel",e.CLICK="plot:click",e.DBLCLICK="plot:dblclick",e.CONTEXTMENU="plot:contextmenu",e.LEAVE="plot:leave",e.ENTER="plot:enter"})(fi||(fi={}));var xm;(function(e){e.ACTIVE="active",e.INACTIVE="inactive",e.SELECTED="selected",e.DEFAULT="default"})(xm||(xm={}));var cc=["color","shape","size"],sn="_origin",WO=1,GO=1,KO=.25,QB={};function _ae(e){var n=QB[e];if(!n)throw new Error("G engine '".concat(e,"' is not exist, please register it at first."));return n}function ZB(e,n){QB[e]=n}function Hu(e,n,t){if(e){if(typeof e.addEventListener=="function")return e.addEventListener(n,t,!1),{remove:function(){e.removeEventListener(n,t,!1)}};if(typeof e.attachEvent=="function")return e.attachEvent("on"+n,t),{remove:function(){e.detachEvent("on"+n,t)}}}}var lf,p1,JB,dw;function Hae(){lf=document.createElement("table"),p1=document.createElement("tr"),JB=/^\s*<(\w+|!)[^>]*>/,dw={tr:document.createElement("tbody"),tbody:lf,thead:lf,tfoot:lf,td:p1,th:p1,"*":document.createElement("div")}}function zl(e){lf||Hae();var n=JB.test(e)&&RegExp.$1;(!n||!(n in dw))&&(n="*");var t=dw[n];e=typeof e=="string"?e.replace(/(^\s*)|(\s*$)/g,""):e,t.innerHTML=""+e;var r=t.childNodes[0];return r&&t.contains(r)&&t.removeChild(r),r}function mi(e,n,t){var r;try{r=window.getComputedStyle?window.getComputedStyle(e,null)[n]:e.style[n]}catch{}finally{r=r===void 0?t:r}return r}function Vae(e,n){var t=mi(e,"height",n);return t==="auto"&&(t=e.offsetHeight),parseFloat(t)}function jae(e,n){var t=Vae(e,n),r=parseFloat(mi(e,"borderTopWidth"))||0,i=parseFloat(mi(e,"paddingTop"))||0,a=parseFloat(mi(e,"paddingBottom"))||0,o=parseFloat(mi(e,"borderBottomWidth"))||0,l=parseFloat(mi(e,"marginTop"))||0,s=parseFloat(mi(e,"marginBottom"))||0;return t+r+o+i+a+l+s}function Wae(e,n){var t=mi(e,"width",n);return t==="auto"&&(t=e.offsetWidth),parseFloat(t)}function Gae(e,n){var t=Wae(e,n),r=parseFloat(mi(e,"borderLeftWidth"))||0,i=parseFloat(mi(e,"paddingLeft"))||0,a=parseFloat(mi(e,"paddingRight"))||0,o=parseFloat(mi(e,"borderRightWidth"))||0,l=parseFloat(mi(e,"marginRight"))||0,s=parseFloat(mi(e,"marginLeft"))||0;return t+r+o+i+a+s+l}function Kr(e,n){if(e)for(var t in n)n.hasOwnProperty(t)&&(e.style[t]=n[t]);return e}function Kae(e){var n=getComputedStyle(e);return{width:(e.clientWidth||parseInt(n.width,10))-parseInt(n.paddingLeft,10)-parseInt(n.paddingRight,10),height:(e.clientHeight||parseInt(n.height,10))-parseInt(n.paddingTop,10)-parseInt(n.paddingBottom,10)}}function XO(e){return typeof e=="number"&&!isNaN(e)}function YO(e,n,t,r){var i=t,a=r;if(n){var o=Kae(e);i=o.width?o.width:i,a=o.height?o.height:a}return{width:Math.max(XO(i)?i:WO,WO),height:Math.max(XO(a)?a:GO,GO)}}function Xae(e){var n=e.parentNode;n&&n.removeChild(e)}var Yae="*",EE=function(){function e(){this._events={}}return e.prototype.on=function(n,t,r){return this._events[n]||(this._events[n]=[]),this._events[n].push({callback:t,once:!!r}),this},e.prototype.once=function(n,t){return this.on(n,t,!0)},e.prototype.emit=function(n){for(var t=this,r=[],i=1;i2&&(t.push([i].concat(o.splice(0,2))),l="l",i=i==="m"?"l":"L"),l==="o"&&o.length===1&&t.push([i,o[0]]),l==="r")t.push([i].concat(o));else for(;o.length>=n[l]&&(t.push([i].concat(o.splice(0,n[l]))),!!n[l]););return e}),t},fw=function(e,n){for(var t=[],r=0,i=e.length;i-2*!n>r;r+=2){var a=[{x:+e[r-2],y:+e[r-1]},{x:+e[r],y:+e[r+1]},{x:+e[r+2],y:+e[r+3]},{x:+e[r+4],y:+e[r+5]}];n?r?i-4===r?a[3]={x:+e[0],y:+e[1]}:i-2===r&&(a[2]={x:+e[0],y:+e[1]},a[3]={x:+e[2],y:+e[3]}):a[0]={x:+e[i-2],y:+e[i-1]}:i-4===r?a[3]=a[2]:r||(a[0]={x:+e[r],y:+e[r+1]}),t.push(["C",(-a[0].x+6*a[1].x+a[2].x)/6,(-a[0].y+6*a[1].y+a[2].y)/6,(a[1].x+6*a[2].x-a[3].x)/6,(a[1].y+6*a[2].y-a[3].y)/6,a[2].x,a[2].y])}return t},dg=function(e,n,t,r,i){var a=[];if(i===null&&r===null&&(r=t),e=+e,n=+n,t=+t,r=+r,i!==null){var o=Math.PI/180,l=e+t*Math.cos(-r*o),s=e+t*Math.cos(-i*o),u=n+t*Math.sin(-r*o),c=n+t*Math.sin(-i*o);a=[["M",l,u],["A",t,t,0,+(i-r>180),0,s,c]]}else a=[["M",e,n],["m",0,-r],["a",t,r,0,1,1,0,2*r],["a",t,r,0,1,1,0,-2*r],["z"]];return a},hw=function(e){if(e=dc(e),!e||!e.length)return[["M",0,0]];var n=[],t=0,r=0,i=0,a=0,o=0,l,s;e[0][0]==="M"&&(t=+e[0][1],r=+e[0][2],i=t,a=r,o++,n[0]=["M",t,r]);for(var u=e.length===3&&e[0][0]==="M"&&e[1][0].toUpperCase()==="R"&&e[2][0].toUpperCase()==="Z",c=void 0,d=void 0,f=o,h=e.length;f1&&(S=Math.sqrt(S),t=S*t,r=S*r);var C=t*t,E=r*r,k=(a===o?-1:1)*Math.sqrt(Math.abs((C*E-C*w*w-E*b*b)/(C*w*w+E*b*b)));m=k*t*w/r+(e+l)/2,p=k*-r*b/t+(n+s)/2,v=Math.asin(((n-p)/r).toFixed(9)),g=Math.asin(((s-p)/r).toFixed(9)),v=eg&&(v=v-Math.PI*2),!o&&g>v&&(g=g-Math.PI*2)}var I=g-v;if(Math.abs(I)>c){var $=g,T=l,P=s;g=v+c*(o&&g>v?1:-1),l=m+t*Math.cos(g),s=p+r*Math.sin(g),f=e4(l,s,t,r,i,0,o,T,P,[g,$,m,p])}I=g-v;var F=Math.cos(v),L=Math.sin(v),N=Math.cos(g),A=Math.sin(g),R=Math.tan(I/4),O=4/3*t*R,B=4/3*r*R,D=[e,n],H=[e+O*L,n-B*F],j=[l+O*A,s-B*N],G=[l,s];if(H[0]=2*D[0]-H[0],H[1]=2*D[1]-H[1],u)return[H,j,G].concat(f);f=[H,j,G].concat(f).join().split(",");for(var X=[],K=0,q=f.length;K7){b[w].shift();for(var S=b[w];S.length;)o[w]="A",r&&(l[w]="A"),b.splice(w++,0,["C"].concat(S.splice(0,6)));b.splice(w,1),c=Math.max(t.length,r&&r.length||0)}},h=function(b,w,S,C,E){b&&w&&b[E][0]==="M"&&w[E][0]!=="M"&&(w.splice(E,0,["M",C.x,C.y]),S.bx=0,S.by=0,S.x=b[E][1],S.y=b[E][2],c=Math.max(t.length,r&&r.length||0))};c=Math.max(t.length,r&&r.length||0);for(var v=0;v1?1:s<0?0:s;for(var u=s/2,c=12,d=[-.1252,.1252,-.3678,.3678,-.5873,.5873,-.7699,.7699,-.9041,.9041,-.9816,.9816],f=[.2491,.2491,.2335,.2335,.2032,.2032,.1601,.1601,.1069,.1069,.0472,.0472],h=0,v=0;v0&&h<1&&s.push(h);continue}var g=d*d-4*f*c,m=Math.sqrt(g);if(!(g<0)){var p=(-d+m)/(2*c);p>0&&p<1&&s.push(p);var x=(-d-m)/(2*c);x>0&&x<1&&s.push(x)}}for(var b=s.length,w=b,S;b--;)h=s[b],S=1-h,u[0][b]=S*S*S*e+3*S*S*h*t+3*S*h*h*i+h*h*h*o,u[1][b]=S*S*S*n+3*S*S*h*r+3*S*h*h*a+h*h*h*l;return u[0][w]=e,u[1][w]=n,u[0][w+1]=o,u[1][w+1]=l,u[0].length=u[1].length=w+2,{min:{x:Math.min.apply(0,u[0]),y:Math.min.apply(0,u[1])},max:{x:Math.max.apply(0,u[0]),y:Math.max.apply(0,u[1])}}},Jae=function(e,n,t,r,i,a,o,l){if(!(Math.max(e,t)Math.max(i,o)||Math.max(n,r)Math.max(a,l))){var s=(e*r-n*t)*(i-o)-(e-t)*(i*l-a*o),u=(e*r-n*t)*(a-l)-(n-r)*(i*l-a*o),c=(e-t)*(a-l)-(n-r)*(i-o);if(c){var d=s/c,f=u/c,h=+d.toFixed(2),v=+f.toFixed(2);if(!(h<+Math.min(e,t).toFixed(2)||h>+Math.max(e,t).toFixed(2)||h<+Math.min(i,o).toFixed(2)||h>+Math.max(i,o).toFixed(2)||v<+Math.min(n,r).toFixed(2)||v>+Math.max(n,r).toFixed(2)||v<+Math.min(a,l).toFixed(2)||v>+Math.max(a,l).toFixed(2)))return{x:d,y:f}}}},ll=function(e,n,t){return n>=e.x&&n<=e.x+e.width&&t>=e.y&&t<=e.y+e.height},n4=function(e,n,t,r,i){if(i)return[["M",+e+ +i,n],["l",t-i*2,0],["a",i,i,0,0,1,i,i],["l",0,r-i*2],["a",i,i,0,0,1,-i,i],["l",i*2-t,0],["a",i,i,0,0,1,-i,-i],["l",0,i*2-r],["a",i,i,0,0,1,i,-i],["z"]];var a=[["M",e,n],["l",t,0],["l",0,r],["l",-t,0],["z"]];return a.parsePathArray=t4,a},gw=function(e,n,t,r){return e===null&&(e=n=t=r=0),n===null&&(n=e.y,t=e.width,r=e.height,e=e.x),{x:e,y:n,width:t,w:t,height:r,h:r,x2:e+t,y2:n+r,cx:e+t/2,cy:n+r/2,r1:Math.min(t,r)/2,r2:Math.max(t,r)/2,r0:Math.sqrt(t*t+r*r)/2,path:n4(e,n,t,r),vb:[e,n,t,r].join(" ")}},eoe=function(e,n){return e=gw(e),n=gw(n),ll(n,e.x,e.y)||ll(n,e.x2,e.y)||ll(n,e.x,e.y2)||ll(n,e.x2,e.y2)||ll(e,n.x,n.y)||ll(e,n.x2,n.y)||ll(e,n.x,n.y2)||ll(e,n.x2,n.y2)||(e.xn.x||n.xe.x)&&(e.yn.y||n.ye.y)},ZO=function(e,n,t,r,i,a,o,l){ge(e)||(e=[e,n,t,r,i,a,o,l]);var s=Zae.apply(null,e);return gw(s.min.x,s.min.y,s.max.x-s.min.x,s.max.y-s.min.y)},JO=function(e,n,t,r,i,a,o,l,s){var u=1-s,c=Math.pow(u,3),d=Math.pow(u,2),f=s*s,h=f*s,v=c*e+d*3*s*t+u*3*s*s*i+h*o,g=c*n+d*3*s*r+u*3*s*s*a+h*l,m=e+2*s*(t-e)+f*(i-2*t+e),p=n+2*s*(r-n)+f*(a-2*r+n),x=t+2*s*(i-t)+f*(o-2*i+t),b=r+2*s*(a-r)+f*(l-2*a+r),w=u*e+s*t,S=u*n+s*r,C=u*i+s*o,E=u*a+s*l,k=90-Math.atan2(m-x,p-b)*180/Math.PI;return{x:v,y:g,m:{x:m,y:p},n:{x,y:b},start:{x:w,y:S},end:{x:C,y:E},alpha:k}},toe=function(e,n,t){var r=ZO(e),i=ZO(n);if(!eoe(r,i))return t?0:[];for(var a=QO.apply(0,e),o=QO.apply(0,n),l=~~(a/8),s=~~(o/8),u=[],c=[],d={},f=t?0:[],h=0;h=0&&E<=1&&k>=0&&k<=1&&(t?f+=1:f.push({x:C.x,y:C.y,t1:E,t2:k}))}}return f},noe=function(e,n,t){e=vw(e),n=vw(n);for(var r,i,a,o,l,s,u,c,d,f,h=t?0:[],v=0,g=e.length;v=3&&(d.length===3&&f.push("Q"),f=f.concat(d[1])),d.length===2&&f.push("L"),f=f.concat(d[d.length-1]),f});return c}var ooe=function(e,n,t){if(t===1)return[[].concat(e)];var r=[];if(n[0]==="L"||n[0]==="C"||n[0]==="Q")r=r.concat(aoe(e,n,t));else{var i=[].concat(e);i[0]==="M"&&(i[0]="L");for(var a=0;a<=t-1;a++)r.push(i)}return r},loe=function(e,n){if(e.length===1)return e;var t=e.length-1,r=n.length-1,i=t/r,a=[];if(e.length===1&&e[0][0]==="M"){for(var o=0;o=0;s--)o=a[s].index,a[s].type==="add"?e.splice(o,0,[].concat(e[o])):e.splice(o,1)}r=e.length;var d=i-r;if(r0)t=m1(t,e[r-1],1);else{e[r]=n[r];break}e[r]=["Q"].concat(t.reduce(function(i,a){return i.concat(a)},[]));break;case"T":e[r]=["T"].concat(t[0]);break;case"C":if(t.length<3)if(r>0)t=m1(t,e[r-1],2);else{e[r]=n[r];break}e[r]=["C"].concat(t.reduce(function(i,a){return i.concat(a)},[]));break;case"S":if(t.length<2)if(r>0)t=m1(t,e[r-1],1);else{e[r]=n[r];break}e[r]=["S"].concat(t.reduce(function(i,a){return i.concat(a)},[]));break;default:e[r]=n[r]}return e};const ME=Object.freeze(Object.defineProperty({__proto__:null,catmullRomToBezier:fw,fillPath:loe,fillPathByDiff:r4,formatPath:pw,intersection:roe,parsePathArray:t4,parsePathString:dc,pathToAbsolute:hw,pathToCurve:vw,rectPath:n4},Symbol.toStringTag,{value:"Module"}));var fv=function(){function e(n,t){this.bubbles=!0,this.target=null,this.currentTarget=null,this.delegateTarget=null,this.delegateObject=null,this.defaultPrevented=!1,this.propagationStopped=!1,this.shape=null,this.fromShape=null,this.toShape=null,this.propagationPath=[],this.type=n,this.name=n,this.originalEvent=t,this.timeStamp=t.timeStamp}return e.prototype.preventDefault=function(){this.defaultPrevented=!0,this.originalEvent.preventDefault&&this.originalEvent.preventDefault()},e.prototype.stopPropagation=function(){this.propagationStopped=!0},e.prototype.toString=function(){var n=this.type;return"[Event (type="+n+")]"},e.prototype.save=function(){},e.prototype.restore=function(){},e}();function a4(e,n){var t=e.indexOf(n);t!==-1&&e.splice(t,1)}var eT=typeof window<"u"&&typeof window.document<"u";function o4(e,n){if(e.isCanvas())return!0;for(var t=n.getParent(),r=!1;t;){if(t===e){r=!0;break}t=t.getParent()}return r}function wh(e){return e.cfg.visible&&e.cfg.capture}var a0=function(e){Y(n,e);function n(t){var r=e.call(this)||this;r.destroyed=!1;var i=r.getDefaultCfg();return r.cfg=rn(i,t),r}return n.prototype.getDefaultCfg=function(){return{}},n.prototype.get=function(t){return this.cfg[t]},n.prototype.set=function(t,r){this.cfg[t]=r},n.prototype.destroy=function(){this.cfg={destroyed:!0},this.off(),this.destroyed=!0},n}(EE),tT=globalThis&&globalThis.__spreadArray||function(e,n,t){if(t||arguments.length===2)for(var r=0,i=n.length,a;r"u"&&typeof navigator<"u"&&navigator.product==="ReactNative"?new goe:typeof navigator<"u"?iT(navigator.userAgent):woe()}function xoe(e){return e!==""&&yoe.reduce(function(n,t){var r=t[0],i=t[1];if(n)return n;var a=i.exec(e);return!!a&&[r,a]},!1)}function iT(e){var n=xoe(e);if(!n)return null;var t=n[0],r=n[1];if(t==="searchbot")return new voe;var i=r[1]&&r[1].split(".").join("_").split("_").slice(0,3);i?i.length0&&(i=1/Math.sqrt(i)),e[0]=n[0]*i,e[1]=n[1]*i,e}function Ooe(e,n){return e[0]*n[0]+e[1]*n[1]}function Toe(e,n,t){var r=n[0],i=n[1];return e[0]=t[0]*r+t[3]*i+t[6],e[1]=t[1]*r+t[4]*i+t[7],e}function mw(e,n){var t=e[0],r=e[1],i=n[0],a=n[1],o=Math.sqrt(t*t+r*r)*Math.sqrt(i*i+a*a),l=o&&(t*i+r*a)/o;return Math.acos(Math.min(Math.max(l,-1),1))}function Poe(e,n){return e[0]===n[0]&&e[1]===n[1]}var Ws=s4;(function(){var e=$oe();return function(n,t,r,i,a,o){var l,s;for(t||(t=2),r||(r=0),i?s=Math.min(i*t+r,n.length):s=n.length,l=r;l=0;return t?i?Math.PI*2-r:r:i?r:Math.PI*2-r}function aT(e,n){var t=[],r=e[0],i=e[1],a=e[2],o=e[3],l=e[4],s=e[5],u=e[6],c=e[7],d=e[8],f=n[0],h=n[1],v=n[2],g=n[3],m=n[4],p=n[5],x=n[6],b=n[7],w=n[8];return t[0]=f*r+h*o+v*u,t[1]=f*i+h*l+v*c,t[2]=f*a+h*s+v*d,t[3]=g*r+m*o+p*u,t[4]=g*i+m*l+p*c,t[5]=g*a+m*s+p*d,t[6]=x*r+b*o+w*u,t[7]=x*i+b*l+w*c,t[8]=x*a+b*s+w*d,t}function Do(e,n){var t=[],r=n[0],i=n[1];return t[0]=e[0]*r+e[3]*i+e[6],t[1]=e[1]*r+e[4]*i+e[7],t}function l0(e){var n=[],t=e[0],r=e[1],i=e[2],a=e[3],o=e[4],l=e[5],s=e[6],u=e[7],c=e[8],d=c*o-l*u,f=-c*a+l*s,h=u*a-o*s,v=t*d+r*f+i*h;return v?(v=1/v,n[0]=d*v,n[1]=(-c*r+i*u)*v,n[2]=(l*r-i*o)*v,n[3]=f*v,n[4]=(c*t-i*s)*v,n[5]=(-l*t+i*a)*v,n[6]=h*v,n[7]=(-u*t+r*s)*v,n[8]=(o*t-r*a)*v,n):null}var Wd=er,y1="matrix",Foe=["zIndex","capture","visible","type"],Loe=["repeat"],Doe=":",Noe="*";function Boe(e){for(var n=[],t=0;to.delay&&_(n.toAttrs,function(l,s){a.call(o.toAttrs,s)&&(delete o.toAttrs[s],delete o.fromAttrs[s])})}),e}var d4=function(e){Y(n,e);function n(t){var r=e.call(this,t)||this;r.attrs={};var i=r.getDefaultAttrs();return rn(i,t.attrs),r.attrs=i,r.initAttrs(i),r.initAnimate(),r}return n.prototype.getDefaultCfg=function(){return{visible:!0,capture:!0,zIndex:0}},n.prototype.getDefaultAttrs=function(){return{matrix:this.getDefaultMatrix(),opacity:1}},n.prototype.onCanvasChange=function(t){},n.prototype.initAttrs=function(t){},n.prototype.initAnimate=function(){this.set("animable",!0),this.set("animating",!1)},n.prototype.isGroup=function(){return!1},n.prototype.getParent=function(){return this.get("parent")},n.prototype.getCanvas=function(){return this.get("canvas")},n.prototype.attr=function(){for(var t,r=[],i=0;i0?a=Hoe(a,w):i.addAnimator(this),a.push(w),this.set("animations",a),this.set("_pause",{isPaused:!1})}},n.prototype.stopAnimate=function(t){var r=this;t===void 0&&(t=!0);var i=this.get("animations");_(i,function(a){t&&(a.onFrame?r.attr(a.onFrame(1)):r.attr(a.toAttrs)),a.callback&&a.callback()}),this.set("animating",!1),this.set("animations",[])},n.prototype.pauseAnimate=function(){var t=this.get("timeline"),r=this.get("animations"),i=t.getTime();return _(r,function(a){a._paused=!0,a._pauseTime=i,a.pauseCallback&&a.pauseCallback()}),this.set("_pause",{isPaused:!0,pauseTime:i}),this},n.prototype.resumeAnimate=function(){var t=this.get("timeline"),r=t.getTime(),i=this.get("animations"),a=this.get("_pause").pauseTime;return _(i,function(o){o.startTime=o.startTime+(r-a),o._paused=!1,o._pauseTime=null,o.resumeCallback&&o.resumeCallback()}),this.set("_pause",{isPaused:!1}),this.set("animations",i),this},n.prototype.emitDelegation=function(t,r){var i=this,a=r.propagationPath;this.getEvents();var o;t==="mouseenter"?o=r.fromShape:t==="mouseleave"&&(o=r.toShape);for(var l=function(d){var f=a[d],h=f.get("name");if(h){if((f.isGroup()||f.isCanvas&&f.isCanvas())&&o&&o4(f,o))return"break";ge(h)?_(h,function(v){i.emitDelegateEvent(f,v,r)}):s.emitDelegateEvent(f,h,r)}},s=this,u=0;u0)});o.length>0?_(o,function(s){var u=s.getBBox(),c=u.minX,d=u.maxX,f=u.minY,h=u.maxY;cr&&(r=d),fa&&(a=h)}):(t=0,r=0,i=0,a=0);var l={x:t,y:i,minX:t,minY:i,maxX:r,maxY:a,width:r-t,height:a-i};return l},n.prototype.getCanvasBBox=function(){var t=1/0,r=-1/0,i=1/0,a=-1/0,o=this.getChildren().filter(function(s){return s.get("visible")&&(!s.isGroup()||s.isGroup()&&s.getChildren().length>0)});o.length>0?_(o,function(s){var u=s.getCanvasBBox(),c=u.minX,d=u.maxX,f=u.minY,h=u.maxY;cr&&(r=d),fa&&(a=h)}):(t=0,r=0,i=0,a=0);var l={x:t,y:i,minX:t,minY:i,maxX:r,maxY:a,width:r-t,height:a-i};return l},n.prototype.getDefaultCfg=function(){var t=e.prototype.getDefaultCfg.call(this);return t.children=[],t},n.prototype.onAttrChange=function(t,r,i){if(e.prototype.onAttrChange.call(this,t,r,i),t==="matrix"){var a=this.getTotalMatrix();this._applyChildrenMarix(a)}},n.prototype.applyMatrix=function(t){var r=this.getTotalMatrix();e.prototype.applyMatrix.call(this,t);var i=this.getTotalMatrix();i!==r&&this._applyChildrenMarix(i)},n.prototype._applyChildrenMarix=function(t){var r=this.getChildren();_(r,function(i){i.applyMatrix(t)})},n.prototype.addShape=function(){for(var t=[],r=0;r=0;l--){var s=t[l];if(wh(s)&&(s.isGroup()?o=s.getShape(r,i,a):s.isHit(r,i)&&(o=s)),o)break}return o},n.prototype.add=function(t){var r=this.getCanvas(),i=this.getChildren(),a=this.get("timeline"),o=t.getParent();o&&Voe(o,t,!1),t.set("parent",this),r&&f4(t,r),a&&h4(t,a),i.push(t),t.onCanvasChange("add"),this._applyElementMatrix(t)},n.prototype._applyElementMatrix=function(t){var r=this.getTotalMatrix();r&&t.applyMatrix(r)},n.prototype.getChildren=function(){return this.get("children")},n.prototype.sort=function(){var t=this.getChildren();_(t,function(r,i){return r[yw]=i,r}),t.sort(joe(function(r,i){return r.get("zIndex")-i.get("zIndex")})),this.onCanvasChange("sort")},n.prototype.clear=function(){if(this.set("clearing",!0),!this.destroyed){for(var t=this.getChildren(),r=t.length-1;r>=0;r--)t[r].destroy();this.set("children",[]),this.onCanvasChange("clear"),this.set("clearing",!1)}},n.prototype.destroy=function(){this.get("destroyed")||(this.clear(),e.prototype.destroy.call(this))},n.prototype.getFirst=function(){return this.getChildByIndex(0)},n.prototype.getLast=function(){var t=this.getChildren();return this.getChildByIndex(t.length-1)},n.prototype.getChildByIndex=function(t){var r=this.getChildren();return r[t]},n.prototype.getCount=function(){var t=this.getChildren();return t.length},n.prototype.contain=function(t){var r=this.getChildren();return r.indexOf(t)>-1},n.prototype.removeChild=function(t,r){r===void 0&&(r=!0),this.contain(t)&&t.remove(r)},n.prototype.findAll=function(t){var r=[],i=this.getChildren();return _(i,function(a){t(a)&&r.push(a),a.isGroup()&&(r=r.concat(a.findAll(t)))}),r},n.prototype.find=function(t){var r=null,i=this.getChildren();return _(i,function(a){if(t(a)?r=a:a.isGroup()&&(r=a.find(t)),r)return!1}),r},n.prototype.findById=function(t){return this.find(function(r){return r.get("id")===t})},n.prototype.findByClassName=function(t){return this.find(function(r){return r.get("className")===t})},n.prototype.findAllByName=function(t){return this.findAll(function(r){return r.get("name")===t})},n}(d4),qc=0,sf=0,Gd=0,g4=1e3,wm,uf,Sm=0,su=0,s0=0,Ch=typeof performance=="object"&&performance.now?performance:Date,p4=typeof window=="object"&&window.requestAnimationFrame?window.requestAnimationFrame.bind(window):function(e){setTimeout(e,17)};function m4(){return su||(p4(Woe),su=Ch.now()+s0)}function Woe(){su=0}function xw(){this._call=this._time=this._next=null}xw.prototype=y4.prototype={constructor:xw,restart:function(e,n,t){if(typeof e!="function")throw new TypeError("callback is not a function");t=(t==null?m4():+t)+(n==null?0:+n),!this._next&&uf!==this&&(uf?uf._next=this:wm=this,uf=this),this._call=e,this._time=t,bw()},stop:function(){this._call&&(this._call=null,this._time=1/0,bw())}};function y4(e,n,t){var r=new xw;return r.restart(e,n,t),r}function Goe(){m4(),++qc;for(var e=wm,n;e;)(n=su-e._time)>=0&&e._call.call(null,n),e=e._next;--qc}function lT(){su=(Sm=Ch.now())+s0,qc=sf=0;try{Goe()}finally{qc=0,Xoe(),su=0}}function Koe(){var e=Ch.now(),n=e-Sm;n>g4&&(s0-=n,Sm=e)}function Xoe(){for(var e,n=wm,t,r=1/0;n;)n._call?(r>n._time&&(r=n._time),e=n,n=n._next):(t=n._next,n._next=null,n=e?e._next=t:wm=t);uf=e,bw(r)}function bw(e){if(!qc){sf&&(sf=clearTimeout(sf));var n=e-su;n>24?(e<1/0&&(sf=setTimeout(lT,e-Ch.now()-s0)),Gd&&(Gd=clearInterval(Gd))):(Gd||(Sm=Ch.now(),Gd=setInterval(Koe,g4)),qc=1,p4(lT))}}function OE(e,n,t){e.prototype=n.prototype=t,t.constructor=e}function x4(e,n){var t=Object.create(e.prototype);for(var r in n)t[r]=n[r];return t}function hv(){}var Eh=.7,Cm=1/Eh,kc="\\s*([+-]?\\d+)\\s*",kh="\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)\\s*",fo="\\s*([+-]?(?:\\d*\\.)?\\d+(?:[eE][+-]?\\d+)?)%\\s*",Yoe=/^#([0-9a-f]{3,8})$/,Uoe=new RegExp(`^rgb\\(${kc},${kc},${kc}\\)$`),qoe=new RegExp(`^rgb\\(${fo},${fo},${fo}\\)$`),Qoe=new RegExp(`^rgba\\(${kc},${kc},${kc},${kh}\\)$`),Zoe=new RegExp(`^rgba\\(${fo},${fo},${fo},${kh}\\)$`),Joe=new RegExp(`^hsl\\(${kh},${fo},${fo}\\)$`),ele=new RegExp(`^hsla\\(${kh},${fo},${fo},${kh}\\)$`),sT={aliceblue:15792383,antiquewhite:16444375,aqua:65535,aquamarine:8388564,azure:15794175,beige:16119260,bisque:16770244,black:0,blanchedalmond:16772045,blue:255,blueviolet:9055202,brown:10824234,burlywood:14596231,cadetblue:6266528,chartreuse:8388352,chocolate:13789470,coral:16744272,cornflowerblue:6591981,cornsilk:16775388,crimson:14423100,cyan:65535,darkblue:139,darkcyan:35723,darkgoldenrod:12092939,darkgray:11119017,darkgreen:25600,darkgrey:11119017,darkkhaki:12433259,darkmagenta:9109643,darkolivegreen:5597999,darkorange:16747520,darkorchid:10040012,darkred:9109504,darksalmon:15308410,darkseagreen:9419919,darkslateblue:4734347,darkslategray:3100495,darkslategrey:3100495,darkturquoise:52945,darkviolet:9699539,deeppink:16716947,deepskyblue:49151,dimgray:6908265,dimgrey:6908265,dodgerblue:2003199,firebrick:11674146,floralwhite:16775920,forestgreen:2263842,fuchsia:16711935,gainsboro:14474460,ghostwhite:16316671,gold:16766720,goldenrod:14329120,gray:8421504,green:32768,greenyellow:11403055,grey:8421504,honeydew:15794160,hotpink:16738740,indianred:13458524,indigo:4915330,ivory:16777200,khaki:15787660,lavender:15132410,lavenderblush:16773365,lawngreen:8190976,lemonchiffon:16775885,lightblue:11393254,lightcoral:15761536,lightcyan:14745599,lightgoldenrodyellow:16448210,lightgray:13882323,lightgreen:9498256,lightgrey:13882323,lightpink:16758465,lightsalmon:16752762,lightseagreen:2142890,lightskyblue:8900346,lightslategray:7833753,lightslategrey:7833753,lightsteelblue:11584734,lightyellow:16777184,lime:65280,limegreen:3329330,linen:16445670,magenta:16711935,maroon:8388608,mediumaquamarine:6737322,mediumblue:205,mediumorchid:12211667,mediumpurple:9662683,mediumseagreen:3978097,mediumslateblue:8087790,mediumspringgreen:64154,mediumturquoise:4772300,mediumvioletred:13047173,midnightblue:1644912,mintcream:16121850,mistyrose:16770273,moccasin:16770229,navajowhite:16768685,navy:128,oldlace:16643558,olive:8421376,olivedrab:7048739,orange:16753920,orangered:16729344,orchid:14315734,palegoldenrod:15657130,palegreen:10025880,paleturquoise:11529966,palevioletred:14381203,papayawhip:16773077,peachpuff:16767673,peru:13468991,pink:16761035,plum:14524637,powderblue:11591910,purple:8388736,rebeccapurple:6697881,red:16711680,rosybrown:12357519,royalblue:4286945,saddlebrown:9127187,salmon:16416882,sandybrown:16032864,seagreen:3050327,seashell:16774638,sienna:10506797,silver:12632256,skyblue:8900331,slateblue:6970061,slategray:7372944,slategrey:7372944,snow:16775930,springgreen:65407,steelblue:4620980,tan:13808780,teal:32896,thistle:14204888,tomato:16737095,turquoise:4251856,violet:15631086,wheat:16113331,white:16777215,whitesmoke:16119285,yellow:16776960,yellowgreen:10145074};OE(hv,Mh,{copy(e){return Object.assign(new this.constructor,this,e)},displayable(){return this.rgb().displayable()},hex:uT,formatHex:uT,formatHex8:tle,formatHsl:nle,formatRgb:cT,toString:cT});function uT(){return this.rgb().formatHex()}function tle(){return this.rgb().formatHex8()}function nle(){return b4(this).formatHsl()}function cT(){return this.rgb().formatRgb()}function Mh(e){var n,t;return e=(e+"").trim().toLowerCase(),(n=Yoe.exec(e))?(t=n[1].length,n=parseInt(n[1],16),t===6?dT(n):t===3?new bi(n>>8&15|n>>4&240,n>>4&15|n&240,(n&15)<<4|n&15,1):t===8?hg(n>>24&255,n>>16&255,n>>8&255,(n&255)/255):t===4?hg(n>>12&15|n>>8&240,n>>8&15|n>>4&240,n>>4&15|n&240,((n&15)<<4|n&15)/255):null):(n=Uoe.exec(e))?new bi(n[1],n[2],n[3],1):(n=qoe.exec(e))?new bi(n[1]*255/100,n[2]*255/100,n[3]*255/100,1):(n=Qoe.exec(e))?hg(n[1],n[2],n[3],n[4]):(n=Zoe.exec(e))?hg(n[1]*255/100,n[2]*255/100,n[3]*255/100,n[4]):(n=Joe.exec(e))?vT(n[1],n[2]/100,n[3]/100,1):(n=ele.exec(e))?vT(n[1],n[2]/100,n[3]/100,n[4]):sT.hasOwnProperty(e)?dT(sT[e]):e==="transparent"?new bi(NaN,NaN,NaN,0):null}function dT(e){return new bi(e>>16&255,e>>8&255,e&255,1)}function hg(e,n,t,r){return r<=0&&(e=n=t=NaN),new bi(e,n,t,r)}function rle(e){return e instanceof hv||(e=Mh(e)),e?(e=e.rgb(),new bi(e.r,e.g,e.b,e.opacity)):new bi}function ww(e,n,t,r){return arguments.length===1?rle(e):new bi(e,n,t,r??1)}function bi(e,n,t,r){this.r=+e,this.g=+n,this.b=+t,this.opacity=+r}OE(bi,ww,x4(hv,{brighter(e){return e=e==null?Cm:Math.pow(Cm,e),new bi(this.r*e,this.g*e,this.b*e,this.opacity)},darker(e){return e=e==null?Eh:Math.pow(Eh,e),new bi(this.r*e,this.g*e,this.b*e,this.opacity)},rgb(){return this},clamp(){return new bi(Gs(this.r),Gs(this.g),Gs(this.b),Em(this.opacity))},displayable(){return-.5<=this.r&&this.r<255.5&&-.5<=this.g&&this.g<255.5&&-.5<=this.b&&this.b<255.5&&0<=this.opacity&&this.opacity<=1},hex:fT,formatHex:fT,formatHex8:ile,formatRgb:hT,toString:hT}));function fT(){return`#${Fs(this.r)}${Fs(this.g)}${Fs(this.b)}`}function ile(){return`#${Fs(this.r)}${Fs(this.g)}${Fs(this.b)}${Fs((isNaN(this.opacity)?1:this.opacity)*255)}`}function hT(){const e=Em(this.opacity);return`${e===1?"rgb(":"rgba("}${Gs(this.r)}, ${Gs(this.g)}, ${Gs(this.b)}${e===1?")":`, ${e})`}`}function Em(e){return isNaN(e)?1:Math.max(0,Math.min(1,e))}function Gs(e){return Math.max(0,Math.min(255,Math.round(e)||0))}function Fs(e){return e=Gs(e),(e<16?"0":"")+e.toString(16)}function vT(e,n,t,r){return r<=0?e=n=t=NaN:t<=0||t>=1?e=n=NaN:n<=0&&(e=NaN),new La(e,n,t,r)}function b4(e){if(e instanceof La)return new La(e.h,e.s,e.l,e.opacity);if(e instanceof hv||(e=Mh(e)),!e)return new La;if(e instanceof La)return e;e=e.rgb();var n=e.r/255,t=e.g/255,r=e.b/255,i=Math.min(n,t,r),a=Math.max(n,t,r),o=NaN,l=a-i,s=(a+i)/2;return l?(n===a?o=(t-r)/l+(t0&&s<1?0:o,new La(o,l,s,e.opacity)}function ale(e,n,t,r){return arguments.length===1?b4(e):new La(e,n,t,r??1)}function La(e,n,t,r){this.h=+e,this.s=+n,this.l=+t,this.opacity=+r}OE(La,ale,x4(hv,{brighter(e){return e=e==null?Cm:Math.pow(Cm,e),new La(this.h,this.s,this.l*e,this.opacity)},darker(e){return e=e==null?Eh:Math.pow(Eh,e),new La(this.h,this.s,this.l*e,this.opacity)},rgb(){var e=this.h%360+(this.h<0)*360,n=isNaN(e)||isNaN(this.s)?0:this.s,t=this.l,r=t+(t<.5?t:1-t)*n,i=2*t-r;return new bi(x1(e>=240?e-240:e+120,i,r),x1(e,i,r),x1(e<120?e+240:e-120,i,r),this.opacity)},clamp(){return new La(gT(this.h),vg(this.s),vg(this.l),Em(this.opacity))},displayable(){return(0<=this.s&&this.s<=1||isNaN(this.s))&&0<=this.l&&this.l<=1&&0<=this.opacity&&this.opacity<=1},formatHsl(){const e=Em(this.opacity);return`${e===1?"hsl(":"hsla("}${gT(this.h)}, ${vg(this.s)*100}%, ${vg(this.l)*100}%${e===1?")":`, ${e})`}`}}));function gT(e){return e=(e||0)%360,e<0?e+360:e}function vg(e){return Math.max(0,Math.min(1,e||0))}function x1(e,n,t){return(e<60?n+(t-n)*e/60:e<180?t:e<240?n+(t-n)*(240-e)/60:n)*255}const TE=e=>()=>e;function ole(e,n){return function(t){return e+t*n}}function lle(e,n,t){return e=Math.pow(e,t),n=Math.pow(n,t)-e,t=1/t,function(r){return Math.pow(e+r*n,t)}}function sle(e){return(e=+e)==1?w4:function(n,t){return t-n?lle(n,t,e):TE(isNaN(n)?t:n)}}function w4(e,n){var t=n-e;return t?ole(e,t):TE(isNaN(e)?n:e)}const pT=function e(n){var t=sle(n);function r(i,a){var o=t((i=ww(i)).r,(a=ww(a)).r),l=t(i.g,a.g),s=t(i.b,a.b),u=w4(i.opacity,a.opacity);return function(c){return i.r=o(c),i.g=l(c),i.b=s(c),i.opacity=u(c),i+""}}return r.gamma=e,r}(1);function S4(e,n){n||(n=[]);var t=e?Math.min(n.length,e.length):0,r=n.slice(),i;return function(a){for(i=0;it&&(a=n.slice(t,a),l[o]?l[o]+=a:l[++o]=a),(r=r[0])===(i=i[0])?l[o]?l[o]+=i:l[++o]=i:(l[++o]=null,s.push({i:o,x:Sw(r,i)})),t=b1.lastIndex;return tu.length?(s=dc(a[l]),u=dc(i[l]),u=r4(u,s),u=pw(u,s),n.fromAttrs.path=u,n.toAttrs.path=s):n.pathFormatted||(s=dc(a[l]),u=dc(i[l]),u=pw(u,s),n.fromAttrs.path=u,n.toAttrs.path=s,n.pathFormatted=!0),r[l]=[];for(var c=0;c0){for(var l=n.animators.length-1;l>=0;l--){if(r=n.animators[l],r.destroyed){n.removeAnimator(l);continue}if(!r.isAnimatePaused()){i=r.get("animations");for(var s=i.length-1;s>=0;s--)a=i[s],t=Xle(r,a,o),t&&(i.splice(s,1),t=!1,a.callback&&a.callback())}i.length===0&&n.removeAnimator(l)}var u=n.canvas.get("autoDraw");u||n.canvas.draw()}})},e.prototype.addAnimator=function(n){this.animators.push(n)},e.prototype.removeAnimator=function(n){this.animators.splice(n,1)},e.prototype.isAnimating=function(){return!!this.animators.length},e.prototype.stop=function(){this.timer&&this.timer.stop()},e.prototype.stopAllAnimations=function(n){n===void 0&&(n=!0),this.animators.forEach(function(t){t.stopAnimate(n)}),this.animators=[],this.canvas.draw()},e.prototype.getTime=function(){return this.current},e}(),Ule=40,MT=0,IT=["mousedown","mouseup","dblclick","mouseout","mouseover","mousemove","mouseleave","mouseenter","touchstart","touchmove","touchend","dragenter","dragover","dragleave","drop","contextmenu","mousewheel"];function $T(e,n,t){t.name=n,t.target=e,t.currentTarget=e,t.delegateTarget=e,e.emit(n,t)}function qle(e,n,t){if(t.bubbles){var r=void 0,i=!1;if(n==="mouseenter"?(r=t.fromShape,i=!0):n==="mouseleave"&&(i=!0,r=t.toShape),e.isCanvas()&&i)return;if(r&&o4(e,r)){t.bubbles=!1;return}t.name=n,t.currentTarget=e,t.delegateTarget=e,e.emit(n,t)}}var Qle=function(){function e(n){var t=this;this.draggingShape=null,this.dragging=!1,this.currentShape=null,this.mousedownShape=null,this.mousedownPoint=null,this._eventCallback=function(r){var i=r.type;t._triggerEvent(i,r)},this._onDocumentMove=function(r){var i=t.canvas,a=i.get("el");if(a!==r.target&&(t.dragging||t.currentShape)){var o=t._getPointInfo(r);t.dragging&&t._emitEvent("drag",r,o,t.draggingShape)}},this._onDocumentMouseUp=function(r){var i=t.canvas,a=i.get("el");if(a!==r.target&&t.dragging){var o=t._getPointInfo(r);t.draggingShape&&t._emitEvent("drop",r,o,null),t._emitEvent("dragend",r,o,t.draggingShape),t._afterDrag(t.draggingShape,o,r)}},this.canvas=n.canvas}return e.prototype.init=function(){this._bindEvents()},e.prototype._bindEvents=function(){var n=this,t=this.canvas.get("el");_(IT,function(r){t.addEventListener(r,n._eventCallback)}),document&&(document.addEventListener("mousemove",this._onDocumentMove),document.addEventListener("mouseup",this._onDocumentMouseUp))},e.prototype._clearEvents=function(){var n=this,t=this.canvas.get("el");_(IT,function(r){t.removeEventListener(r,n._eventCallback)}),document&&(document.removeEventListener("mousemove",this._onDocumentMove),document.removeEventListener("mouseup",this._onDocumentMouseUp))},e.prototype._getEventObj=function(n,t,r,i,a,o){var l=new fv(n,t);return l.fromShape=a,l.toShape=o,l.x=r.x,l.y=r.y,l.clientX=r.clientX,l.clientY=r.clientY,l.propagationPath.push(i),l},e.prototype._getShape=function(n,t){return this.canvas.getShape(n.x,n.y,t)},e.prototype._getPointInfo=function(n){var t=this.canvas,r=t.getClientByEvent(n),i=t.getPointByEvent(n);return{x:i.x,y:i.y,clientX:r.x,clientY:r.y}},e.prototype._triggerEvent=function(n,t){var r=this._getPointInfo(t),i=this._getShape(r,t),a=this["_on"+n],o=!1;if(a)a.call(this,r,i,t);else{var l=this.currentShape;n==="mouseenter"||n==="dragenter"||n==="mouseover"?(this._emitEvent(n,t,r,null,null,i),i&&this._emitEvent(n,t,r,i,null,i),n==="mouseenter"&&this.draggingShape&&this._emitEvent("dragenter",t,r,null)):n==="mouseleave"||n==="dragleave"||n==="mouseout"?(o=!0,l&&this._emitEvent(n,t,r,l,l,null),this._emitEvent(n,t,r,null,l,null),n==="mouseleave"&&this.draggingShape&&this._emitEvent("dragleave",t,r,null)):this._emitEvent(n,t,r,i,null,null)}if(o||(this.currentShape=i),i&&!i.get("destroyed")){var s=this.canvas,u=s.get("el");u.style.cursor=i.attr("cursor")||s.get("cursor")}},e.prototype._onmousedown=function(n,t,r){r.button===MT&&(this.mousedownShape=t,this.mousedownPoint=n,this.mousedownTimeStamp=r.timeStamp),this._emitEvent("mousedown",r,n,t,null,null)},e.prototype._emitMouseoverEvents=function(n,t,r,i){var a=this.canvas.get("el");r!==i&&(r&&(this._emitEvent("mouseout",n,t,r,r,i),this._emitEvent("mouseleave",n,t,r,r,i),(!i||i.get("destroyed"))&&(a.style.cursor=this.canvas.get("cursor"))),i&&(this._emitEvent("mouseover",n,t,i,r,i),this._emitEvent("mouseenter",n,t,i,r,i)))},e.prototype._emitDragoverEvents=function(n,t,r,i,a){i?(i!==r&&(r&&this._emitEvent("dragleave",n,t,r,r,i),this._emitEvent("dragenter",n,t,i,r,i)),a||this._emitEvent("dragover",n,t,i)):r&&this._emitEvent("dragleave",n,t,r,r,i),a&&this._emitEvent("dragover",n,t,i)},e.prototype._afterDrag=function(n,t,r){n&&(n.set("capture",!0),this.draggingShape=null),this.dragging=!1;var i=this._getShape(t,r);i!==n&&this._emitMouseoverEvents(r,t,n,i),this.currentShape=i},e.prototype._onmouseup=function(n,t,r){if(r.button===MT){var i=this.draggingShape;this.dragging?(i&&this._emitEvent("drop",r,n,t),this._emitEvent("dragend",r,n,i),this._afterDrag(i,n,r)):(this._emitEvent("mouseup",r,n,t),t===this.mousedownShape&&this._emitEvent("click",r,n,t),this.mousedownShape=null,this.mousedownPoint=null)}},e.prototype._ondragover=function(n,t,r){r.preventDefault();var i=this.currentShape;this._emitDragoverEvents(r,n,i,t,!0)},e.prototype._onmousemove=function(n,t,r){var i=this.canvas,a=this.currentShape,o=this.draggingShape;if(this.dragging)o&&this._emitDragoverEvents(r,n,a,t,!1),this._emitEvent("drag",r,n,o);else{var l=this.mousedownPoint;if(l){var s=this.mousedownShape,u=r.timeStamp,c=u-this.mousedownTimeStamp,d=l.clientX-n.clientX,f=l.clientY-n.clientY,h=d*d+f*f;c>120||h>Ule?s&&s.get("draggable")?(o=this.mousedownShape,o.set("capture",!1),this.draggingShape=o,this.dragging=!0,this._emitEvent("dragstart",r,n,o),this.mousedownShape=null,this.mousedownPoint=null):!s&&i.get("draggable")?(this.dragging=!0,this._emitEvent("dragstart",r,n,null),this.mousedownShape=null,this.mousedownPoint=null):(this._emitMouseoverEvents(r,n,a,t),this._emitEvent("mousemove",r,n,t)):(this._emitMouseoverEvents(r,n,a,t),this._emitEvent("mousemove",r,n,t))}else this._emitMouseoverEvents(r,n,a,t),this._emitEvent("mousemove",r,n,t)}},e.prototype._emitEvent=function(n,t,r,i,a,o){var l=this._getEventObj(n,t,r,i,a,o);if(i){l.shape=i,$T(i,n,l);for(var s=i.getParent();s;)s.emitDelegation(n,l),l.propagationStopped||qle(s,n,l),l.propagationPath.push(s),s=s.getParent()}else{var u=this.canvas;$T(u,n,l)}},e.prototype.destroy=function(){this._clearEvents(),this.canvas=null,this.currentShape=null,this.draggingShape=null,this.mousedownPoint=null,this.mousedownShape=null,this.mousedownTimeStamp=null},e}(),OT="px",TT=l4(),Zle=TT&&TT.name==="firefox",u0=function(e){Y(n,e);function n(t){var r=e.call(this,t)||this;return r.initContainer(),r.initDom(),r.initEvents(),r.initTimeline(),r}return n.prototype.getDefaultCfg=function(){var t=e.prototype.getDefaultCfg.call(this);return t.cursor="default",t.supportCSSTransform=!1,t},n.prototype.initContainer=function(){var t=this.get("container");ct(t)&&(t=document.getElementById(t),this.set("container",t))},n.prototype.initDom=function(){var t=this.createDom();this.set("el",t);var r=this.get("container");r.appendChild(t),this.setDOMSize(this.get("width"),this.get("height"))},n.prototype.initEvents=function(){var t=new Qle({canvas:this});t.init(),this.set("eventController",t)},n.prototype.initTimeline=function(){var t=new Yle(this);this.set("timeline",t)},n.prototype.setDOMSize=function(t,r){var i=this.get("el");eT&&(i.style.width=t+OT,i.style.height=r+OT)},n.prototype.changeSize=function(t,r){this.setDOMSize(t,r),this.set("width",t),this.set("height",r),this.onCanvasChange("changeSize")},n.prototype.getRenderer=function(){return this.get("renderer")},n.prototype.getCursor=function(){return this.get("cursor")},n.prototype.setCursor=function(t){this.set("cursor",t);var r=this.get("el");eT&&r&&(r.style.cursor=t)},n.prototype.getPointByEvent=function(t){var r=this.get("supportCSSTransform");if(r){if(Zle&&!ve(t.layerX)&&t.layerX!==t.offsetX)return{x:t.layerX,y:t.layerY};if(!ve(t.offsetX))return{x:t.offsetX,y:t.offsetY}}var i=this.getClientByEvent(t),a=i.x,o=i.y;return this.getPointByClient(a,o)},n.prototype.getClientByEvent=function(t){var r=t;return t.touches&&(t.type==="touchend"?r=t.changedTouches[0]:r=t.touches[0]),{x:r.clientX,y:r.clientY}},n.prototype.getPointByClient=function(t,r){var i=this.get("el"),a=i.getBoundingClientRect();return{x:t-a.left,y:r-a.top}},n.prototype.getClientByPoint=function(t,r){var i=this.get("el"),a=i.getBoundingClientRect();return{x:t+a.left,y:r+a.top}},n.prototype.draw=function(){},n.prototype.removeDom=function(){var t=this.get("el");t.parentNode.removeChild(t)},n.prototype.clearEvents=function(){var t=this.get("eventController");t.destroy()},n.prototype.isCanvas=function(){return!0},n.prototype.getParent=function(){return null},n.prototype.destroy=function(){var t=this.get("timeline");this.get("destroyed")||(this.clear(),t&&t.stop(),this.clearEvents(),this.removeDom(),e.prototype.destroy.call(this))},n}(v4),c0=function(e){Y(n,e);function n(){return e!==null&&e.apply(this,arguments)||this}return n.prototype.isGroup=function(){return!0},n.prototype.isEntityGroup=function(){return!1},n.prototype.clone=function(){for(var t=e.prototype.clone.call(this),r=this.getChildren(),i=0;i=t&&i.minY<=r&&i.maxY>=r},n.prototype.afterAttrsChange=function(t){e.prototype.afterAttrsChange.call(this,t),this.clearCacheBBox()},n.prototype.getBBox=function(){var t=this.cfg.bbox;return t||(t=this.calculateBBox(),this.set("bbox",t)),t},n.prototype.getCanvasBBox=function(){var t=this.cfg.canvasBBox;return t||(t=this.calculateCanvasBBox(),this.set("canvasBBox",t)),t},n.prototype.applyMatrix=function(t){e.prototype.applyMatrix.call(this,t),this.set("canvasBBox",null)},n.prototype.calculateCanvasBBox=function(){var t=this.getBBox(),r=this.getTotalMatrix(),i=t.minX,a=t.minY,o=t.maxX,l=t.maxY;if(r){var s=Do(r,[t.minX,t.minY]),u=Do(r,[t.maxX,t.minY]),c=Do(r,[t.minX,t.maxY]),d=Do(r,[t.maxX,t.maxY]);i=Math.min(s[0],u[0],c[0],d[0]),o=Math.max(s[0],u[0],c[0],d[0]),a=Math.min(s[1],u[1],c[1],d[1]),l=Math.max(s[1],u[1],c[1],d[1])}var f=this.attrs;if(f.shadowColor){var h=f.shadowBlur,v=h===void 0?0:h,g=f.shadowOffsetX,m=g===void 0?0:g,p=f.shadowOffsetY,x=p===void 0?0:p,b=i-v+m,w=o+v+m,S=a-v+x,C=l+v+x;i=Math.min(i,b),o=Math.max(o,w),a=Math.min(a,S),l=Math.max(l,C)}return{x:i,y:a,minX:i,minY:a,maxX:o,maxY:l,width:o-i,height:l-a}},n.prototype.clearCacheBBox=function(){this.set("bbox",null),this.set("canvasBBox",null)},n.prototype.isClipShape=function(){return this.get("isClipShape")},n.prototype.isInShape=function(t,r){return!1},n.prototype.isOnlyHitBox=function(){return!1},n.prototype.isHit=function(t,r){var i=this.get("startArrowShape"),a=this.get("endArrowShape"),o=[t,r,1];o=this.invertFromMatrix(o);var l=o[0],s=o[1],u=this._isInBBox(l,s);return this.isOnlyHitBox()?u:!!(u&&!this.isClipped(l,s)&&(this.isInShape(l,s)||i&&i.isHit(l,s)||a&&a.isHit(l,s)))},n}(d4),O4=new Map;function wa(e,n){O4.set(e,n)}function f0(e){return O4.get(e)}function T4(e){var n=e.attr(),t=n.x,r=n.y,i=n.width,a=n.height;return{x:t,y:r,width:i,height:a}}function P4(e){var n=e.attr(),t=n.x,r=n.y,i=n.r;return{x:t-i,y:r-i,width:i*2,height:i*2}}function Ur(e,n,t,r){var i=e-t,a=n-r;return Math.sqrt(i*i+a*a)}function pp(e,n){return Math.abs(e-n)<.001}function bd(e,n){var t=ya(e),r=ya(n),i=Xi(e),a=Xi(n);return{x:t,y:r,width:i-t,height:a-r}}function h0(e){return(e+Math.PI*2)%(Math.PI*2)}const kr={box:function(e,n,t,r){return bd([e,t],[n,r])},length:function(e,n,t,r){return Ur(e,n,t,r)},pointAt:function(e,n,t,r,i){return{x:(1-i)*e+i*t,y:(1-i)*n+i*r}},pointDistance:function(e,n,t,r,i,a){var o=(t-e)*(i-e)+(r-n)*(a-n);if(o<0)return Ur(e,n,i,a);var l=(t-e)*(t-e)+(r-n)*(r-n);return o>l?Ur(t,r,i,a):this.pointToLine(e,n,t,r,i,a)},pointToLine:function(e,n,t,r,i,a){var o=[t-e,r-n];if(Poe(o,[0,0]))return Math.sqrt((i-e)*(i-e)+(a-n)*(a-n));var l=[-o[1],o[0]];u4(l,l);var s=[i-e,a-n];return Math.abs(Ooe(s,l))},tangentAngle:function(e,n,t,r){return Math.atan2(r-n,t-e)}};var Jle=1e-4;function A4(e,n,t,r,i,a){var o,l=1/0,s=[t,r],u=20;a&&a>200&&(u=a/10);for(var c=1/u,d=c/10,f=0;f<=u;f++){var h=f*c,v=[i.apply(null,e.concat([h])),i.apply(null,n.concat([h]))],g=Ur(s[0],s[1],v[0],v[1]);g=0&&g=0?[i]:[]}function AT(e,n,t,r){return 2*(1-r)*(n-e)+2*r*(t-n)}function R4(e,n,t,r,i,a,o){var l=pl(e,t,i,o),s=pl(n,r,a,o),u=kr.pointAt(e,n,t,r,o),c=kr.pointAt(t,r,i,a,o);return[[e,n,u.x,u.y,l,s],[l,s,c.x,c.y,i,a]]}function kw(e,n,t,r,i,a,o){if(o===0)return(Ur(e,n,t,r)+Ur(t,r,i,a)+Ur(e,n,i,a))/2;var l=R4(e,n,t,r,i,a,.5),s=l[0],u=l[1];return s.push(o-1),u.push(o-1),kw.apply(null,s)+kw.apply(null,u)}const F4={box:function(e,n,t,r,i,a){var o=PT(e,t,i)[0],l=PT(n,r,a)[0],s=[e,i],u=[n,a];return o!==void 0&&s.push(pl(e,t,i,o)),l!==void 0&&u.push(pl(n,r,a,l)),bd(s,u)},length:function(e,n,t,r,i,a){return kw(e,n,t,r,i,a,3)},nearestPoint:function(e,n,t,r,i,a,o,l){return A4([e,t,i],[n,r,a],o,l,pl)},pointDistance:function(e,n,t,r,i,a,o,l){var s=this.nearestPoint(e,n,t,r,i,a,o,l);return Ur(s.x,s.y,o,l)},interpolationAt:pl,pointAt:function(e,n,t,r,i,a,o){return{x:pl(e,t,i,o),y:pl(n,r,a,o)}},divide:function(e,n,t,r,i,a,o){return R4(e,n,t,r,i,a,o)},tangentAngle:function(e,n,t,r,i,a,o){var l=AT(e,t,i,o),s=AT(n,r,a,o),u=Math.atan2(s,l);return h0(u)}};function ml(e,n,t,r,i){var a=1-i;return a*a*a*e+3*n*i*a*a+3*t*i*i*a+r*i*i*i}function RT(e,n,t,r,i){var a=1-i;return 3*(a*a*(n-e)+2*a*i*(t-n)+i*i*(r-t))}function w1(e,n,t,r){var i=-3*e+9*n-9*t+3*r,a=6*e-12*n+6*t,o=3*n-3*e,l=[],s,u,c;if(pp(i,0))pp(a,0)||(s=-o/a,s>=0&&s<=1&&l.push(s));else{var d=a*a-4*i*o;pp(d,0)?l.push(-a/(2*i)):d>0&&(c=Math.sqrt(d),s=(-a+c)/(2*i),u=(-a-c)/(2*i),s>=0&&s<=1&&l.push(s),u>=0&&u<=1&&l.push(u))}return l}function L4(e,n,t,r,i,a,o,l,s){var u=ml(e,t,i,o,s),c=ml(n,r,a,l,s),d=kr.pointAt(e,n,t,r,s),f=kr.pointAt(t,r,i,a,s),h=kr.pointAt(i,a,o,l,s),v=kr.pointAt(d.x,d.y,f.x,f.y,s),g=kr.pointAt(f.x,f.y,h.x,h.y,s);return[[e,n,d.x,d.y,v.x,v.y,u,c],[u,c,g.x,g.y,h.x,h.y,o,l]]}function Mw(e,n,t,r,i,a,o,l,s){if(s===0)return ese([e,t,i,o],[n,r,a,l]);var u=L4(e,n,t,r,i,a,o,l,.5),c=u[0],d=u[1];return c.push(s-1),d.push(s-1),Mw.apply(null,c)+Mw.apply(null,d)}const Ff={extrema:w1,box:function(e,n,t,r,i,a,o,l){for(var s=[e,o],u=[n,l],c=w1(e,t,i,o),d=w1(n,r,a,l),f=0;f0?t:t*-1}const tse={box:function(e,n,t,r){return{x:e-t,y:n-r,width:t*2,height:r*2}},length:function(e,n,t,r){return Math.PI*(3*(t+r)-Math.sqrt((3*t+r)*(t+3*r)))},nearestPoint:function(e,n,t,r,i,a){var o=t,l=r;if(o===0||l===0)return{x:e,y:n};for(var s=i-e,u=a-n,c=Math.abs(s),d=Math.abs(u),f=o*o,h=l*l,v=Math.PI/4,g,m,p=0;p<4;p++){g=o*Math.cos(v),m=l*Math.sin(v);var x=(f-h)*Math.pow(Math.cos(v),3)/o,b=(h-f)*Math.pow(Math.sin(v),3)/l,w=g-x,S=m-b,C=c-x,E=d-b,k=Math.hypot(S,w),I=Math.hypot(E,C),$=k*Math.asin((w*E-S*C)/(k*I)),T=$/Math.sqrt(f+h-g*g-m*m);v+=T,v=Math.min(Math.PI/2,Math.max(0,v))}return{x:e+FT(g,s),y:n+FT(m,u)}},pointDistance:function(e,n,t,r,i,a){var o=this.nearestPoint(e,n,t,r,i,a);return Ur(o.x,o.y,i,a)},pointAt:function(e,n,t,r,i){var a=2*Math.PI*i;return{x:e+t*Math.cos(a),y:n+r*Math.sin(a)}},tangentAngle:function(e,n,t,r,i){var a=2*Math.PI*i,o=Math.atan2(r*Math.cos(a),-t*Math.sin(a));return h0(o)}};function nse(e,n,t,r,i,a,o,l){return-1*t*Math.cos(i)*Math.sin(l)-r*Math.sin(i)*Math.cos(l)}function rse(e,n,t,r,i,a,o,l){return-1*t*Math.sin(i)*Math.sin(l)+r*Math.cos(i)*Math.cos(l)}function ise(e,n,t){return Math.atan(-n/e*Math.tan(t))}function ase(e,n,t){return Math.atan(n/(e*Math.tan(t)))}function LT(e,n,t,r,i,a){return t*Math.cos(i)*Math.cos(a)-r*Math.sin(i)*Math.sin(a)+e}function DT(e,n,t,r,i,a){return t*Math.sin(i)*Math.cos(a)+r*Math.cos(i)*Math.sin(a)+n}function ose(e,n,t,r){var i=Math.atan2(r*e,t*n);return(i+Math.PI*2)%(Math.PI*2)}function NT(e,n,t){return{x:e*Math.cos(t),y:n*Math.sin(t)}}function BT(e,n,t){var r=Math.cos(t),i=Math.sin(t);return[e*r-n*i,e*i+n*r]}const lse={box:function(e,n,t,r,i,a,o){for(var l=ise(t,r,i),s=1/0,u=-1/0,c=[a,o],d=-Math.PI*2;d<=Math.PI*2;d+=Math.PI){var f=l+d;au&&(u=h)}for(var v=ase(t,r,i),g=1/0,m=-1/0,p=[a,o],d=-Math.PI*2;d<=Math.PI*2;d+=Math.PI){var x=v+d;am&&(m=b)}return{x:s,y:g,width:u-s,height:m-g}},length:function(e,n,t,r,i,a,o){},nearestPoint:function(e,n,t,r,i,a,o,l,s){var u=BT(l-e,s-n,-i),c=u[0],d=u[1],f=tse.nearestPoint(0,0,t,r,c,d),h=ose(t,r,f.x,f.y);ho&&(f=NT(t,r,o));var v=BT(f.x,f.y,i);return{x:v[0]+e,y:v[1]+n}},pointDistance:function(e,n,t,r,i,a,o,l,s){var u=this.nearestPoint(e,n,t,r,l,s);return Ur(u.x,u.y,l,s)},pointAt:function(e,n,t,r,i,a,o,l){var s=(o-a)*l+a;return{x:LT(e,n,t,r,i,s),y:DT(e,n,t,r,i,s)}},tangentAngle:function(e,n,t,r,i,a,o,l){var s=(o-a)*l+a,u=nse(e,n,t,r,i,a,o,s),c=rse(e,n,t,r,i,a,o,s);return h0(Math.atan2(c,u))}};function D4(e){for(var n=0,t=[],r=0;r1||n<0||e.length<2)return null;var t=D4(e),r=t.segments,i=t.totalLength;if(i===0)return{x:e[0][0],y:e[0][1]};for(var a=0,o=null,l=0;l=a&&n<=a+d){var f=(n-a)/d;o=kr.pointAt(u[0],u[1],c[0],c[1],f);break}a+=d}return o}function cse(e,n){if(n>1||n<0||e.length<2)return 0;for(var t=D4(e),r=t.segments,i=t.totalLength,a=0,o=0,l=0;l=a&&n<=a+d){o=Math.atan2(c[1]-u[1],c[0]-u[0]);break}a+=d}return o}function dse(e,n,t){for(var r=1/0,i=0;i1){var i=vse(n,t);return n*r+i*(r-1)}return n}function vse(e,n){return n?n-e:e*.14}function gse(e,n){var t=v0(),r=0;if(ve(e)||e==="")return r;if(t.save(),t.font=n,ct(e)&&e.includes(` `)){var i=e.split(` diff --git a/index.html b/index.html index ab01fe8..a66e1f9 100644 --- a/index.html +++ b/index.html @@ -6,7 +6,7 @@ Leetcode Daily - +