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/1942605834022350848.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>递归遍历二叉树的前，中，后序遍历题目链接前序遍历中序遍历后序遍历前序遍历题解classSolution{publicListpreorderTraversal(TreeNoderoot){Listlist=newArrayListlist,TreeNoderoot){if(root==null){return;}list.add(root.val);preorder(list,root.left)</div>
</li>
<li><a href="/article/1942054752464465920.htm"
title="将有序数组转化为二叉树" target="_blank">将有序数组转化为二叉树</a>
<span class="text-muted"></span>
<div>本文参考代码随想录将一个按照升序排列的有序数组，转换为一棵高度平衡二叉搜索树。思路：寻找分割点，分割点作为当前节点，然后递归左区间和右区间。递归法取中间值为root，递归左区间成为root的左孩子，右区间成为root的右孩子，最后返回rootclassSolution{private:TreeNode*traversal(vector&nums,intleft,intright){//若数组为空则</div>
</li>
<li><a href="/article/1941871214821699584.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>LeetCode.150逆波兰表达式求值题目链接逆波兰表达式求值题解classSolution{publicintevalRPN(String[]tokens){Stackcstack=newStackset=newHashSetdeque=newLinkedListdeque.getLast()){deque.removeLast();}deque.add(val);}intpeek(){ret</div>
</li>
<li><a href="/article/1941614182025719808.htm"
title="[代码随想录算法训练营 Day09 字符串 Part2]" target="_blank">[代码随想录算法训练营 Day09 字符串 Part2]</a>
<span class="text-muted">yancyss</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/%E5%BC%80%E5%8F%91%E8%AF%AD%E8%A8%80/1.htm">开发语言</a>
<div>Day09文章目录Day09字符串6.实现strStr（力扣28）7.重复的子字符串（力扣459）字符串今天两道KMP：KMP功能，在一个字符串中找到是否出现另一个字符串本篇会再更新~6.实现strStr（力扣28）题目描述：找出字符串中第一个匹配项的下标heystack干草堆，needle针，大海捞针~思路：KMP算法B站一个讲的很好的视频整体思路：假设有主串n和模式串m，在暴力算法当中，每当主</div>
</li>
<li><a href="/article/1941440469380689920.htm"
title="代码随想录算法训练营第二十一天|回溯算法理论基础，77. 组合" target="_blank">代码随想录算法训练营第二十一天|回溯算法理论基础，77. 组合</a>
<span class="text-muted">丁希希哇</span>
<a class="tag" taget="_blank" href="/search/%E5%8A%9B%E6%89%A3%E7%AE%97%E6%B3%95%E5%88%B7%E9%A2%98/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/python/1.htm">python</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%89%AA%E6%9E%9D/1.htm">剪枝</a>
<div>系列文章目录代码随想录算法训练营第一天|数组理论基础，704.二分查找，27.移除元素代码随想录算法训练营第二天|977.有序数组的平方，209.长度最小的子数组，59.螺旋矩阵II代码随想录算法训练营第三天|链表理论基础，203.移除链表元素，707.设计链表，206.反转链表代码随想录算法训练营第四天|24.两两交换链表中的节点，19.删除链表的倒数第N个节点，面试题02.07.链表相交，14</div>
</li>
<li><a href="/article/1941435175489564672.htm"
title="【回溯算法】|代码随想录算法训练营第19天|77. 组合、216.组合总和III、17.电话号码的字母组合" target="_blank">【回溯算法】|代码随想录算法训练营第19天|77. 组合、216.组合总和III、17.电话号码的字母组合</a>
<span class="text-muted">小白糖的狗狗叫鸡蛋</span>
<a class="tag" taget="_blank" href="/search/15-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/1.htm">15-数据结构与算法</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/redis/1.htm">redis</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E5%BA%93/1.htm">数据库</a>
<div>刷题神器代码随想录往期回顾>【二叉树】|代码随想录算法训练营第18天|669.修剪二叉搜索树、108.将有序数组转换为二叉搜索树、538.把二叉搜索树转换为累加树、【总结】题目理论基础文章：文章讲解视频：视频讲解回溯算法并不是一个高效算法，它的目的是穷举，替代多层for循环，回溯算法和递归算法相关纠缠，在递归的前后要进行回溯,回溯算法可以理解为树型结构，树的宽度就是for循环的范围，树的深度就是递</div>
</li>
<li><a href="/article/1941356757406248960.htm"
title="代码随想录算法训练营第34天 | 第九章动态规划 part07" target="_blank">代码随想录算法训练营第34天 | 第九章动态规划 part07</a>
<span class="text-muted">tt555555555555</span>
<a class="tag" taget="_blank" href="/search/C%2B%2B%E5%AD%A6%E4%B9%A0/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/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/1.htm">动态规划</a>
<div>文章目录第九章动态规划Part07198.打家劫舍213.打家劫舍II337.打家劫舍III第九章动态规划Part07今天是打家劫舍的一天，这个系列题目不算难，大家可以一口气拿下。198.打家劫舍视频讲解：https://www.bilibili.com/video/BV1Te411N7SX题解链接：https://programmercarl.com/0198.%E6%89%93%E5%AE%B</div>
</li>
<li><a href="/article/1941356126209634304.htm"
title="代码随想录算法训练营第四十三天|动态规划part10" target="_blank">代码随想录算法训练营第四十三天|动态规划part10</a>
<span class="text-muted">xindafu</span>
<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/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>300.最长递增子序列题目链接：代码随想录文章讲解：代码随想录错误解答：dp[i]表示前i个元素的最长递增子序列的长度classSolution{public:intlengthOfLIS(vector&nums){vectordp(nums.size(),0);dp[0]=1;intlastnum=nums[0];for(inti=1;ilastnum){lastnum=nums[i];dp[i</div>
</li>
<li><a href="/article/1941356126725533696.htm"
title="代码随想录算法训练营第四十四天|动态规划part11" target="_blank">代码随想录算法训练营第四十四天|动态规划part11</a>
<span class="text-muted"></span>
<div>1143.最长公共子序列题目链接：1143.最长公共子序列-力扣（LeetCode）文章讲解:代码随想录思路：其实就是求两个字符串的最长公共子序列的长度与公共子数组的区别是可以不连续，顺序对就可以状态转移方程不一样定义dp[i][j]表示text1的0到i-1与text2的0到j-1的最长公共子序列的长度text1[i-1]==text2[j-1]dp[i][j]=dp[i-1][j-1]+1否则</div>
</li>
<li><a href="/article/1941356127220461568.htm"
title="代码随想录算法训练营第四十五天|动态规划part12" target="_blank">代码随想录算法训练营第四十五天|动态规划part12</a>
<span class="text-muted">xindafu</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%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>115.不同的子序列题目链接：115.不同的子序列-力扣（LeetCode）文章讲解：代码随想录定义dp[i][j]表示s0-i-1与t0-j-1不同的子序列的个数以s=batgtgt=bag为例子s【4】！=t【3】所以dp[5][4]=dp[4][4]也就是不考虑s[4]继续往后s[5]==t[3]也就是s[5]跟t【3】配对上了batgt与bag配对的个数加上batgt与ba配对的个数dp[</div>
</li>
<li><a href="/article/1941355999432601600.htm"
title="代码随想录算法训练营第二十九天|贪心算法part3" target="_blank">代码随想录算法训练营第二十九天|贪心算法part3</a>
<span class="text-muted">xindafu</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>134.加油站题目链接：134.加油站-力扣（LeetCode）文章讲解：代码随想录classSolution{public:intcanCompleteCircuit(vector&gas,vector&cost){vectordiff;for(inti=0;i=0){startindex=i;}sum+=diff[i];if(sum&ratings){intsize=ratings.size(</div>
</li>
<li><a href="/article/1941355999868809216.htm"
title="代码随想录算法训练营第三十七天|动态规划part4" target="_blank">代码随想录算法训练营第三十七天|动态规划part4</a>
<span class="text-muted"></span>
<div>1049.最后一块石头的重量II题目链接：1049.最后一块石头的重量II-力扣（LeetCode）文章讲解：代码随想录思路：理解为把石头分成两堆使得两堆的差值尽可能小求这个最小值1理解为往背包里装物品每个物品的重量为石头的重量价值也为石头的价值dp[i][j]表示从0-i块石头往容量为j的包里装的最大价值状态转移：dp[i][j]=max(dp[i-1][j],dp[i-1][j-cost[i]</div>
</li>
<li><a href="/article/1941355998967033856.htm"
title="代码随想录算法训练营第二十八天|贪心算法part2" target="_blank">代码随想录算法训练营第二十八天|贪心算法part2</a>
<span class="text-muted">xindafu</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>122.买卖股票的最佳时机II题目链接：122.买卖股票的最佳时机II-力扣（LeetCode）文章讲解：代码随想录思路：这道题的思路很巧妙最终利润是可以分解的假如第0天买入，第3天卖出，那么利润为：prices[3]-prices[0]。相当于(prices[3]-prices[2])+(prices[2]-prices[1])+(prices[1]-prices[0])。此时就是把利润分解为每</div>
</li>
<li><a href="/article/1941352088374145024.htm"
title="代码随想录算法训练营第四十六天 | 动态规划 part13" target="_blank">代码随想录算法训练营第四十六天 | 动态规划 part13</a>
<span class="text-muted">sagen aller</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%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>647.回文子串classSolution{public:intcountSubstrings(strings){vector>dp(s.size(),vector(s.size(),false));intresult=0;for(inti=s.size()-1;i>=0;i--){for(intj=i;j=j-1){dp[i][j]=true;result++;}elseif(dp[i+1][j</div>
</li>
<li><a href="/article/1941347420768104448.htm"
title="代码随想录算法训练营第四十六天|动态规划part13" target="_blank">代码随想录算法训练营第四十六天|动态规划part13</a>
<span class="text-muted">xindafu</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%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>647.回文子串题目链接：647.回文子串-力扣（LeetCode）文章讲解：代码随想录思路：以dp【i】表示以s【i】结尾的回文子串的个数，发现递推公式推导不出来此路·不通以dp【i】【j】表示s【i】到s【j】的回文子串的个数，递推公式也推不出正确dp【i】【j】表示s【i】到s【j】是否为回文串确定递归顺序：dp【i】【j】依赖于dp【i+1】【j-1】因此i从后往前遍历，j从前往后遍历则最</div>
</li>
<li><a href="/article/1940944514097147904.htm"
title="代码随想录算法训练营第二十二天|LeetCode 77 组合，LeetCode 216 组合总和 III，LeetCode 450 删除二叉搜索树中的节点" target="_blank">代码随想录算法训练营第二十二天|LeetCode 77 组合，LeetCode 216 组合总和 III，LeetCode 450 删除二叉搜索树中的节点</a>
<span class="text-muted">二师兄呀1001</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%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/leetcode/1.htm">leetcode</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>
<div>1.LeetCode77组合题目链接：77.组合classSolution:defcombine(self,n:int,k:int)->List[List[int]]:defbacktracking(n,k,startIndex,path,result):iflen(path)==k:result.append(path[:])returnforiinrange(startIndex,n-(k-l</div>
</li>
<li><a href="/article/1939714910086819840.htm"
title="图论基础知识 深度优先（Depth First Search, 简称DFS），广度优先（Breathe First Search, 简称BFS）" target="_blank">图论基础知识 深度优先（Depth First Search, 简称DFS），广度优先（Breathe First Search, 简称BFS）</a>
<span class="text-muted">mmaerd</span>
<a class="tag" taget="_blank" href="/search/Leetcode%E5%88%B7%E9%A2%98%E5%AD%A6%E4%B9%A0%E8%AE%B0%E5%BD%95/1.htm">Leetcode刷题学习记录</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/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E5%AE%BD%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">宽度优先</a><a class="tag" taget="_blank" href="/search/%E6%9C%BA%E8%80%83/1.htm">机考</a>
<div>图论基础知识学习记录自代码随想录dfs与bfs区别dfs是沿着一个方向去搜，不到黄河不回头，直到搜不下去了，再换方向（换方向的过程就涉及到了回溯）。bfs是先把本节点所连接的所有节点遍历一遍，走到下一个节点的时候，再把连接节点的所有节点遍历一遍，搜索方向更像是广度，四面八方的搜索过程。深度优先搜索理论（DepthFirstSearch,简称DFS）搜索方向，是认准一个方向搜，直到碰壁之后再换方向换</div>
</li>
<li><a href="/article/1939711379166523392.htm"
title="代码随想录|图论|07岛屿的最大面积" target="_blank">代码随想录|图论|07岛屿的最大面积</a>
<span class="text-muted">Paper Clouds</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%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/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>
<div>leetcode:100.岛屿的最大面积题目题目描述给定一个由1（陆地）和0（水）组成的矩阵，计算岛屿的最大面积。岛屿面积的计算方式为组成岛屿的陆地的总数。岛屿由水平方向或垂直方向上相邻的陆地连接而成，并且四周都是水域。你可以假设矩阵外均被水包围。输入描述第一行包含两个整数N,M，表示矩阵的行数和列数。后续N行，每行包含M个数字，数字为1或者0，表示岛屿的单元格。输出描述输出一个整数，表示岛屿的最</div>
</li>
<li><a href="/article/1939710109802360832.htm"
title="代码随想录： 图论| 岛屿数量" target="_blank">代码随想录： 图论| 岛屿数量</a>
<span class="text-muted">王鹏程_</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><a class="tag" taget="_blank" href="/search/%E5%B2%9B%E5%B1%BF%E6%95%B0%E9%87%8F/1.htm">岛屿数量</a><a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a>
<div>题目链接：99.岛屿数量题目描述：给定一个由1（陆地）和0（水）组成的矩阵，你需要计算岛屿的数量。岛屿由水平方向或垂直方向上相邻的陆地连接而成，并且四周都是水域。你可以假设矩阵外均被水包围。输入描述：第一行包含两个整数N,M，表示矩阵的行数和列数。后续N行，每行包含M个数字，数字为1或者0。输出描述：输出一个整数，表示岛屿的数量。如果不存在岛屿，则输出0。输入示例：4511000110000010</div>
</li>
<li><a href="/article/1938869446164672512.htm"
title="代码随想录算法训练营第52天 | 101.孤岛的总面积 、102.沉没孤岛、103.水流问题、104.建造最大岛屿" target="_blank">代码随想录算法训练营第52天 | 101.孤岛的总面积 、102.沉没孤岛、103.水流问题、104.建造最大岛屿</a>
<span class="text-muted">Amor_Fati_Yu</span>
<a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a><a class="tag" taget="_blank" href="/search/java/1.htm">java</a><a class="tag" taget="_blank" href="/search/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a>
<div>101.孤岛的总面积importjava.util.*;publicclassMain{privatestaticintcount=0;privatestaticfinalint[][]dir={{0,1},{1,0},{-1,0},{0,-1}};//四个方向privatestaticvoidbfs(int[][]grid,intx,inty){Queueque=newLinkedList=gr</div>
</li>
<li><a href="/article/1938867932012539904.htm"
title="代码随想录算法训练营第52天| 101. 孤岛的总面积、102. 沉没孤岛、103. 水流问题、104.建造最大岛屿" target="_blank">代码随想录算法训练营第52天| 101. 孤岛的总面积、102. 沉没孤岛、103. 水流问题、104.建造最大岛屿</a>
<span class="text-muted">扛过今天777</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%B7%B1%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">深度优先</a>
<div>101.孤岛的总面积卡码题目链接：101.孤岛的总面积学习链接：代码随想录题解：法一：count=0defdfs(grid,x,y):globalcountgrid[x][y]=0count+=1directions=[[1,0],[0,1],[-1,0],[0,-1]]fori,jindirections:next_x=x+inext_y=y+jifnext_x=len(grid)ornext_</div>
</li>
<li><a href="/article/1938637513606361088.htm"
title="代码随想录算法训练营第一天|704.二分查找、35.搜索插入位置、34.在排序数组中查找元素的第一个和最后一个位置、27.移除元素、977.有序数组的平方" target="_blank">代码随想录算法训练营第一天|704.二分查找、35.搜索插入位置、34.在排序数组中查找元素的第一个和最后一个位置、27.移除元素、977.有序数组的平方</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/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84/1.htm">数据结构</a>
<div>LeetCode704二分查找题目链接二分查找左闭右闭写法classSolution{publicintsearch(int[]nums,inttarget){intleft=0,right=nums.length-1;if(targetnums[right]){return-1;}while(left>1);if(target>nums[mid]){left=mid+1;}if(targetnu</div>
</li>
<li><a href="/article/1938400384288616448.htm"
title="代码随想录| 图论01 ●深度优先搜索知识 ●797所有可能的路径 ●广度优先搜索知识 ●200 岛屿数量dfs ●200 岛屿数量bfs" target="_blank">代码随想录| 图论01 ●深度优先搜索知识 ●797所有可能的路径 ●广度优先搜索知识 ●200 岛屿数量dfs ●200 岛屿数量bfs</a>
<span class="text-muted">weixin_51674457</span>
<a class="tag" taget="_blank" href="/search/%E4%BB%A3%E7%A0%81%E9%9A%8F%E6%83%B3%E5%BD%95%E4%B8%80%E5%88%B7/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/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E5%AE%BD%E5%BA%A6%E4%BC%98%E5%85%88/1.htm">宽度优先</a>
<div>#dfs知识看了一下感觉和二叉树，和回溯，没啥区别。#797所有可能路径普通回溯，很快path.push_back(0);要提前写不要忘了。另外path不要担心不需要归零，他每次回溯call完了会退回去的vector>res;vectorpath;voiddfs(intnode,intn,vector>&graph){if(node==n-1){res.push_back(path);return</div>
</li>
<li><a href="/article/1938395845552566272.htm"
title="代码随想录|图论理论基础" target="_blank">代码随想录|图论理论基础</a>
<span class="text-muted"></span>
<div>1.图的种类（有向图和无向图）有向图：图中边有方向无向图：图中边无方向加权有向图：图中边是有权值和方向的，无向图也是如此2.度（无向图中有几条边连接该节点，该节点就有几度）出度：从该节点出发的边的个数入度：指向该节点边的个数3.连通性（在图中表示节点的联通情况，我们称之为连通性）连通图：在无向图中，任何两个节点都是可以到达的（可以借助其他节点）非连通图：有节点不能到达其他节点强连通图：在有向图中，</div>
</li>
<li><a href="/article/1938395718125416448.htm"
title="20240820 代码随想录 ｜ 图论 岛屿" target="_blank">20240820 代码随想录 ｜ 图论 岛屿</a>
<span class="text-muted">m0_46259676</span>
<a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E7%AE%97%E6%B3%95/1.htm">算法</a>
<div>98.所有可达路径深度优先搜索（dfs）和广度优先搜索（bfs）区别：dfs是可一个方向去搜，不到黄河不回头，直到遇到绝境了，搜不下去了，再换方向（换方向的过程就涉及到了回溯）。bfs是先把本节点所连接的所有节点遍历一遍，走到下一个节点的时候，再把连接节点的所有节点遍历一遍，搜索方向更像是广度，四面八方的搜索过程。n,m=map(int,input().split())print(''.join(</div>
</li>
<li><a href="/article/1938395718746173440.htm"
title="20240821 代码随想录 ｜ 图论" target="_blank">20240821 代码随想录 ｜ 图论</a>
<span class="text-muted">m0_46259676</span>
<a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a>
<div>103.水流问题dfs深度优先搜素directions=[[0,1],[0,-1],[1,0],[-1,0]]set_1=set()set_2=set()n,m=map(int,input().split())g=[]for_inrange(n):g.append(list(map(int,input().split())))defdfs(g,x,y,visited,s):visited[x][y</div>
</li>
<li><a href="/article/1938390924845445120.htm"
title="代码随想录|图论|04广度优先搜索理论基础" target="_blank">代码随想录|图论|04广度优先搜索理论基础</a>
<span class="text-muted">Paper Clouds</span>
<a class="tag" taget="_blank" href="/search/%E5%9B%BE%E8%AE%BA/1.htm">图论</a><a class="tag" taget="_blank" href="/search/%E5%AE%BD%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>广搜的使用场景广搜的搜索方式就适合于解决两个点之间的最短路径问题。因为广搜是从起点出发，以起始点为中心一圈一圈进行搜索，一旦遇到终点，记录之前走过的节点就是一条最短路。当然，也有一些问题是广搜和深搜都可以解决的，例如岛屿问题，这类问题的特征就是不涉及具体的遍历方式，只要能把相邻且相同属性的节点标记上就行。（我们会在具体题目讲解中详细来说）比如下面这个图，从start开始慢慢向外扩展，第4次扩展才到</div>
</li>
<li><a href="/article/1938390925906604032.htm"
title="代码随想录|图论|05岛屿数量（深搜DFS）" target="_blank">代码随想录|图论|05岛屿数量（深搜DFS）</a>
<span class="text-muted">Paper Clouds</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>
<div>leetcode:99.岛屿数量题目题目描述：给定一个由1（陆地）和0（水）组成的矩阵，你需要计算岛屿的数量。岛屿由水平方向或垂直方向上相邻的陆地连接而成，并且四周都是水域。你可以假设矩阵外均被水包围。输入描述：第一行包含两个整数N,M，表示矩阵的行数和列数。后续N行，每行包含M个数字，数字为1或者0。输出描述：输出一个整数，表示岛屿的数量。如果不存在岛屿，则输出0。思路遇到一个没有遍历过的节点陆</div>
</li>
<li><a href="/article/1938385376699805696.htm"
title="代码随想录day16二叉树4" target="_blank">代码随想录day16二叉树4</a>
<span class="text-muted">皮蛋瘦肉粥_121</span>
<a class="tag" taget="_blank" href="/search/%E4%BA%8C%E5%8F%89%E6%A0%91/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>文章目录513.找树左下角的值112.路径总和113.路径总和II106.从中序与后序遍历序列构造二叉树105.从前序与中序遍历序列构造二叉树513.找树左下角的值题目链接文章讲解/***Definitionforabinarytreenode.*structTreeNode{*intval;*TreeNode*left;*TreeNode*right;*TreeNode():val(0),lef</div>
</li>
<li><a href="/article/1938385250367369216.htm"
title="代码随想录day13二叉树1" target="_blank">代码随想录day13二叉树1</a>
<span class="text-muted">皮蛋瘦肉粥_121</span>
<a class="tag" taget="_blank" href="/search/%E4%BA%8C%E5%8F%89%E6%A0%91/1.htm">二叉树</a>
<div>文章目录二叉树的递归遍历二叉树前序遍历二叉树后序遍历二叉树中序遍历二叉树层序遍历102.二叉树的层序遍历107.二叉树的层序遍历II199.二叉树的右视图637.二叉树的层平均值429.N叉树的层序遍历515.在每个树行中找最大值116.填充每个节点的下一个右侧节点指针117.填充每个节点的下一个右侧节点指针II104.二叉树的最大深度111.二叉树的最小深度二叉树的递归遍历文章讲解确定递归函数的</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>