ttc8 01

Tags: linu dir management class mkdir pwd create CTO usr Directcd, pwd, lsmkdir, rmdir, treemkdir [Options]/path/to/somewhere-P: exists in no error, and can automatically create the required directories;-V: Show more information-M MODE: Specify permissions directly when creating a directory;Tree-D: Show only directories-L Level: Specifies the number of levels to display-P Pattern: Displays only the path that is matched by the specified pattern;RmDir: Delete Empty directoryrmdir [OPTION] ... DIRE

cat, tacmore, less, tail, headMoreMore [OPTIONS ...] FILE ...-D: Show page flipping and exit tipsLessLess [OPTIONS ...] FILE ...HeadHead [OPTION] ... [FILE] ...-C #: Specify get before # bytes-N #: Specifies the first # line to get-#：Tailtail [OPTION] ... [FILE] ...-C #: Specifies the # bytes after fetching-N #: Specifies the # line after fetch-#：-F: Trace displays the new content of the file;2018-01-09 Linux text File view class commands

packagesname.rpmrpm -qa|grep sql # 检查是否安装带sql的软件包# apt-get是Debian Linux发行版中的apt软件包管理工具。Debian软件库存在互联网上的一些公共站点上，# /etc/apt/sources.list是存放这些地址列表的配置文件Process Management# init进程是所有Linux进程的父进程，进程号为1，系统中的第一个进程# ps报告当前系统的进程状态ps -e # 显示所有程序ps -ef |grep ssh # -f参数显示UID,PPIP,C与STIME栏位kill # 删除执行中的程序和工作Network managementping www.zhihu.com # 执行ping指令会使用ICMP传输协议，发出要求回应的信息测试网络连通性ifconfig eth0 downifconfig eth0 upifup eth0激活网络接口eth0ifdown eth0禁止指定的网络接口eth0/etc/init.d/network restart/etc/init.d/networking res

Tags: Linux learning6.1 Compression Packaging IntroductionLinux 常见压缩格式 .zip .gz .bz2 .xz .tar.gz .tar.bz2 .tar.xz6.2 Gzip Compression Toolgzip 1.txtgzip -d 1.txt.gz / unzip 1.txt.gzgzip -# 1.txt // #范围1-9，默认6不能压缩目录,压缩完成后源文件被删除zcat 1.txt.gzgzip -c 1.txt > /tmp/1.txt gunzip -c /root/1.txt.gz > /tmp/1.txt.new-c 源文件保留,必须制定输出的目录 gzip -d -c /tmp/d6z/1.txt.gz > /tmp/d6z/2.txt6.3 bzip2 Compression Toolbzip2 1.txt / bzip2 -z 1.txtbzip2 -d 1.txt.bz2 / bunzip2 1.txt.bz2bzi

]"echo "The execution of the last command: $?"echo "Current shell process id:$$"SH var.sh a B C--executes the script and then appends the parametersFile name: var.shParameter 1:aParameter 2:bNumber of General Staff: 3All parameters: a b CSo the parameter: a b CExecution of the last command: 0--0 represents the last command execution succeeded, non-zero indicates that the last command failed to executeCurrent Shell Process id:49824.read commandThe read command puts the input data received into a

Tags: Linux basic commandsmkdir Single or batch creation of multiple catalogs (common parameters:-P recursively create directories)Touch Create single or batch create multiple filesCP Copy file or directory (Common parameters:-P hold Property-A or-r copy directory)MV moves or cuts files or directories, and can also be renamedRM Delete file or directory (Common parameters:-F Force-R Delete directory-I confirmation prompt)RmDir Delete Empty directoryCat View the contents of the file, edit t

that users can use, but this setting sets the maximum number of files that can be opened (max Open file)And the maximum number of processes that can run concurrently (max user processes) is invalid-A lists all current resource limits-C Sets the maximum value of the core file. Unit: Blocks-D sets the maximum value of the data segment for a process. Unit: Kbytes-F Shell The maximum file size of the created file, in: Blocks-h Specifies to set the hard limit for a given resource. If the user has ro

撤销上一次的操作(类似windows下的ctrl+z)//替换 r 替换当前光标标记的单个字符R 进入REPLACE模式, 连续替换，ESC结束Vim edit modei 编辑模式(不做任何操作)I 光标跳转至本行的头部a 光标的后一位编辑A 将光标移动到本行的尾部o 在当前光标所在的行下添加空白的行O 在当前光标位置的上一行添加空白行Vim end-of-line modeThe last-line mode is used primarily for searching, saving, and exiting files, as well as allowing users to execute external Linux commands or jump to a specific number of lines in a written documentLast-line mode (must be returned to command-line mode):w 保存当前状态:w! 强制保存当前状态:q

=" 6b131551fe0a48508076c84f21b46fc5 "style=" border-top:0px;border-right:0px; background-image:none;border-bottom:0px;padding-top:0px;padding-left:0px;border-left:0px;padding-right:0px; " Border= "0" alt= "6b131551fe0a48508076c84f21b46fc5" src= "http://s3.51cto.com/wyfs02/M02/71/86/ Wkiol1xtpt3xb-tnaakqtd_xhvo841.jpg "height=" 484 "/>Check the message body content, the Chinese support is better, no garbled.650) this.width=650; "title=" 45002ddfccd943d6a786013cd477d0d4 "style=" border-top:0px;bor

, the length can not exceed 255 characters;2. Cannot use/when file name3. Strictly case-sensitive(14)mkdir: Creating an empty Directory-P: Simultaneous creation of multi-level catalogs-v:verbose More informationExample: Mkdir-p/root/x/y/zMkdir-pv/root/x/y/zTo create:/mnt/test/x/m and/mnt/test/y two directories, the command is as follows:mkdir-pv/mnt/test/x/m/mnt/test/yMkdir-pv/mnt/test/{x/m,y}(15) Command line expansionTo create the following 4 directories under/mnt/test2/:A_b, A_c, D_b, D_cFor

01 backpack, full backpack, multiple backpack, and mixed backpack Problems P01: 01 backpack Problems Question There are n items and a backpack with a capacity of v. The cost of the I-th item is C [I], and the value is W [I]. Solving which items are loaded into a backpack can maximize the total value. Basic Ideas This is the most basic problem with a backpack. It features that each item has only one item, an

P01: 01 backpack ProblemsQuestionThere are n items and a backpack with a capacity of v. The cost of the I-th item is C [I], and the value is W [I]. Solving which items are loaded into a backpack can maximize the total value. Basic IdeasThis is the most basic problem with a backpack. It features that each item has only one item, and you can choose to put it or not. Define the state with a subproblem: that is, F [I] [v] indicates the maximum value t

-Sep-03 by country ino ", 2 shows 　　 Figure 2 Then you can enter the Sniffer program and click "capture"-"Stop and display" The analysis result is as follows: 　　 Figure 3 The following are packets: 30 82 01 0a 02 01 00 04 06 70 75 62 6c 69 63 a2 81 fc 02 02 01 dd 02 01 00 01

Elementary Introduction to 01 fractional planningThe so-called 01 score plan, see this name, may think of 01 backpack, actually grow similar.This algorithm is required to "cost-effective" the highest solution. Sum (v)/sum (W) the highest solution. DefinedWe give two arrays, A[i] indicates the benefit of selecting I, B[i] indicates the cost of selecting I. I

ESP8266 WIFI module Burn write upgrade firmware http://cckyz.blog.163.com/blog/static/13706603520150282355569/ When you want to get started with the ESP8266 WIFI module burning, you must be getting a headache from a bunch of help files. And then bask in how I burn the firmware, hoping to help you to relieve the effect. :) Burn Write Step 1, connect the GPIO0 through the 1K resistor to GND 2, connect the CH_PD to VCC 3, connect Utxd with URXD to the corresponding PIN 4 of the USB port module, a

1. SQL Server information collectionSQLDIAGUsing the interfaceC:\users\administrator>sqldiag2018/01/02 08:13:26.10 SQLDIAG Collector version2018/01/02 08:13:28.19 SQLDIAGIMPORTANT: Please wait until ' see ' Collection started ' before attempting toReproduce your issue2018/01/02 08:13:28.19 SQLDIAG Output Path:C:\Program Files\Microsoft SQL Server\100\tools\binn\s

PHP learning Notes 01 and php learning Notes 01. PHP Study Notes 01, php Study Notes 01 example: why do you want to learn PHP subjective reasons: some graduation tasks were handled at school some time ago, and you started your job search journey after returning to Shanghai. PHP Study Notes

. Build the path to the optimal solution from the calculated information.One of the steps is the basis of the dynamic Solver problem. If the title only requires the value of the optimal solution, then step 4 can be omitted.The basic model of the backpack is to give you a backpack with a capacity of VUnder certain restrictions to the maximum (minimum?) Value of somethingCurrent state → Previous stateRead DD Daniel's "Backpack Nine" (Click to download), confused with a trace of sobriety, here I al

This is a function that calculates the number of days from January 01, 2000 to a specified day (end of calculation) date format: YYYY-MM-DD Calculate the number of days from January 01, 2000 to a day function Cal_start2end ($end _day, $start _day) { $start _day=ereg_replace ("-", "", $start _day); $end _day=ereg_replace ("-", "", $end _day); if ($end _day>= $start _day) {//Due date is greater than st

Hdu1864_ maximum reimbursement amount (Backpack/01 backpack), HDU1864 backpack Solution report Question Portal #include Maximum reimbursement amount Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 16358 Accepted Submission (s): 4775 Problem Description an existing fund can be reimbursed for a certain amount of invoices. The types of invoices that can be reimbursed include books (Class A), stati