The topic is: A frog can jump up to one step or two steps at a time ... It can also jump up to N steps.Find out how many jumping methods the frog can use to jump up an n-step.Analysis: n level =(N-1) situation +(N-2) situation.Since both cases can be selected, the number of times in both cases is added. algorithm 1. The simplest recursive implementation code is: long long

A frog can jump up to 1 step or 2 steps at a time ... It can also jump up to N steps.Find out how many jumping methods the frog can use to jump up an n-step.
n stands for n steps, 1 stands for the first step of jumping one step, and f(n-1) stands for how many kinds of jumping methods remain after the first step of jumping one step.

It can be said that the idea of SVM runs through the whole traditional machine learning method, which is not only the theoretical basis, but also a master.The author himself is very good. This blog post is well written and well summarized.
This article is reproduced from: https://blog.csdn.net/v_JULY_v/article/details/7624837

The Collection classes used in Java API all implement the Collection interface.One of his class inheritance structures is as follows: collection <-list <-vector collection <-list <-arraylist collection <-list <-linked list collection <-set <-hashset collection <-set <-hashset <--linkedhassetcollection <-set <-sortedset <-treesetvector: List based on Array, in fact, encapsulates some functions that Array does not have for us to use, and it is impossible to go into the limitation of Array.It is impossible to surpass Array in performance.

Recently, I read OHEM and RBG, which is an improvement on Fast RCNN. The target candidate box extraction still uses the Selective Search algorithm.I intend to modify it on FastRCNN and make full use of RPN network to extract target candidate boxes.The whole revision is more convenient than others.The author of the related code paper of Fast RCNN+OHEM has already opened source on github, and the address is: https://github.com/abhi2610/ohem. We just need to improve on it.

Problem Description The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child’s like-animal is a cat, then his/hers dislike-animal must be a dog, and vice versa. Now the zoo administrator is removing some animals, if one child’s like-animal is not removed

reshape function: reshape that array, i. e. reshape the array.
Read by Column.
Syntax: A = reshape(A, M, N) or A = reshape(A, [ M, N ]) % Arranges rows and columns of A into M rows and N columns
>> A=[1,2,3,4,5,6,7,8,9,10,11,12]
A =
1 2 3 4 5 6 7 8 9 10 11 12
>> B=reshape(A,2,6)
B =
1 3 5 7 9 11

JJLabel There is a long-press copy function, and there is a block event when copying is about to be completed and when copying is about to be completed (this function is turned on by default). The code is as follows:
JJLabel *copyLab = [[JJLabel alloc] init];
copyLab.frame = CGRectMake(20, 100, (superViewWidth - 20 * 2), 30);
CopyLab.text = @ " ajie said: this is the content to be copied and will turn blue when copied"

databinding is easy to use, but it is not so convenient to find a problem when you encounter a pit. The following is a problem I encountered today. Record it and it may help you.
After that, I was able to compile and package normally last night. Today I sorted out the project files and moved several files to another package. I used Android Studio to move the files.