首页 > TAG信息列表 > 19.2
一.nmap扫描
一.基础功能 1.扫描IP地址： nmap -sn 192.168.19.0/24 2.扫描端口号： 基于SYN包扫描：nmap -sS 192.168.112.188 基于三次握手扫描：nmap -sT 192.168.112.188 指定端口扫描： 指定端口：namp -p10-200，-p21，22，25，80，445，3306，1521，8080，8888，192.168.19.2 扫描端口和版本：namp -sV 192.168linux虚拟机固定ip
网上很多关于固定ip的文档，都很复杂。、 后来测试了这篇文档，很简单，很实用。 一：固定ip 1.pwd /etc/sysconfig/network-scripts 2.程序 修改项： BOOTPROTO="static" IPADDR=192.168.19.131 NETMASK=255.255.255.0 GATEWAY=192.168.19.2 DNS1=192.168.19.2 全部配置： TYcentos8+oracle19开机自启动
centos8+oracle19开机自启动 一、将oratab最后一项调整"Y"cat /etc/orataborclpdb:/home/app/oracle/product/19.2.0/db_1:Y 二、建立oracle.sh执行文件cat /usr/bin/oracle.sh#!/bin/bash # script For oracle19c.servic/home/app/oracle/product/19.2.0/db_1/bin/lsnrctl stapip version 19.2.3,升级到version 20.0.2解决办法
pip源在国外，这里需要使用国内的源 python -m pip install --upgrade pip -i https://pypi.douban.com/simple 安装其他包时，亦是如此。 pip install yapf -i https://pypi.douban.com/simplepip的更新问题：You are using pip version 19.2.3, however version 20.0.2 is available.
pip的更新问题：You are using pip version 19.2.3, however version 20.0.2 is available. python版本：3.8 解决途径：pip3 install --user --upgrade pip 注意：一定要加 --user 因为版本不同，所以你如果是python3，但是输入以下代码： python -m pip install --user --upgrade pip 是Jupyter Notebook 安装与使用
Ref: https://jupyter.org/install Installing Jupyter Notebook with pip python -m pip install --upgrade pip wget https://files.pythonhosted.org/packages/62/ca/94d32a6516ed197a491d17d46595ce58a83cbb2fca280414e57cd86b84dc/pip-19.2.1-py2.py3-none-any.whl pythowin10 64位 python3.7安装 twisted
Twisted 转载https://www.aliyun.com/jiaocheng/443032.html 安装Twisted 会报错，error: Microsoft Visual C++ 14.0 is required. Get it with “Microsoft Visual C++ Build Tools”: http://landinghub.visualstudi o.com/visual-cpp-build-tools 解决方法： 到http://www.lf19.2.24 [LeetCode 94] Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3Output: [1,3,2] 1 class Solution { 2 public: 3 void build(TreeNode*root, vector<int>&ans) { 4 if (ro19.2.23 [LeetCode 86] Partition List
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. Example: Input: head = 1->4->3-19.2.23 [LeetCode 85] Maximal Rectangle
Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example: Input:[ ["1","0","1","0","0"], ["1","0",&19.2.22 [LeetCode 84] Largest Rectangle in Histogram
Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width of each bar is 1, given height = [2,1,5,6,2,3]. The larg19.2.13 [LeetCode 71] Simplify Path
Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path. In a UNIX-style file system, a period . refers to the current directory. Furthermore, a double period .. moves the directory up a level. Fo19.2.9 [LeetCode 59] Spiral Matrix II
Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order. Example: Input: 3Output:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ]] 1 class Solution { 2 public: 3 vector<vector<int>> generateMatrix(i19.2.9 [LeetCode 58] Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word does not exist, return 0. Note: A word is defined as a character sequence consists of non-spac19.2.8 [LeetCode 51] N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. Each solution contains a distinct board configuration of t19.2.7 [LeetCode 50] Pow(x, n)
Implement pow(x, n), which calculates x raised to the power n (xn). Example 1: Input: 2.00000, 10Output: 1024.00000 Example 2: Input: 2.10000, 3Output: 9.26100 Example 3: Input: 2.00000, -2Output: 0.25000Explanation: 2-2 = 1/22 = 1/4 = 0.25 Note: -100.019.2.7 [LeetCode 45] Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps. Exa19.2.4 [LeetCode 42] Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain19.2.3 [LeetCode 40] Combination Sum II
Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target. Each number in candidates may only be used once in the combination. Note: All numb19.2.2 [LeetCode 34] Find First and Last Position of Element in Sorted Array
Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexity must be in the order of O(log n). If the target is not found in the array, return [-1, -1].19.2.2 [LeetCode 33] Search in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). You are given a target value to search. If found in the array return its index, otherwise return -1. You