Others

2014 Annual Summary2 hours into the 2015, I have to hurry to write AH =. = About workToday, in March, he formally joined a senior start-up company, which was transferred from the Web front to the front. The company is in a residential building. At

is fast to the new year, a long time ago, until then all write an article approaching Victory Kee.This year, as usual, new developments are coming up next year. I don't know what will happen.Sometimes hate themselves, too not smooth.Next year also

Whether it's a seven-story or a three-story layer, the division of work between layers has a strong order. Since the division of the hierarchy, the provisions of each layer of their respective tasks, then to respect, Teruaki implementation is good.

Model1jsp+ JavaBean, the model achieves a certain degree of MVC, is mainly reflected in the JSP as a combination of the display layer and the control layer, its basic architecture pattern is:Model2the so-called Model2 is an embodiment of the MVC

finally to this time of year, and this year there is no snow. Shanghai's winter feeling is good, at least not as cold and clammy as Suzhou. Compared to two years ago at this moment, in the end is a little mature, not lost in the past, to use

When I was ready to write the 2014 summary, I suddenly found that my 2013-year summary has not been written yet. 2013 Year-end summaryWant to go back to fill him up, and try to recall that year did things, have not remember what to do, more

Today is the last day of the 2014, I would like to review the experience of the past year and change, but do not know what to write, open the previous article began to recall some of the things that I experienced this year, experience is a kind of

Front-end development whqet,csdn, Wang Haiqing, Whqet, front-end development expertsI do not know when, the success of the measurement standard has become a "paragraph", do not know when, "than" become the main melody of interpersonal communication,

Given, strings, find the longest comment subsequence (LCS).Your code should return the length of the LCS.ExampleFor "ABCD" and "EDCA", the LCS is "A" (or D or C), return 1For "ABCD" and "EACB", the LCS is "AC", return 2Solution:1 Public

Title: http://www.lydsy.com:808/JudgeOnline/problem.php?id=1070Analysis:Divide each worker into N points. A[I,J] indicates that the first worker repairs the countdown J car.Each car is connected to the point of all n*m workers. The flow rate is 1

The old question.Class Solution {Public:listnode *getintersectionnode (ListNode *heada, ListNode *headb) {ListNode *tailA = head A ListNode *tailb = headb; int lengtha = GetLength (Heada, Taila); int LENGTHB = GetLength

Because this is the MoD maximum of 100000So I thought of the string as a group of 5, and I recorded how many of the following 100000Take 5 numbers at a time to update the model based on its dataNote that the 100000*100000 in the process will be

Similar to two points.Class Solution {public: int findpeakelement (const vector &num) { int size = Num.size (); int left = 0; int right = size-1; while (left num[mid-1]) && (mid = = Size-1 | | num[mid] >

Using stacks to record possible paths, the top of the stack is always the next element.Class Bstiterator {public: stack path; Bstiterator (TreeNode *root) { path = Stack (); TreeNode *node = root; while (node! = NULL) {

Immediately into the 2015, for 2014 also need to have a review, whether it is a family or work, 2014 years is a value of the Year of Remembrance.This year my wife and I received a gift from God that we need a lifetime of care-our baby daughter, the

DP. Similar to Max and. is to record both positive and negative cases.Class Solution {public: int maxproduct (int a[], int n) { vector positive (n); Vector minus (n); int result = A[0]; for (int i = 0; i 0) {

Implement an iterator over a binary search tree (BST). Your iterator is initialized with the root node of a BST.Calling would return the next smallest number in the next() BST.Note: next() hasNext() and should run in average O (1) time and uses O (h)

Only one set of numbers can be exchanged at a time, and the reverse effect is achieved.We can understand that we always want to put a number in the right place each time, so a number hasThe chance to move clockwise counterclockwise in two directions,

Title: (Tree Stack)Implement an iterator over a binary search tree (BST). Your iterator is initialized with the root node of a BST.Calling would return the next smallest number in the next() BST.Note: next() hasNext() and should run in average O (1)

Old topic. Two stacks.Class Minstack { stack stk; stack minstk;public: void push (int x) { stk.push (x); if (Minstk.empty () | | minstk.top () >= x) { minstk.push (x); } } void Pop () { int x =