Others

See this blog for details: http://www.cnblogs.com/skywang12345/p/3596881.htmlIntroduction to direct insertion sortingThe basic idea of a direct insert sort (straight insertion sort) is to look at the N-sorted elements as an ordered table and an

Title:Given an array of integers, locate and zero the sub-array. Your code should return the starting and ending positions of the subarray that meet the requirements.Sample Example Given [-3, 1, 2,-3, 4], return [0, 2] or [1, 3].Problem Solving

The merge sort of the linked list (linklist merge sort)First of all, if there are two ordered (sorted) linked list ListNode *a, and ListNode *b, how to merge into an ordered list?ListNode * mergetwolists (ListNode *l1, ListNode *L2) {ListNode*head

Online a bunch of people to write km algorithm, have not found out which speak better.KM algorithm approximate process:(1) Initializes an LX array to the one of the boy's most weighted edges. Initialize the LY array to 0.(2) For each boy, find a

Recently contacted OOP object-oriented, learning OOP, this, super, package, extends and override, overall if not clear memory of the process, the knowledge will be very confusing, with the teacher's help, took a picture, Can clearly identify the

My Friend is working on some case, and she looks isn't in the mood. I ask her, what's going on. She wants me to look at the screenshot as below. That's why she's upset ... IEF could not decode Chinese character in IE, "the filenames in Chinese could"

Background: Because HTTP is a stateless protocol, we cannot tell the same user to log the user's information on multiple requests, which requires frequent authentication, including having to open multiple browsers to browse the same site and still

This topic is very strange, design pattern is the bootloader design is not imitate what software? Uh. I mean, this is the opposite of the "object" design pattern.I've seen people write "explain design patterns to wives," so it's good to combine

 A-Maximum sub-segments andTime limit:1000MS Memory Limit:32768KB 64bit IO Format:%i64d &%i64 U  DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the

Approximate test instructions:In order to protect the grazing environment and avoid excessive biting of the turf in the same place, ranchers decided to use the continuous migration of livestock to feed the way to protect the pasture. However,

Today set KMP template to do a question, sensitive to find me to speak next[] array when I asked Meng. The specific principles are not clear the light by the template to make up for a moment, ah, so again smoothed a smooth shun, this impression to

1. Single Duty principle (Responsibility Principle)Each class should focus on doing one thing.2. Richter Replacement principle (Liskov Substitution Principle)Where a superclass exists, subclasses can be replaced.3. Dependency inversion principle

As Maven's pom.xml begins with the followingWho can explain, this thing has a society to use, do not write this thing what will happen, the official copy of the documentation even if, I want a concise explanation.Greatly

Multithreading and co-processesMultithreading is preemptive multitasking (preemptive multitasking), where each sub-thread is determined by the operating system when it executes, and because execution times are unpredictable, multithreading requires

Yes, just got my mangoose today! It ' s a run of the mill Chinese clone, just for $ USD from www.wobd2.com.Anyway, got it all hooked up and got V134 of the software on and running and some nice flashy lights happening to indicate It ' s

In fact, before a squid, just because too lazy, online random search a tutorial, with the default port and no user authentication added. One day, unfortunately, was swept by a reptile, and was used to send a half-month of junk mail. Until one day to

Title: give you a degree of construction and height, we pray for the longest and descending heights.Analysis: DP, maximum ascending sub.Description: Has length and cannot directly optimize queue monotony.#include #include #include using namespace

Description:On a grid map there is n little men and N houses. In each unit time, every little mans can move one unit step, either horizontally, or vertically, to a adjacent point. For each little mans, you need to pay a $ fee for every step he moves,

Push is one of the most important ways to maintain app retention, but most app developers are not aware of the meaning of push, nor have they set up a way to evaluate push quality. Push is a classic double-edged sword, and if used well can help you

#!/bin/bashif ls /backup | grep $ (date +%f)  &> /dev/nullthen     echo  "Today is already backup"           exit 1else    if ls / | grep backup  &> /dev/null    then       if [ - f /backup ]        then            mv /backup /$ (date +%t)