winXP/7/8/8.1/10专业版/旗舰版无人值守文件
winXP/7/8/8.1/10专业版/旗舰版无人值守文件，其中win7是旗舰版的应答文件，其余为专业版的应答文件。32位安装情况笔者用WinNTSetup安装器测试有效，64位未测试，笔者使用的镜像在括号内已经注明，所有镜像在已分区的情况下默认安装在C盘，32位和64位的区别就是把x86换成了amd64,其中win8.1的应答文件跟其它的不太一样，会新建一个管理员用户，其余的直接使用Administrator用户
理论上win8应该能和win8.1/10通用
32位应答文件winnt.sif
32位应答文件AutoUnattend.xml
理论上win8应该能和win8.1/10通用
一、XP
(32位镜像名：zh-hans_windows_xp_professional_with_service_pack_3_x86_cd_vl_x14-74070.iso)32位应答文件winnt.sif
;SetupMgrTag
[Data]
AutoPartition=0
MsDosInitiated="0"
UnattendedInstall="Yes"
[Unattended]
UnattendMode=FullUnattended
OemSkipEula=Yes
OemPreinstall=No
TargetPath=\WINDOWS
UnattendSwitch="Yes"
[GuiUnattended]
AdminPassword=*
EncryptedAdminPassword=NO
OEMSkipRegional=1
TimeZone=210
OemSkipWelcome=1
[UserData]
ProductKey=MRX3F-47B9T-2487J-KWKMF-RPWBY
FullName="ZBEZJ"
OrgName="ZGHB"
ComputerName=*
[RegionalSettings]
LanguageGroup=10
[Identification]
JoinWorkgroup=WORKGROUP
[Networking]
InstallDefaultComponents=Yes
二、win7
(32位镜像名：cn_windows_7_ultimate_with_sp1_x86_dvd_u_677486.iso)32位应答文件AutoUnattend.xml
zh-CN
zh-CN
zh-CN
zh-CN
zh-CN
true
OnError
/image/index
5
ZBEZJ
true
true
China Standand Time
UABhAHMAcwB3AG8AcgBkAA==
false</PlainText>
</Password>
<Username>Administrator</Username>
<Enabled>true</Enabled>
</AutoLogon>
</component>
</settings>
<cpi:offlineImage cpi:source="catalog://vmware-host/shared folders/f/install_windows 7 ultimate.clg" xmlns:cpi="urn:schemas-microsoft-com:cpi" />
</unattend>
</code></pre>
<br> 64位应答文件AutoUnattend.xml
<br>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallFrom>
<MetaData wcm:action="add">
<Value>4</Value>
<Key>/image/index</Key>
</MetaData>
</InstallFrom>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<WillShowUI>OnError</WillShowUI>
<Key />
</ProductKey>
<AcceptEula>true</AcceptEula>
</UserData>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>ZBEZJ</ComputerName>
<TimeZone>China Standand Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-Licensing-SLC-UX" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<AutoLogon>
<Password>
<Value>UABhAHMAcwB3AG8AcgBkAA==</Value>
<PlainText>false</PlainText>
</Password>
<Username>Administrator</Username>
<Enabled>true</Enabled>
</AutoLogon>
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
</OOBE>
<TimeZone>China Standand Time</TimeZone>
</component>
</settings>
<cpi:offlineImage cpi:source="catalog:f:/install_windows 7 ultimate.clg" xmlns:cpi="urn:schemas-microsoft-com:cpi" />
</unattend>
</code></pre>
<br>
<br>
<h1>三、win8</h1> (32位镜像名：cn_windows_8_x86_dvd_915414.iso)
<br> 32位应答文件AutoUnattend.xml
<br>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallToAvailablePartition>false</InstallToAvailablePartition>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<WillShowUI>OnError</WillShowUI>
</ProductKey>
<AcceptEula>true</AcceptEula>
<FullName>Windows8</FullName>
<Organization>WORKGROUP</Organization>
</UserData>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
<SkipUserOOBE>false</SkipUserOOBE>
</OOBE>
<AutoLogon>
<Username>Administrator</Username>
<Enabled>true</Enabled>
<LogonCount>1</LogonCount>
</AutoLogon>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>*</ComputerName>
<TimeZone>China Standard Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-SPP-UX" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<cpi:offlineImage cpi:source="wim:f:/install.wim#Windows 8 Pro" xmlns:cpi="urn:schemas-microsoft-com:cpi" />
</unattend>
</code></pre>
<br> 64位应答文件AutoUnattend.xml
<br>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallToAvailablePartition>false</InstallToAvailablePartition>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<WillShowUI>OnError</WillShowUI>
</ProductKey>
<AcceptEula>true</AcceptEula>
<FullName>Windows8</FullName>
<Organization>WORKGROUP</Organization>
</UserData>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
<SkipUserOOBE>false</SkipUserOOBE>
</OOBE>
<AutoLogon>
<Username>Administrator</Username>
<Enabled>true</Enabled>
<LogonCount>1</LogonCount>
</AutoLogon>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>*</ComputerName>
<TimeZone>China Standard Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-SPP-UX" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<cpi:offlineImage cpi:source="wim:f:/install.wim#Windows 8 Pro" xmlns:cpi="urn:schemas-microsoft-com:cpi" />
</unattend>
</code></pre>
<br>
<br>
<h1>四、win8.1</h1> (32位镜像名：cn_windows_8.1_pro_vl_with_update_x86_dvd_6050910.iso)
<br> 32位应答文件AutoUnattend.xml
<br>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<DiskConfiguration>
<Disk wcm:action="add">
<ModifyPartitions>
<ModifyPartition wcm:action="add">
<Active>true</Active>
<Format>NTFS</Format>
<Letter>C</Letter>
<Order>1</Order>
<PartitionID>1</PartitionID>
</ModifyPartition>
</ModifyPartitions>
<DiskID>0</DiskID>
<WillWipeDisk>false</WillWipeDisk>
</Disk>
<WillShowUI>OnError</WillShowUI>
</DiskConfiguration>
<ImageInstall>
<OSImage>
<InstallTo>
<DiskID>0</DiskID>
<PartitionID>1</PartitionID>
</InstallTo>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
</component>
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallToAvailablePartition>false</InstallToAvailablePartition>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<WillShowUI>OnError</WillShowUI>
</ProductKey>
<AcceptEula>true</AcceptEula>
<FullName>Windows</FullName>
<Organization>WORKGROUP</Organization>
</UserData>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
<SkipUserOOBE>false</SkipUserOOBE>
</OOBE>
<UserAccounts>
<LocalAccounts>
<LocalAccount wcm:action="add">
<Password>
<Value>UABhAHMAcwB3AG8AcgBkAA==</Value>
<PlainText>false</PlainText>
</Password>
<Group>Administrators</Group>
<Name>MyPC</Name>
</LocalAccount>
</LocalAccounts>
</UserAccounts>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>*</ComputerName>
<TimeZone>China Standard Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-SPP-UX" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<cpi:offlineImage cpi:source="wim:x:/GRMSXFREO/sources/install.wim" xmlns:cpi="urn:schemas-microsoft-com:cpi"></cpi:offlineImage>
</unattend></code></pre>
<br>
<br> 64位应答文件AutoUnattend.xml
<br>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<DiskConfiguration>
<Disk wcm:action="add">
<ModifyPartitions>
<ModifyPartition wcm:action="add">
<Active>true</Active>
<Format>NTFS</Format>
<Letter>C</Letter>
<Order>1</Order>
<PartitionID>1</PartitionID>
</ModifyPartition>
</ModifyPartitions>
<DiskID>0</DiskID>
<WillWipeDisk>false</WillWipeDisk>
</Disk>
<WillShowUI>OnError</WillShowUI>
</DiskConfiguration>
<ImageInstall>
<OSImage>
<InstallTo>
<DiskID>0</DiskID>
<PartitionID>1</PartitionID>
</InstallTo>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
</component>
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallToAvailablePartition>false</InstallToAvailablePartition>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<WillShowUI>OnError</WillShowUI>
</ProductKey>
<AcceptEula>true</AcceptEula>
<FullName>Windows</FullName>
<Organization>WORKGROUP</Organization>
</UserData>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
<SkipUserOOBE>false</SkipUserOOBE>
</OOBE>
<UserAccounts>
<LocalAccounts>
<LocalAccount wcm:action="add">
<Password>
<Value>UABhAHMAcwB3AG8AcgBkAA==</Value>
<PlainText>false</PlainText>
</Password>
<Group>Administrators</Group>
<Name>MyPC</Name>
</LocalAccount>
</LocalAccounts>
</UserAccounts>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>*</ComputerName>
<TimeZone>China Standard Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-SPP-UX" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<cpi:offlineImage cpi:source="wim:x:/GRMSXFREO/sources/install.wim" xmlns:cpi="urn:schemas-microsoft-com:cpi"></cpi:offlineImage>
</unattend></code></pre>
<br>
<br>
<h1>五、win10</h1> (32位镜像名：cn_windows_10_multiple_editions_version_1511_x86_dvd_7223635.iso)
<br> 32位应答文件AutoUnattend.xml
<br>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallToAvailablePartition>false</InstallToAvailablePartition>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<Key>W269N-WFGWX-YVC9B-4J6C9-T83GX</Key>
<WillShowUI>OnError</WillShowUI>
</ProductKey>
<AcceptEula>true</AcceptEula>
<FullName>Windows10</FullName>
<Organization>WORKGROUP</Organization>
</UserData>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
<SkipUserOOBE>false</SkipUserOOBE>
</OOBE>
<AutoLogon>
<Username>Administrator</Username>
<Enabled>true</Enabled>
<LogonCount>1</LogonCount>
</AutoLogon>
<LogonCommands>
<AsynchronousCommand wcm:action="add">
<CommandLine>%WINDIR%\1.cmd</CommandLine>
<Description>Active</Description>
<Order>1</Order>
</AsynchronousCommand>
</LogonCommands>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>*</ComputerName>
<TimeZone>China Standard Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-SPP-UX" processorArchitecture="x86" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<cpi:offlineImage cpi:source="wim:f:/install.wim#Windows 10 Pro" xmlns:cpi="urn:schemas-microsoft-com:cpi" />
</unattend></code></pre>
<br>
<br> 64位应答文件AutoUnattend.xml
<p></p>
<pre><code class="language-html"><?xml version="1.0" encoding="utf-8"?>
<unattend xmlns="urn:schemas-microsoft-com:unattend">
<settings pass="windowsPE">
<component name="Microsoft-Windows-International-Core-WinPE" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SetupUILanguage>
<UILanguage>zh-CN</UILanguage>
</SetupUILanguage>
<InputLocale>zh-CN</InputLocale>
<SystemLocale>zh-CN</SystemLocale>
<UILanguage>zh-CN</UILanguage>
<UserLocale>zh-CN</UserLocale>
</component>
<component name="Microsoft-Windows-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ImageInstall>
<OSImage>
<InstallToAvailablePartition>false</InstallToAvailablePartition>
<WillShowUI>OnError</WillShowUI>
</OSImage>
</ImageInstall>
<UserData>
<ProductKey>
<Key>W269N-WFGWX-YVC9B-4J6C9-T83GX</Key>
<WillShowUI>OnError</WillShowUI>
</ProductKey>
<AcceptEula>true</AcceptEula>
<FullName>Windows10</FullName>
<Organization>WORKGROUP</Organization>
</UserData>
</component>
</settings>
<settings pass="oobeSystem">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<OOBE>
<SkipMachineOOBE>true</SkipMachineOOBE>
<SkipUserOOBE>false</SkipUserOOBE>
</OOBE>
<AutoLogon>
<Username>Administrator</Username>
<Enabled>true</Enabled>
<LogonCount>1</LogonCount>
</AutoLogon>
<LogonCommands>
<AsynchronousCommand wcm:action="add">
<CommandLine>%WINDIR%\1.cmd</CommandLine>
<Description>Active</Description>
<Order>1</Order>
</AsynchronousCommand>
</LogonCommands>
</component>
</settings>
<settings pass="specialize">
<component name="Microsoft-Windows-Shell-Setup" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<ComputerName>*</ComputerName>
<TimeZone>China Standard Time</TimeZone>
</component>
<component name="Microsoft-Windows-Security-SPP-UX" processorArchitecture="amd64" publicKeyToken="31bf3856ad364e35" language="neutral" versionScope="nonSxS" xmlns:wcm="http://schemas.microsoft.com/WMIConfig/2002/State" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<SkipAutoActivation>true</SkipAutoActivation>
</component>
</settings>
<cpi:offlineImage cpi:source="wim:f:/install.wim#Windows 10 Pro" xmlns:cpi="urn:schemas-microsoft-com:cpi" />
</unattend></code></pre>
<br>
<br>
</div>
</div>
</div>
</div>
</div>
<!--PC和WAP自适应版-->
<div id="SOHUCS" sid="1187795551370977280"></div>
<script type="text/javascript" src="/views/front/js/chanyan.js"></script>
<!-- 文章页-底部 动态广告位 -->
<div class="youdao-fixed-ad" id="detail_ad_bottom"></div>
</div>
<div class="col-md-3">
<div class="row" id="ad">
<!-- 文章页-右侧1 动态广告位 -->
<div id="right-1" class="col-lg-12 col-md-12 col-sm-4 col-xs-4 ad">
<div class="youdao-fixed-ad" id="detail_ad_1"> </div>
</div>
<!-- 文章页-右侧2 动态广告位 -->
<div id="right-2" class="col-lg-12 col-md-12 col-sm-4 col-xs-4 ad">
<div class="youdao-fixed-ad" id="detail_ad_2"></div>
</div>
<!-- 文章页-右侧3 动态广告位 -->
<div id="right-3" class="col-lg-12 col-md-12 col-sm-4 col-xs-4 ad">
<div class="youdao-fixed-ad" id="detail_ad_3"></div>
</div>
</div>
</div>
</div>
</div>
</div>
<div class="container">
<h4 class="pt20 mb15 mt0 border-top">你可能感兴趣的:(随想)</h4>
<div id="paradigm-article-related">
<div class="recommend-post mb30">
<ul class="widget-links">
<li><a href="/article/1894537539373559808.htm"
title="二叉树-左叶子之和" target="_blank">二叉树-左叶子之和</a>
<span class="text-muted">Hasno.</span>
<a class="tag" taget="_blank" href="/search/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>代码随想录-刷题笔记404.左叶子之和-力扣（LeetCode）内容：该题仅作为搜索，但是其中的规则让人摸不着头脑，看起来似乎很头疼但是仔细一思考，能发现左叶子无非是这样的定义当发现一个节点的左孩子不为null,并且左孩子的左右孩子都为null(叶子结点)那么可以知道，找到了左叶子OK，接下来就是常规的搜索,只要搜索到满足这样的节点，直接加到一个全局变量就OK了/***Definitionfora</div>
</li>
<li><a href="/article/1894535269256851456.htm"
title="二叉树-二叉树的所有路径" target="_blank">二叉树-二叉树的所有路径</a>
<span class="text-muted">Hasno.</span>
<a class="tag" taget="_blank" href="/search/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>代码随想录-刷题笔记257.二叉树的所有路径-力扣（LeetCode）内容：本题是一道递归+回溯的问题,其实递归和回溯是一个意思，但是这道题一定要明显的进行一次回溯。毕竟每一条路径都不太一样，收集完一次结果之后，需要把上一次探的节点给撤销.这一步就是很明显回溯回溯部分在回溯篇章再去详细写一篇笔记,因此本文只做介绍,至于路径问题,真可谓是回溯的常客了.哦，对每次都想吐槽一下Java的神奇的字符串,必</div>
</li>
<li><a href="/article/1894511693061484544.htm"
title="代码随想录算法训练营Day57 | 拓扑排序精讲、dijkstra（朴素版）精讲" target="_blank">代码随想录算法训练营Day57 | 拓扑排序精讲、dijkstra（朴素版）精讲</a>
<span class="text-muted">Harryline-lx</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95/1.htm">代码随想录</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>文章目录117.软件构建思路与重点47.参加科学大会思路与重点117.软件构建题目链接：117.软件构建讲解链接：代码随想录状态：一遍AC。思路与重点概括来说，给出一个有向图，把这个有向图转成线性的排序就叫拓扑排序。拓扑排序也是图论中判断有向无环图的常用方法。拓扑排序模板题。#include#include#include#includeusingnamespacestd;intmain(){in</div>
</li>
<li><a href="/article/1894503120365481984.htm"
title="代码随想录算法训练营第58天|拓扑排序精讲、dijkstra（朴素版）精讲" target="_blank">代码随想录算法训练营第58天|拓扑排序精讲、dijkstra（朴素版）精讲</a>
<span class="text-muted">Yinems</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>打卡Day581.拓扑排序精讲2.dijkstra（朴素版）精讲1.拓扑排序精讲题目链接：拓扑排序精讲文档讲解：代码随想录给出一个有向图，把这个有向图转成线性的排序就叫拓扑排序。拓扑排序要检测这个有向图是否有环，即存在循环依赖的情况，因为这种情况是不能做线性排序的。所以拓扑排序是图论中判断有向无环图的常用方法。拓扑排序的过程，有两步，第一步，找到入度为0的节点，加入结果集；第二步，将该节点从图中移</div>
</li>
<li><a href="/article/1894338727543631872.htm"
title="二叉树-二叉树的最大深度" target="_blank">二叉树-二叉树的最大深度</a>
<span class="text-muted">Hasno.</span>
<a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>代码随想录-刷题笔记104.二叉树的最大深度-力扣（LeetCode）内容:本题较为基础,可以说是深搜的入门款，深搜的具体知识点请看图论-表示形式&深度优先搜索-CSDN博客这篇文章当然二叉树肯定不会跟通用的深搜模板一样那么复杂，只需要处理左右两个子树即可.对于二叉树分为三种遍历方式二叉树的前序遍历求深度-深度是从根节点开始算，一直到叶子节点二叉树的后序遍历求高度-高度是从叶子节点开始算，一直到根</div>
</li>
<li><a href="/article/1894032982847582208.htm"
title="代码随想录算法营Day48 ｜ 300. 最长递增子序列，674. 最长连续递增序列，718. 最长重复子数组" target="_blank">代码随想录算法营Day48 ｜ 300. 最长递增子序列，674. 最长连续递增序列，718. 最长重复子数组</a>
<span class="text-muted">寂枫zero</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/python/1.htm">python</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a>
<div>300.最长递增子序列这道题初始化有一个一维数组，数组的索引表示从0到当前索引时nums中最长的递增子序列的长度。第一个for遍历每一个索引，第二个for遍历从0到当前索引时，更新dp数组中当前索引时最长的递增子序列的长度。classSolution:deflengthOfLIS(self,nums:List[int])->int:ifnotnums:return0dp=[1]*len(nums)</div>
</li>
<li><a href="/article/1893979152260853760.htm"
title="二叉树-对称二叉树" target="_blank">二叉树-对称二叉树</a>
<span class="text-muted">Hasno.</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>代码随想录-刷题笔记101.对称二叉树-力扣（LeetCode）内容:本题有一定的难度，但其实想明白需要同时用到左右节点之后，就没什么难度了本题是看左右是否对称，并非左右节点是否相等，相信仔细读过题不可能不明白这一点好了，接下来开始递归三部曲1.确定返回值和参数因为要返回trueorfalse,所以一定是bool类型,参数上面也提到一定要是左右节点publicbooleancompare(Tree</div>
</li>
<li><a href="/article/1893793178973171712.htm"
title="通俗易懂的KMP算法（C++）" target="_blank">通俗易懂的KMP算法（C++）</a>
<span class="text-muted">想学到东西的W</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a>
<div>最近按照代码随想录中整理的顺序刷力扣题，刷到后第一次了解到KMP算法，看了B站视频，觉得卡哥这集讲的有些精炼，于是自己通过代码理解了一下后，用比较通俗形象的方式，向大家介绍一下KMP算法。一什么是KMP算法KMP算法是由Knuth，Morris和Pratt三位学者发明的，所以取了三位学者名字的首字母，称作KMP算法。KMP算法主要用在字符串匹配上。比如我们从字符串"acfacfgded"（需要在哪</div>
</li>
<li><a href="/article/1893609878459576320.htm"
title="随想录Day 64| 图论part01" target="_blank">随想录Day 64| 图论part01</a>
<span class="text-muted">转行中的小石头</span>
<a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a>
<div>随想录Day64|图论part01深度搜索广度搜索98所有可达路径题目描述给定一个有n个节点的有向无环图，节点编号从1到n。请编写一个函数，找出并返回所有从节点1到节点n的路径。每条路径应以节点编号的列表形式表示。输入描述第一行包含两个整数N，M，表示图中拥有N个节点，M条边后续M行，每行包含两个整数s和t，表示图中的s节点与t节点中有一条路径输出描述输出所有的可达路径，路径中所有节点之间空格隔开</div>
</li>
<li><a href="/article/1893517965022785536.htm"
title="代码随想录训练营第二十三天| 39. 组合总和 40.组合总和II 131.分割回文串" target="_blank">代码随想录训练营第二十三天| 39. 组合总和 40.组合总和II 131.分割回文串</a>
<span class="text-muted">chengooooooo</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>39.组合总和题目链接/文章讲解：代码随想录视频讲解：带你学透回溯算法-组合总和（对应「leetcode」力扣题目：39.组合总和）|回溯法精讲！_哔哩哔哩_bilibili//组合问题要考虑是不是在一个集合里操作//最常见的就是递归回溯法//再考虑考虑剪枝classSolution{publicList>combinationSum(int[]candidates,inttarget){List</div>
</li>
<li><a href="/article/1893297017908686848.htm"
title="回溯算法 15. N皇后（难）" target="_blank">回溯算法 15. N皇后（难）</a>
<span class="text-muted">Mophead_Zarathustra</span>
<a class="tag" taget="_blank" href="/search/Mophead%E7%9A%84%E5%B0%8F%E7%99%BD%E5%88%B7%E9%A2%98%E7%AC%94%E8%AE%B0/1.htm">Mophead的小白刷题笔记</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a><a class="tag" taget="_blank" href="/search/python/1.htm">python</a><a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95/1.htm">代码随想录</a><a class="tag" taget="_blank" href="/search/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95/1.htm">回溯算法</a>
<div>回溯算法15.N皇后（难）51.N皇后-力扣（LeetCode）代码随想录难度6-困难题目理解：n皇后问题，其实可以看成：按行顺序依次摆放皇后，每一行只能放一个皇后，那么只要保证每一行新放置的皇后与之前放置的皇后之间，列不重叠且不在之前皇后的斜线上即可要点：下面是我的做法，但我的做法不如后面代码随想录的题解方便和快速，不过大体思想是相通的。创建一个空棋盘used=[[Nonefor_inrange</div>
</li>
<li><a href="/article/1893241537211461632.htm"
title="代码随想录 day51 图论 1-6学习" target="_blank">代码随想录 day51 图论 1-6学习</a>
<span class="text-muted">ggyyToLearning</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E4%B9%8B/1.htm">之</a><a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E5%AD%A6%E4%B9%A0%E4%B8%8E%E5%A4%8D%E4%B9%A0/1.htm">代码随想录学习与复习</a><a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E5%AD%A6%E4%B9%A0/1.htm">学习</a><a class="tag" taget="_blank" href="/search/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a>
<div>99.岛屿数量卡码网题目链接（ACM模式）(opensnewwindow)题目描述：给定一个由1（陆地）和0（水）组成的矩阵，你需要计算岛屿的数量。岛屿由水平方向或垂直方向上相邻的陆地连接而成，并且四周都是水域。你可以假设矩阵外均被水包围。输入描述：第一行包含两个整数N,M，表示矩阵的行数和列数。后续N行，每行包含M个数字，数字为1或者0。输出描述：输出一个整数，表示岛屿的数量。如果不存在岛屿，则</div>
</li>
<li><a href="/article/1893120354075865088.htm"
title="代码随想录算法【Day52】" target="_blank">代码随想录算法【Day52】</a>
<span class="text-muted">yonuyeung</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E7%AE%97%E6%B3%95/1.htm">代码随想录算法</a><a class="tag" taget="_blank" href="/search/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>Day51101.孤岛的总面积思路从周边找到陆地然后通过dfs或者bfs将周边靠陆地且相邻的陆地都变成海洋，然后再去重新遍历地图统计此时还剩下的陆地代码#include#includeusingnamespacestd;intdir[4][2]={-1,0,0,-1,1,0,0,1};//保存四个方向intcount;//统计符合题目要求的陆地空格数量voiddfs(vector>&grid,in</div>
</li>
<li><a href="/article/1892929759831191552.htm"
title="栈和队列-滑动窗口最大值" target="_blank">栈和队列-滑动窗口最大值</a>
<span class="text-muted">Hasno.</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a>
<div>代码随想录-刷题笔记239.滑动窗口最大值-力扣（LeetCode）内容：这道题给我的收获真的很大，主要是学会了一个新的数据结构。单调队列:单调-从名字就可以知道，要么单调递增，要么单调递减。单调队列是从队首开始递减的一个队列，并且一定是单调递减队首应该是第一大，依次是第二大，第三大....针对滑动窗口，无非是进行遍历，使用双指针,一个为start,一个为end二者分别代表窗口的起点和终点，距离是</div>
</li>
<li><a href="/article/1892600369733758976.htm"
title="代码随想录算法营Day44 ｜ 198. 打家劫舍，213. 打家劫舍 II，337. 打家劫舍 III" target="_blank">代码随想录算法营Day44 ｜ 198. 打家劫舍，213. 打家劫舍 II，337. 打家劫舍 III</a>
<span class="text-muted">寂枫zero</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/python/1.htm">python</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a>
<div>198.打家劫舍这道题要求不能偷相邻的房子，那么它的动态转移公式就是dp[i]=max(dp[i-1],dp[i-2]+nums[i])即当前索引能抢的最大值就是前一个索引的值与i-2的索引的值加上当前金额的最大值。defrob(self,nums:List[int])->int:iflen(nums)int:n=len(nums)ifnint:defhelp(root):ifnotroot:re</div>
</li>
<li><a href="/article/1892588276997484544.htm"
title="代码随想录打卡第五十一天" target="_blank">代码随想录打卡第五十一天</a>
<span class="text-muted">zengy5</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E5%88%B7%E9%A2%98%E6%B5%81%E7%A8%8B/1.htm">代码随想录刷题流程</a><a class="tag" taget="_blank" href="/search/%E6%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a>
<div>代码随想录–图论部分day51图论第二天文章目录代码随想录--图论部分一、卡码网99--岛屿数量二、卡码网100--岛屿的最大面积一、卡码网99–岛屿数量代码随想录题目链接：代码随想录给定一个由1（陆地）和0（水）组成的矩阵，你需要计算岛屿的数量。岛屿由水平方向或垂直方向上相邻的陆地连接而成，并且四周都是水域。你可以假设矩阵外均被水包围。没太看懂教程的解法，所以这里是自己的做法正常把图存进来，遍历</div>
</li>
<li><a href="/article/1892500223545110528.htm"
title="图论篇--代码随想录算法训练营第五十七天打卡| 最小生成树问题" target="_blank">图论篇--代码随想录算法训练营第五十七天打卡| 最小生成树问题</a>
<span class="text-muted">無量空所</span>
<a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a><a class="tag" taget="_blank" href="/search/%E5%AD%A6%E4%B9%A0/1.htm">学习</a>
<div>题目链接：53.寻宝（第七期模拟笔试）题目描述：在世界的某个区域，有一些分散的神秘岛屿，每个岛屿上都有一种珍稀的资源或者宝藏。国王打算在这些岛屿上建公路，方便运输。不同岛屿之间，路途距离不同，国王希望你可以规划建公路的方案，如何可以以最短的总公路距离将所有岛屿联通起来（注意：这是一个无向图）。给定一张地图，其中包括了所有的岛屿，以及它们之间的距离。以最小化公路建设长度，确保可以链接到所有岛屿。解题</div>
</li>
<li><a href="/article/1892158556950556672.htm"
title="代码随想录2.18-2.19" target="_blank">代码随想录2.18-2.19</a>
<span class="text-muted">我会非常幸运</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E8%B7%9F%E7%BB%83%E8%AE%B0%E5%BD%95/1.htm">代码随想录跟练记录</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a><a class="tag" taget="_blank" href="/search/%E5%8A%9B%E6%89%A3/1.htm">力扣</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/%E5%BC%80%E5%8F%91%E8%AF%AD%E8%A8%80/1.htm">开发语言</a>
<div>动态规划动态规划题目类型：基础（包括斐波那契类）背包打家劫舍股票子序列动规五部曲：（1）dp数组以及下表的含义（2）递推公式（3）dp数组如何初始化（4）遍历顺序：背包类尤其重要，两层for循环，先遍历背包再遍历物体（5）打印dp数组：看看dp数组是否正确509.斐波那契数70.爬楼梯分析之后发现就是斐波那契数的问题。这道题难点在于递推公式拓展：如果一步可以走m个台阶，如何做爬楼梯拓展就是一步一个</div>
</li>
<li><a href="/article/1892137886246039552.htm"
title="代码随想录day10" target="_blank">代码随想录day10</a>
<span class="text-muted">独正己身</span>
<a class="tag" taget="_blank" href="/search/c%E8%AF%AD%E8%A8%80/1.htm">c语言</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a>
<div>232.用栈实现队列//理解2个栈一个栈弹出后再入另一个栈，再弹出即可实现队列效果。std::stackstack_1;std::stackstack_2;MyQueue(){}voidpush(intx){stack_1.push(x);}intpop(){//必须先把stack_2中清空，再将stack_1中的入栈，这样符合队列的逻辑if(stack_2.empty()){while(!sta</div>
</li>
<li><a href="/article/1892136370722369536.htm"
title="代码随想录Day57" target="_blank">代码随想录Day57</a>
<span class="text-muted">二手木乃伊</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95/1.htm">代码随想录</a><a class="tag" taget="_blank" href="/search/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/1.htm">动态规划</a><a class="tag" taget="_blank" href="/search/java/1.htm">java</a>
<div>Day57今日任务回文子串516.最长回文子序列动态规划总结篇代码实现回文子串classSolution{publicintcountSubstrings(Strings){//dp[i][j]表示[i,j]是否是回文子串intresult=0;boolean[][]dp=newboolean[s.length()][s.length()];char[]chars=s.toCharArray();</div>
</li>
<li><a href="/article/1892136369959006208.htm"
title="代码随想录Day40" target="_blank">代码随想录Day40</a>
<span class="text-muted">二手木乃伊</span>
<a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95/1.htm">代码随想录</a><a class="tag" taget="_blank" href="/search/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/1.htm">动态规划</a>
<div>Day40动态规划part03今日任务整数拆分96.不同的二叉搜索树代码实现整数拆分publicintintegerBreak(intn){int[]dp=newint[n+1];dp[2]=1;for(inti=3;i<n+1;i++){for(intj=1;j<i;j++){dp[i]=Math.max(j*Math.max(i-j,dp[i-j]),dp[i]);}}returndp[n];</div>
</li>
<li><a href="/article/1892131830191157248.htm"
title="代码随想录day12-堆栈的应用" target="_blank">代码随想录day12-堆栈的应用</a>
<span class="text-muted">huifeideapei</span>
<a class="tag" taget="_blank" href="/search/python/1.htm">python</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>有效的括号题目链接题目思路：字符串的匹配优先考虑堆栈这种结构，实际上也是数组，但具有先入后出的结构，但放入相反的元素这种思路值得注意代码实现：classSolution:defisValid(self,s:str)->bool:#字符串的匹配问题优先考虑堆栈，在python中堆栈的底层也是数组结构tempStack=[]foriins:ifi=="(":tempStack.append(")")e</div>
</li>
<li><a href="/article/1892125524025733120.htm"
title="代码随想录day12" target="_blank">代码随想录day12</a>
<span class="text-muted">独正己身</span>
<a class="tag" taget="_blank" href="/search/c%E8%AF%AD%E8%A8%80/1.htm">c语言</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a><a class="tag" taget="_blank" href="/search/c%2B%2B/1.htm">c++</a>
<div>144.二叉树的前序遍历//明确递归的函数，结束边界，单层逻辑voidtraversal(TreeNode*node,vector&list){if(node==nullptr){return;}list.push_back(node->val);traversal(node->left,list);traversal(node->right,list);}vectorpreorderTraver</div>
</li>
<li><a href="/article/1891682652679892992.htm"
title="算法训练Day01 Leetcode704.二分查找" target="_blank">算法训练Day01 Leetcode704.二分查找</a>
<span class="text-muted">weixin_47284299</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E8%AE%AD%E7%BB%83%E8%90%A5/1.htm">代码随想录训练营</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E9%9D%A2%E8%AF%95/1.htm">面试</a><a class="tag" taget="_blank" href="/search/%E8%81%8C%E5%9C%BA%E5%92%8C%E5%8F%91%E5%B1%95/1.htm">职场和发展</a><a class="tag" taget="_blank" href="/search/python/1.htm">python</a>
<div>0.学习资料来源题目链接：力扣https://leetcode.cn/problems/binary-search/文章讲解：代码随想录代码随想录PDF，代码随想录百度网盘，代码随想录知识星球，代码随想录八股文PDF，代码随想录刷题路线，代码随想录知识星球八股文https://programmercarl.com/0704.%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE.</div>
</li>
<li><a href="/article/1891261365000138752.htm"
title="代码随想录算法训练营第一天：二分查找，移除元素，有序数组的平方" target="_blank">代码随想录算法训练营第一天：二分查找，移除元素，有序数组的平方</a>
<span class="text-muted">坚持不懈的猫喵</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>一.数组1.要点：数组下标都是从0开始的。数组内存空间的地址是连续的数组的元素是不能删的，只能覆盖。C++中二维数组在地址空间上是连续的。（java就不是了）二.二分查找二分查找有两种方法1.target在左闭右闭[left,right]while(lefttarget)target偏小，在left与middle的左侧，right要赋值为middle-1，left不用改变，因为当前这个nums[m</div>
</li>
<li><a href="/article/1891242825043996672.htm"
title="代码随想录算法训练营第三天| 反转链表，设计链表，移除链表元素" target="_blank">代码随想录算法训练营第三天| 反转链表，设计链表，移除链表元素</a>
<span class="text-muted">坚持不懈的猫喵</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E9%93%BE%E8%A1%A8/1.htm">链表</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a>
<div>206.反转链表-力扣（LeetCode）structListNode*reverseList(structListNode*head){typedefstructListNodeListNode;ListNode*tmp;ListNode*cur=head;ListNode*pre=NULL;while(cur){tmp=cur->next;cur->next=pre;pre=cur;cur=t</div>
</li>
<li><a href="/article/1891242320649580544.htm"
title="代码随想录算法训练营第六天 | 242.有效的字母异位词、349. 两个数组的交集、202. 快乐数、1. 两数之和" target="_blank">代码随想录算法训练营第六天 | 242.有效的字母异位词、349. 两个数组的交集、202. 快乐数、1. 两数之和</a>
<span class="text-muted">虾饺爱下棋</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a><a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/%E5%93%88%E5%B8%8C%E8%A1%A8/1.htm">哈希表</a>
<div>代码随想录算法训练营第六天|242.有效的字母异位词、349.两个数组的交集、202.快乐数、1.两数之和第五天休息，就没写文章，hh感悟：今天的任务相对轻松一些。242.有效的字母异位词link题目：给定两个字符串s和t，编写一个函数来判断t是否是s的字母异位词。注意：若s和t中每个字符出现的次数都相同，则称s和t互为字母异位词。先是展现暴力求解：比较好理解，大致思路就是先对两个字符串进行排序，</div>
</li>
<li><a href="/article/1891011580003414016.htm"
title="代码随想录算法营Day38 ｜ 62. 不同路径，63. 不同路径 II，343. 整数拆分，96. 不同的二叉搜索树" target="_blank">代码随想录算法营Day38 ｜ 62. 不同路径，63. 不同路径 II，343. 整数拆分，96. 不同的二叉搜索树</a>
<span class="text-muted">寂枫zero</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/python/1.htm">python</a><a class="tag" taget="_blank" href="/search/leetcode/1.htm">leetcode</a>
<div>62.不同路径这题的限制是机器人在mxn的网格的左上角，每次只能向下走一格或者向右走一格。问到右下角有多少条不同路径。这个动态规划的初始状态是第一行和第一列的格子的值都是1，因为机器人只能向右走一格或者向下走一格，所以第一行和第一列的格子的不同路径数只能是1.而其他格子的路径数取决于每个格子的正上方和左边两个格子的路径数之和，即状态转移公式为dp[i][j]=dp[i-1][j]+dp[i][j-</div>
</li>
<li><a href="/article/1890800373220831232.htm"
title="代码随想录 Day 32 |【第八章 贪心算法 part 01】理论基础、455.分发饼干、376. 摆动序列、53. 最大子序和" target="_blank">代码随想录 Day 32 |【第八章 贪心算法 part 01】理论基础、455.分发饼干、376. 摆动序列、53. 最大子序和</a>
<span class="text-muted">Accept17</span>
<a class="tag" taget="_blank" href="/search/%E8%B4%AA%E5%BF%83%E7%AE%97%E6%B3%95/1.htm">贪心算法</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>一、理论基础代码随想录1.什么是贪心贪心的本质是选择每一阶段的局部最优，从而达到全局最优。2.贪心的解题步骤将问题分解为若干个子问题找出适合的贪心策略求解每一个子问题的最优解将局部最优解堆叠成全局最优解二、455.分发饼干代码随想录1.解题思路尽量用最大的饼干去满足胃口大的孩子。2.代码实现（1）因为是用大饼干满足胃口大的孩子，所以对饼干、孩子胃口数组排序。定义一个result变量，用于记录喂饱了</div>
</li>
<li><a href="/article/1890787261994299392.htm"
title="代码随想录--160 相交链表" target="_blank">代码随想录--160 相交链表</a>
<span class="text-muted">Estrella-q</span>
<a class="tag" taget="_blank" href="/search/LeetCode/1.htm">LeetCode</a><a class="tag" taget="_blank" href="/search/%E9%93%BE%E8%A1%A8/1.htm">链表</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a>
<div>160相交链表解法1/***Definitionforsingly-linkedlist.*structListNode{*intval;*structListNode*next;*};*/structListNode*getIntersectionNode(structListNode*headA,structListNode*headB){//初始化两个指针ptrA和ptrB，分别指向链表A和</div>
</li>
<li><a href="/article/124.htm"
title="mysql主从数据同步" target="_blank">mysql主从数据同步</a>
<span class="text-muted">林鹤霄</span>
<a class="tag" taget="_blank" href="/search/mysql%E4%B8%BB%E4%BB%8E%E6%95%B0%E6%8D%AE%E5%90%8C%E6%AD%A5/1.htm">mysql主从数据同步</a>
<div>配置mysql5.5主从服务器(转)
教程开始：一、安装MySQL
说明：在两台MySQL服务器192.168.21.169和192.168.21.168上分别进行如下操作，安装MySQL 5.5.22
二、配置MySQL主服务器（192.168.21.169）mysql -uroot -p &nb</div>
</li>
<li><a href="/article/251.htm"
title="oracle学习笔记" target="_blank">oracle学习笔记</a>
<span class="text-muted">caoyong</span>
<a class="tag" taget="_blank" href="/search/oracle/1.htm">oracle</a>
<div>1、ORACLE的安装
a>、ORACLE的版本
8i,9i : i是internet
10g,11g : grid (网格)
12c : cloud (云计算)
b>、10g不支持win7
&</div>
</li>
<li><a href="/article/378.htm"
title="数据库，SQL零基础入门" target="_blank">数据库，SQL零基础入门</a>
<span class="text-muted">天子之骄</span>
<a class="tag" taget="_blank" href="/search/sql/1.htm">sql</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E5%BA%93%E5%85%A5%E9%97%A8/1.htm">数据库入门</a><a class="tag" taget="_blank" href="/search/%E5%9F%BA%E6%9C%AC%E6%9C%AF%E8%AF%AD/1.htm">基本术语</a>
<div>数据库，SQL零基础入门
做网站肯定离不开数据库，本人之前没怎么具体接触SQL，这几天起早贪黑得各种入门，恶补脑洞。一些具体的知识点，可以让小白不再迷茫的术语，拿来与大家分享。
数据库，永久数据的一个或多个大型结构化集合，通常与更新和查询数据的软件相关</div>
</li>
<li><a href="/article/505.htm"
title="pom.xml" target="_blank">pom.xml</a>
<span class="text-muted">一炮送你回车库</span>
<a class="tag" taget="_blank" href="/search/pom.xml/1.htm">pom.xml</a>
<div>1、一级元素dependencies是可以被子项目继承的
2、一级元素dependencyManagement是定义该项目群里jar包版本号的，通常和一级元素properties一起使用，既然有继承，也肯定有一级元素modules来定义子元素
3、父项目里的一级元素<modules>
<module>lcas-admin-war</module>
<</div>
</li>
<li><a href="/article/632.htm"
title="sql查地区省市县" target="_blank">sql查地区省市县</a>
<span class="text-muted">3213213333332132</span>
<a class="tag" taget="_blank" href="/search/sql/1.htm">sql</a><a class="tag" taget="_blank" href="/search/mysql/1.htm">mysql</a>
<div>
-- db_yhm_city
SELECT * FROM db_yhm_city WHERE class_parent_id = 1 -- 海南 class_id = 9 港、奥、台 class_id = 33、34、35
SELECT * FROM db_yhm_city WHERE class_parent_id =169
SELECT d1.cla</div>
</li>
<li><a href="/article/759.htm"
title="关于监听器那些让人头疼的事" target="_blank">关于监听器那些让人头疼的事</a>
<span class="text-muted">宝剑锋梅花香</span>
<a class="tag" taget="_blank" href="/search/%E7%94%BB%E5%9B%BE%E6%9D%BF/1.htm">画图板</a><a class="tag" taget="_blank" href="/search/%E7%9B%91%E5%90%AC%E5%99%A8/1.htm">监听器</a><a class="tag" taget="_blank" href="/search/%E9%BC%A0%E6%A0%87%E7%9B%91%E5%90%AC%E5%99%A8/1.htm">鼠标监听器</a>
<div> 本人初学JAVA，对于界面开发我只能说有点蛋疼，用JAVA来做界面的话确实需要一定的耐心（不使用插件，就算使用插件的话也没好多少）既然Java提供了界面开发，老师又要求做，只能硬着头皮上啦。但是监听器还真是个难懂的地方，我是上了几次课才略微搞懂了些。
</div>
</li>
<li><a href="/article/886.htm"
title="JAVA的遍历MAP" target="_blank">JAVA的遍历MAP</a>
<span class="text-muted">darkranger</span>
<a class="tag" taget="_blank" href="/search/map/1.htm">map</a>
<div>Java Map遍历方式的选择
1. 阐述
对于Java中Map的遍历方式，很多文章都推荐使用entrySet，认为其比keySet的效率高很多。理由是：entrySet方法一次拿到所有key和value的集合；而keySet拿到的只是key的集合，针对每个key，都要去Map中额外查找一次value，从而降低了总体效率。那么实际情况如何呢？
为了解遍历性能的真实差距，包括在遍历ke</div>
</li>
<li><a href="/article/1013.htm"
title="POJ 2312 Battle City 优先多列+bfs" target="_blank">POJ 2312 Battle City 优先多列+bfs</a>
<span class="text-muted">aijuans</span>
<a class="tag" taget="_blank" href="/search/%E6%90%9C%E7%B4%A2/1.htm">搜索</a>
<div>来源：http://poj.org/problem?id=2312
题意：题目背景就是小时候玩的坦克大战，求从起点到终点最少需要多少步。已知S和R是不能走得，E是空的，可以走，B是砖，只有打掉后才可以通过。
思路：很容易看出来这是一道广搜的题目，但是因为走E和走B所需要的时间不一样，因此不能用普通的队列存点。因为对于走B来说，要先打掉砖才能通过，所以我们可以理解为走B需要两步，而走E是指需要1</div>
</li>
<li><a href="/article/1140.htm"
title="Hibernate与Jpa的关系，终于弄懂" target="_blank">Hibernate与Jpa的关系，终于弄懂</a>
<span class="text-muted">avords</span>
<a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/Hibernate/1.htm">Hibernate</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E5%BA%93/1.htm">数据库</a><a class="tag" taget="_blank" href="/search/jpa/1.htm">jpa</a>
<div>我知道Jpa是一种规范，而Hibernate是它的一种实现。除了Hibernate，还有EclipseLink(曾经的toplink)，OpenJPA等可供选择，所以使用Jpa的一个好处是，可以更换实现而不必改动太多代码。
在play中定义Model时，使用的是jpa的annotations，比如javax.persistence.Entity, Table, Column, OneToMany</div>
</li>
<li><a href="/article/1267.htm"
title="酸爽的console.log" target="_blank">酸爽的console.log</a>
<span class="text-muted">bee1314</span>
<a class="tag" taget="_blank" href="/search/console/1.htm">console</a>
<div>在前端的开发中，console.log那是开发必备啊，简直直观。通过写小函数，组合大功能。更容易测试。但是在打版本时，就要删除console.log，打完版本进入开发状态又要添加，真不够爽。重复劳动太多。所以可以做些简单地封装，方便开发和上线。
/**
* log.js hufeng
* The safe wrapper for `console.xxx` functions
* </div>
</li>
<li><a href="/article/1394.htm"
title="哈佛教授：穷人和过于忙碌的人有一个共同思维特质" target="_blank">哈佛教授：穷人和过于忙碌的人有一个共同思维特质</a>
<span class="text-muted">bijian1013</span>
<a class="tag" taget="_blank" href="/search/%E6%97%B6%E9%97%B4%E7%AE%A1%E7%90%86/1.htm">时间管理</a><a class="tag" taget="_blank" href="/search/%E5%8A%B1%E5%BF%97%E4%BA%BA%E7%94%9F/1.htm">励志人生</a><a class="tag" taget="_blank" href="/search/%E7%A9%B7%E4%BA%BA/1.htm">穷人</a><a class="tag" taget="_blank" href="/search/%E8%BF%87%E4%BA%8E%E5%BF%99%E7%A2%8C/1.htm">过于忙碌</a>
<div> 一个跨学科团队今年完成了一项对资源稀缺状况下人的思维方式的研究，结论是：穷人和过于忙碌的人有一个共同思维特质，即注意力被稀缺资源过分占据，引起认知和判断力的全面下降。这项研究是心理学、行为经济学和政策研究学者协作的典范。
这个研究源于穆来纳森对自己拖延症的憎恨。他7岁从印度移民美国，很快就如鱼得水，哈佛毕业</div>
</li>
<li><a href="/article/1521.htm"
title="other operate" target="_blank">other operate</a>
<span class="text-muted">征客丶</span>
<a class="tag" taget="_blank" href="/search/OS/1.htm">OS</a><a class="tag" taget="_blank" href="/search/osx/1.htm">osx</a>
<div>一、Mac Finder 设置排序方式，预览栏 在显示－》查看显示选项中
二、有时预览显示时，卡死在那，有可能是一些临时文件夹被删除了，如：/private/tmp[有待验证]
--------------------------------------------------------------------
若有其他凝问或文中有错误，请及时向我指出，
我好及时改正，同时也让我们一</div>
</li>
<li><a href="/article/1648.htm"
title="【Scala五】分析Spark源代码总结的Scala语法三" target="_blank">【Scala五】分析Spark源代码总结的Scala语法三</a>
<span class="text-muted">bit1129</span>
<a class="tag" taget="_blank" href="/search/scala/1.htm">scala</a>
<div>1. If语句作为表达式
val properties = if (jobIdToActiveJob.contains(jobId)) {
jobIdToActiveJob(stage.jobId).properties
} else {
// this stage will be assigned to "default" po</div>
</li>
<li><a href="/article/1775.htm"
title="ZooKeeper 入门" target="_blank">ZooKeeper 入门</a>
<span class="text-muted">BlueSkator</span>
<a class="tag" taget="_blank" href="/search/%E4%B8%AD%E9%97%B4%E4%BB%B6/1.htm">中间件</a><a class="tag" taget="_blank" href="/search/zk/1.htm">zk</a>
<div>ZooKeeper是一个高可用的分布式数据管理与系统协调框架。基于对Paxos算法的实现，使该框架保证了分布式环境中数据的强一致性，也正是基于这样的特性，使得ZooKeeper解决很多分布式问题。网上对ZK的应用场景也有不少介绍，本文将结合作者身边的项目例子，系统地对ZK的应用场景进行一个分门归类的介绍。
值得注意的是，ZK并非天生就是为这些应用场景设计的，都是后来众多开发者根据其框架的特性，利</div>
</li>
<li><a href="/article/1902.htm"
title="MySQL取得当前时间的函数是什么 格式化日期的函数是什么" target="_blank">MySQL取得当前时间的函数是什么 格式化日期的函数是什么</a>
<span class="text-muted">BreakingBad</span>
<a class="tag" taget="_blank" href="/search/mysql/1.htm">mysql</a><a class="tag" taget="_blank" href="/search/Date/1.htm">Date</a>
<div>取得当前时间用 now() 就行。
在数据库中格式化时间 用DATE_FORMA T(date, format) .
根据格式串format 格式化日期或日期和时间值date，返回结果串。
可用DATE_FORMAT( ) 来格式化DATE 或DATETIME 值，以便得到所希望的格式。根据format字符串格式化date值:
%S, %s 两位数字形式的秒（ 00,01,</div>
</li>
<li><a href="/article/2029.htm"
title="读《研磨设计模式》-代码笔记-组合模式" target="_blank">读《研磨设计模式》-代码笔记-组合模式</a>
<span class="text-muted">bylijinnan</span>
<a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/%E8%AE%BE%E8%AE%A1%E6%A8%A1%E5%BC%8F/1.htm">设计模式</a>
<div>声明： 本文只为方便我个人查阅和理解，详细的分析以及源代码请移步 原作者的博客http://chjavach.iteye.com/
import java.util.ArrayList;
import java.util.List;
abstract class Component {
public abstract void printStruct(Str</div>
</li>
<li><a href="/article/2156.htm"
title="4_JAVA+Oracle面试题(有答案)" target="_blank">4_JAVA+Oracle面试题(有答案)</a>
<span class="text-muted">chenke</span>
<a class="tag" taget="_blank" href="/search/oracle/1.htm">oracle</a>
<div>基础测试题
卷面上不能出现任何的涂写文字，所有的答案要求写在答题纸上，考卷不得带走。
选择题
1、 What will happen when you attempt to compile and run the following code? （3）
public class Static {
static {
int x = 5; // 在static内有效
}
st</div>
</li>
<li><a href="/article/2283.htm"
title="新一代工作流系统设计目标" target="_blank">新一代工作流系统设计目标</a>
<span class="text-muted">comsci</span>
<a class="tag" taget="_blank" href="/search/%E5%B7%A5%E4%BD%9C/1.htm">工作</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/%E8%84%9A%E6%9C%AC/1.htm">脚本</a>
<div>
用户只需要给工作流系统制定若干个需求，流程系统根据需求，并结合事先输入的组织机构和权限结构，调用若干算法，在流程展示版面上面显示出系统自动生成的流程图，然后由用户根据实际情况对该流程图进行微调，直到满意为止，流程在运行过程中，系统和用户可以根据情况对流程进行实时的调整，包括拓扑结构的调整，权限的调整，内置脚本的调整。。。。。
在这个设计中，最难的地方是系统根据什么来生成流</div>
</li>
<li><a href="/article/2410.htm"
title="oracle 行链接与行迁移" target="_blank">oracle 行链接与行迁移</a>
<span class="text-muted">daizj</span>
<a class="tag" taget="_blank" href="/search/oracle/1.htm">oracle</a><a class="tag" taget="_blank" href="/search/%E8%A1%8C%E8%BF%81%E7%A7%BB/1.htm">行迁移</a>
<div>表里的一行对于一个数据块太大的情况有二种(一行在一个数据块里放不下)
第一种情况:
INSERT的时候，INSERT时候行的大小就超一个块的大小。Oracle把这行的数据存储在一连串的数据块里(Oracle Stores the data for the row in a chain of data blocks)，这种情况称为行链接(Row Chain)，一般不可避免(除非使用更大的数据</div>
</li>
<li><a href="/article/2537.htm"
title="[JShop]开源电子商务系统jshop的系统缓存实现" target="_blank">[JShop]开源电子商务系统jshop的系统缓存实现</a>
<span class="text-muted">dinguangx</span>
<a class="tag" taget="_blank" href="/search/jshop/1.htm">jshop</a><a class="tag" taget="_blank" href="/search/%E7%94%B5%E5%AD%90%E5%95%86%E5%8A%A1/1.htm">电子商务</a>
<div>前言
jeeshop中通过SystemManager管理了大量的缓存数据，来提升系统的性能，但这些缓存数据全部都是存放于内存中的，无法满足特定场景的数据更新（如集群环境）。JShop对jeeshop的缓存机制进行了扩展，提供CacheProvider来辅助SystemManager管理这些缓存数据，通过CacheProvider,可以把缓存存放在内存,ehcache,redis，memcache</div>
</li>
<li><a href="/article/2664.htm"
title="初三全学年难记忆单词" target="_blank">初三全学年难记忆单词</a>
<span class="text-muted">dcj3sjt126com</span>
<a class="tag" taget="_blank" href="/search/english/1.htm">english</a><a class="tag" taget="_blank" href="/search/word/1.htm">word</a>
<div>several 儿子；若干
shelf 架子
knowledge 知识；学问
librarian 图书管理员
abroad 到国外，在国外
surf 冲浪
wave 浪；波浪
twice 两次；两倍
describe 描写；叙述
especially 特别；尤其
attract 吸引
prize 奖品；奖赏
competition 比赛；竞争
event 大事；事件
O</div>
</li>
<li><a href="/article/2791.htm"
title="sphinx实践" target="_blank">sphinx实践</a>
<span class="text-muted">dcj3sjt126com</span>
<a class="tag" taget="_blank" href="/search/sphinx/1.htm">sphinx</a>
<div>
安装参考地址:http://briansnelson.com/How_to_install_Sphinx_on_Centos_Server
yum install sphinx
如果失败的话使用下面的方式安装
wget http://sphinxsearch.com/files/sphinx-2.2.9-1.rhel6.x86_64.rpm
yum loca</div>
</li>
<li><a href="/article/2918.htm"
title="JPA之JPQL（三）" target="_blank">JPA之JPQL（三）</a>
<span class="text-muted">frank1234</span>
<a class="tag" taget="_blank" href="/search/orm/1.htm">orm</a><a class="tag" taget="_blank" href="/search/jpa/1.htm">jpa</a><a class="tag" taget="_blank" href="/search/JPQL/1.htm">JPQL</a>
<div>1 什么是JPQL
JPQL是Java Persistence Query Language的简称，可以看成是JPA中的HQL， JPQL支持各种复杂查询。
2 检索单个对象
@Test
public void querySingleObject1() {
Query query = em.createQuery("sele</div>
</li>
<li><a href="/article/3045.htm"
title="Remove Duplicates from Sorted Array II" target="_blank">Remove Duplicates from Sorted Array II</a>
<span class="text-muted">hcx2013</span>
<a class="tag" taget="_blank" href="/search/remove/1.htm">remove</a>
<div>Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?
For example,Given sorted array nums = [1,1,1,2,2,3],
Your function should return length </div>
</li>
<li><a href="/article/3172.htm"
title="Spring4新特性——Groovy Bean定义DSL" target="_blank">Spring4新特性——Groovy Bean定义DSL</a>
<span class="text-muted">jinnianshilongnian</span>
<a class="tag" taget="_blank" href="/search/spring+4/1.htm">spring 4</a>
<div>Spring4新特性——泛型限定式依赖注入
Spring4新特性——核心容器的其他改进
Spring4新特性——Web开发的增强
Spring4新特性——集成Bean Validation 1.1(JSR-349)到SpringMVC
Spring4新特性——Groovy Bean定义DSL
Spring4新特性——更好的Java泛型操作API
Spring4新</div>
</li>
<li><a href="/article/3299.htm"
title="CentOS安装Mysql5.5" target="_blank">CentOS安装Mysql5.5</a>
<span class="text-muted">liuxingguome</span>
<a class="tag" taget="_blank" href="/search/centos/1.htm">centos</a>
<div>CentOS下以RPM方式安装MySQL5.5
首先卸载系统自带Mysql：
yum remove mysql mysql-server mysql-libs compat-mysql51
rm -rf /var/lib/mysql
rm /etc/my.cnf
查看是否还有mysql软件：
rpm -qa|grep mysql
去http://dev.mysql.c</div>
</li>
<li><a href="/article/3426.htm"
title="第14章 工具函数（下）" target="_blank">第14章 工具函数（下）</a>
<span class="text-muted">onestopweb</span>
<a class="tag" taget="_blank" href="/search/%E5%87%BD%E6%95%B0/1.htm">函数</a>
<div>index.html
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/</div>
</li>
<li><a href="/article/3553.htm"
title="POJ 1050" target="_blank">POJ 1050</a>
<span class="text-muted">SaraWon</span>
<a class="tag" taget="_blank" href="/search/%E4%BA%8C%E7%BB%B4%E6%95%B0%E7%BB%84/1.htm">二维数组</a><a class="tag" taget="_blank" href="/search/%E5%AD%90%E7%9F%A9%E9%98%B5/1.htm">子矩阵</a><a class="tag" taget="_blank" href="/search/%E6%9C%80%E5%A4%A7%E5%92%8C/1.htm">最大和</a>
<div>POJ ACM第1050题的详细描述，请参照
http://acm.pku.edu.cn/JudgeOnline/problem?id=1050
题目意思：
给定包含有正负整型的二维数组，找出所有子矩阵的和的最大值。
如二维数组
0 -2 -7 0
9 2 -6 2
-4 1 -4 1
-1 8 0 -2
中和最大的子矩阵是
9 2
-4 1
-1 8
且最大和是15</div>
</li>
<li><a href="/article/3680.htm"
title="[5]设计模式——单例模式" target="_blank">[5]设计模式——单例模式</a>
<span class="text-muted">tsface</span>
<a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/%E5%8D%95%E4%BE%8B/1.htm">单例</a><a class="tag" taget="_blank" href="/search/%E8%AE%BE%E8%AE%A1%E6%A8%A1%E5%BC%8F/1.htm">设计模式</a><a class="tag" taget="_blank" href="/search/%E8%99%9A%E6%8B%9F%E6%9C%BA/1.htm">虚拟机</a>
<div>单例模式：保证一个类仅有一个实例，并提供一个访问它的全局访问点
安全的单例模式：
/*
* @(#)Singleton.java 2014-8-1
*
* Copyright 2014 XXXX, Inc. All rights reserved.
*/
package com.fiberhome.singleton;
</div>
</li>
<li><a href="/article/3807.htm"
title="Java8全新打造，英语学习supertool" target="_blank">Java8全新打造，英语学习supertool</a>
<span class="text-muted">yangshangchuan</span>
<a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/superword/1.htm">superword</a><a class="tag" taget="_blank" href="/search/%E9%97%AD%E5%8C%85/1.htm">闭包</a><a class="tag" taget="_blank" href="/search/java8/1.htm">java8</a><a class="tag" taget="_blank" href="/search/%E5%87%BD%E6%95%B0%E5%BC%8F%E7%BC%96%E7%A8%8B/1.htm">函数式编程</a>
<div>superword是一个Java实现的英文单词分析软件，主要研究英语单词音近形似转化规律、前缀后缀规律、词之间的相似性规律等等。Clean code、Fluent style、Java8 feature: Lambdas, Streams and Functional-style Programming。
升学考试、工作求职、充电提高，都少不了英语的身影，英语对我们来说实在太重要</div>
</li>
</ul>
</div>
</div>
</div>
<div>
<div class="container">
<div class="indexes">
<strong>按字母分类：</strong>
<a href="/tags/A/1.htm" target="_blank">A</a><a href="/tags/B/1.htm" target="_blank">B</a><a href="/tags/C/1.htm" target="_blank">C</a><a
href="/tags/D/1.htm" target="_blank">D</a><a href="/tags/E/1.htm" target="_blank">E</a><a href="/tags/F/1.htm" target="_blank">F</a><a
href="/tags/G/1.htm" target="_blank">G</a><a href="/tags/H/1.htm" target="_blank">H</a><a href="/tags/I/1.htm" target="_blank">I</a><a
href="/tags/J/1.htm" target="_blank">J</a><a href="/tags/K/1.htm" target="_blank">K</a><a href="/tags/L/1.htm" target="_blank">L</a><a
href="/tags/M/1.htm" target="_blank">M</a><a href="/tags/N/1.htm" target="_blank">N</a><a href="/tags/O/1.htm" target="_blank">O</a><a
href="/tags/P/1.htm" target="_blank">P</a><a href="/tags/Q/1.htm" target="_blank">Q</a><a href="/tags/R/1.htm" target="_blank">R</a><a
href="/tags/S/1.htm" target="_blank">S</a><a href="/tags/T/1.htm" target="_blank">T</a><a href="/tags/U/1.htm" target="_blank">U</a><a
href="/tags/V/1.htm" target="_blank">V</a><a href="/tags/W/1.htm" target="_blank">W</a><a href="/tags/X/1.htm" target="_blank">X</a><a
href="/tags/Y/1.htm" target="_blank">Y</a><a href="/tags/Z/1.htm" target="_blank">Z</a><a href="/tags/0/1.htm" target="_blank">其他</a>
</div>
</div>
</div>
<footer id="footer" class="mb30 mt30">
<div class="container">
<div class="footBglm">
<a target="_blank" href="/">首页</a> -
<a target="_blank" href="/custom/about.htm">关于我们</a> -
<a target="_blank" href="/search/Java/1.htm">站内搜索</a> -
<a target="_blank" href="/sitemap.txt">Sitemap</a> -
<a target="_blank" href="/custom/delete.htm">侵权投诉</a>
</div>
<div class="copyright">版权所有 IT知识库 CopyRight © 2000-2050 E-COM-NET.COM , All Rights Reserved.
<!-- <a href="https://beian.miit.gov.cn/" rel="nofollow" target="_blank">京ICP备09083238号</a><br>-->
</div>
</div>
</footer>
<!-- 代码高亮 -->
<script type="text/javascript" src="/static/syntaxhighlighter/scripts/shCore.js"></script>
<script type="text/javascript" src="/static/syntaxhighlighter/scripts/shLegacy.js"></script>
<script type="text/javascript" src="/static/syntaxhighlighter/scripts/shAutoloader.js"></script>
<link type="text/css" rel="stylesheet" href="/static/syntaxhighlighter/styles/shCoreDefault.css"/>
<script type="text/javascript" src="/static/syntaxhighlighter/src/my_start_1.js"></script>
</body>
</html>