Others

Create function fun_getPY (@ str nvarchar (4000 )) Returns nvarchar (4000) As Begin Declare @ word nchar (1), @ PY nvarchar (4000) Set @ PY ='' While len (@ str)> 0 Begin Set @ word = left (@ str, 1) -- If it is not a Chinese character, the original

  sdfasda ASDFASDF

Code Code highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->If object_id ('tempdb .. # ') is not null Drop table # Check whether a temporary table exists '#' Object_id this function returns the

I developed the asp.net website, and a netizen's website in the QQ group was infected with Trojans. He asked me to write a Security Article. Let me introduce my experience. Don't hit me with bricks...The following uses ASP. NET as an example. 1. SQL

1. Brief Introduction Remember, in the object-oriented programming class, I learned finite state machines. Later, when I compiled the principle, I went on finite state machines until I got a formal language automatic machine. It seems that the core

1. Brief Introduction Assume that the array to be sorted is int array [] and the array length is N.1st-byte sorting: select the smallest element from array [0]-array [n-1]. If this element is not array [0], it is exchanged.2nd-byte sorting: select

1. extremely small and extremely large search methodsIt is generally used in Game Search, such as go, wuziqi, and chess. There are three possible outcomes: victory, failure, and peace. Brute-force search: If you want to obtain the final result

1. Basic group Aggregation The algorithm introduced in this section is from Craig Renault's paper Flocks, Herds and Schools: A Distributed Behavioral Model published in 1987. In this paper, he proposed an algorithm prototype to simulate a group of

1. Brief Introduction The query set is a tree-type data structure used to deal with the merge and query problems of some disjoint sets. Forest is often used.The operations to be implemented include merging two sets to determine whether the two

1. Overview Potential functions are physics principles. We mainly use potential functions to control unit behaviors in the game. For example, we can use potential functions to build groups, simulate group movement, deal with Chase and Dodge, and

This is just to change the minimum number of concatenation times in Wang Xiaodong's book to the maximum number of concatenation times. The method is DP. State transition equation: M [I] [J] = max (M [I] [k] + M [k + 1] [J] + P [I-1] * P [k] * P [j])

1. Brief Introduction Assume that the array to be sorted is int array [] and the array length is N.In the range of array [0]-array [n-1], the system compares the values from the back to the front in sequence and switches the smaller values to the

1. Only integer operations can be performed, such as char, short, int, and long (whether signed or unsigned)   2. >>, 1) cannot be less. Note that the right shift> operator,For the unsigned number, the left side is filled with 0, while for the

Seeing this question, I immediately thought of finding the depth of the binary tree (by finding the depth of the left and right Subtrees respectively, and then merging (taking the maximum value and adding 1) thus, the depth of the root node is

1. Brief Introduction Given a positive integer N, evaluate a minimum positive integer M (M> 1) so that the decimal representation of N * M contains only 1 and 0.For example, when N = 99, M = 1 122 334 455 667 789, N * M = 111 111 111 111 111 111. 2.

0. Brief Description This document mainly references "a tutorial on Hidden Markov models". This article can be found at http://vision.ai.uiuc.edu/dugad. We mainly read this technical report to learn about some hmm learning algorithms, namely,

1. Question # Include Using namespace STD;Class S {};Class A: s {Virtual void fun (){;}};Class B: {Virtual void fun (){;}};Class C: B {Virtual void fun (){;}};Class M {Virtual void fun (){}};Class N {Virtual void fun (){}};Class P: M, N {Virtual

1. Brief Introduction The question I saw on a blog is Netease's interview question. I used the method in the previous article to derive it well. 2. Question Print the following matrix N = 5: 1 2 9 10 25 4 3 8 11 24 5 6 7 12 23 16 15 14 13 22

1. Brief Introduction Problem 1: Given a binary tree, you must traverse the binary tree hierarchically, that is, access the binary tree from the top to bottom layers (each layer will output a single row ), each layer requires access from left to