Others

1. IP address composition: the IP address consists of 32 bits (4 bytes), which are divided into the network number and host number; 2. Category: A: the first digit is 0; 1.0.0.0 ~ 127.20.255; the first eight digits are the network number, and the

Given a sorted Linked List, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1-> 2-> 3-> 3-> 4-> 5, return 1-> 2-> 5.Given 1-> 1-> 1-> 2-> 3, return 2-> 3. This is the evolutionary

[Description] Farmer John has always fed his cows with the best feed. Three kinds of raw materials are used for feed: barley, oatmeal and wheat. He knows the exact proportion of his feed and cannot buy it in the market. He had to buy three other

Description: A matrix of N * m to find the child matrix with the minimum and no less than K of all elements in this matrix (the number of elements in the matrix is the matrix Area) Input: In each case, the first line contains

Problem description: Given a singly linked listL:L0 →L1 →... →LN-1 →LN, Reorder it:L0 →LN→L1 →LN-1 →L2 →LN-2 →... You must do this in-place without altering the nodes 'values. For example,Given{1,2,3,4}, Reorder it{1,4,2,3}.   Solution: 1 public

Problem description: Given a binary tree, returnPreorderTraversal of its nodes 'values. Solution: 1 public List preorderTraversal(TreeNode root) { 2 if (root == null) return new LinkedList(); 3 List list = new LinkedList(); 4

It's half the year after midday Ma. In the first half of this year, he was under the drive of Yi Ma Xing and has been working on a business trip. It seems very busy, but it turns out that the work on a business trip is inefficient, and a project

Problem description: Sort a linked list inO(NLogN) Time using constant space complexity. Solution: 1 public ListNode sortList(ListNode head) { 2 ListNode tail , p, q, e; 3 int insize, merges, psize, qsize, i; 4 if (head

(1) Introduction After we use the jar command to pack the package, we will create a META-INF directory under the root directory, there will be some descriptions of the jar package information, there will certainly be a manifest. mf file, which

A very simple question /*** Definition for binary tree * struct treenode {* int val; * treenode * left; * treenode * right; * treenode (int x): Val (x ), left (null), right (null) {}*}; */class solution {public: bool issametree (treenode * P,

Where vs having when a where clause exists in an SQL statement, the where clause is executed first, then the group by clause is executed, and then the having is executed. generally, only use 'having' when you use 'group by 'always use 'having' with

Tree hierarchy traversal is relatively simple. The three questions are exactly the same, but the results are reverse in a specific place.   1. Binary Tree level order traversal /** * Definition for binary tree * struct TreeNode { * int val; *

I. Concepts Imagine the common factory we see, the next order, the deposit, and a while later we can pick up the goods. We don't need to know what machines are used in the factory, how to arrange the workers, where the materials come from, just need

Problem description:Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Solution: recursion. 1 public List> pathSum(TreeNode root, int sum) { 2 List> list = new ArrayList>(); 3 if

Basic questions about AC ry. 1 #include 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 8 #define MAXL 1000005 9 #define TRIEN 26 10 11 char des[MAXL], src[55]; 12 13 typedef struct Trie { 14 int n; 15

Original question: Ultraviolet A 1172 http://uva.onlinejudge.org/index.php? Option = com_onlinejudge & Itemid = 8 & page = show_problem & problem = 3613 Dynamic Planning. Definition: DP [I] = maximum weight and minimum number of bridges that can be

1. Multi-inheritance of diamond type. If you do not want duplicate variables for the class at the bottom, you must declare it as virtual inheritance. Class file {...}; Class inputfile: virtual public file {..}; Class outputfile: virtual public file {

Category and Extension (2) Category and Extension (2) Add property to category In the previous article, category cannot be added to add attributes. Recently, a project just has this requirement. After Google's introduction, category has a way to add

Generally, one sentence is enough: Gcc-O fuck. c ./Fuck Run directly     Problem 1. Error LD not found In this case, GCC compilation is distributed and the specific LD is specified. Gcc-C 1.C // a file named 1.o is generated in the

/* [Question source] http://poj.org/problem? Id = 1128 [question analysis] A few pictures are stacked together to show the stacked situation. All possible stacking sequence from bottom to top is required. [Idea Analysis] 1. The question clearly