05 2016 档案
摘要：java String.split()函数的用法分析栏目:Java基础 作者:admin 日期:2015-04-06 评论:0 点击: 3,195 次在java.lang包中有String.split()方法的原型是：public String[] split(String regex, int limit)split函数是用于使用特定的切割符（regex）来分隔字符串成一个字符串数组，函数返回是...
阅读全文
摘要：#include #include void swap2(int a, int b);void swap(int* data, int m, int n);void printArray(int* data, int n);void bubble1(int* data, int n...
阅读全文
摘要：1. 修改配置文件/etc/network/interfacesroot@ubuntu:~# sudo gedit /etc/network/interfaces添加以下内容：auto eth0 #设置自动启动eth0接口iface eth0 inet static #配置静态IPaddress 192.168.11.88 #IP地址netmas...
阅读全文
摘要：原文地址： https://github.com/ZhaoKaiQiang/AndroidDifficultAnalysis/blob/master/10.ART%E3%80%81JIT%E3%80%81AOT%E3%80%81Dalvik%E4%B9%8B%E9%97%B4%E6...
阅读全文
摘要：原文地址： https://github.c...
阅读全文
摘要：#include using namespace std;const int N = 10;int data[]= {6,1,2,7,9,3,4,5,10,8};void quickSort(int* data, int low,int high);void printArray(...
阅读全文
摘要：#include using namespace std;const int N = 10;int data[] = {6,1,2,7,9,3,4,5,10,8};void binaryInsertSort(int* data,int n);void printArray(int*...
阅读全文
摘要：```#include using namespace std;const int N = 10;int data[] = {6,1,2,7,9,3,4,5,10,8};void binaryInsertSort(int* data,int n);void printArray(int* data, int n);int locate(int*data,int i);int main(){ ...
阅读全文
摘要：#include using namespace std;const int N = 10;int data[] ={6,1,2,7,9,3,4,5,10,8};void directInsertSort(int* data,int n);void printArray(int* ...
阅读全文
摘要：```#include using namespace std;const int N = 10;int data[] ={6,1,2,7,9,3,4,5,10,8};void directInsertSort(int* data,int n);void printArray(int* data, int n);int main(){ directInsertSort(data,N); ...
阅读全文
摘要：```#include using namespace std;const int N = 10;int data[] = {6,1,2,7,9,3,4,5,10,8};void quickSort(int *data,int low,int high);int partition(int *data, int low , int high);void printArray(int *data,i...
阅读全文
摘要：#include using namespace std;const int MAXSIZE = 1000;typedef int ELEMTYPE;const int N = 10;typedef struct { ELEMTYPE data[MAXSIZE]; in...
阅读全文
摘要：```#include using namespace std;const int MAXSIZE = 1000;typedef int ELEMTYPE;const int N = 10;typedef struct { ELEMTYPE data[MAXSIZE]; int head; int tail;}Queue;Queue Q;void initQueue(Queue ...
阅读全文
摘要：package com.lxm.demos;import java.io.BufferedReader;import java.io.BufferedWriter;import java.io.File;import java.io.FileInputStream;import j...
阅读全文
摘要：引用：http://www.cnblogs.com/ybwang/archive/2010/06/04/1751279.html 参考：1.范式间的区别http://www.cnblogs.com/winlinglin/archive/2008/11/19/1336337.html2. 数据库范式1NF 2NF 3NF BCNFhttp://dev.firnow.com/course/7_data...
阅读全文
摘要：# 查看当前进程ID与当前进程的父进程ID`$$``echo i done```**注意for与(之间有空格#set、env以及export的联系与区别*注意：每一个shell都是一个单独的进程** set定义的变量是每个shell进...
阅读全文
摘要：Cmd Markdown https://www.zybuluo.com 简书http://www.jianshu.comm201572935@hust.edu.cnlxm123 farboxhttp://yueludanfeng.farbox.com/admin m201572935@hust.edu.cnlxm123来自为知笔记(Wiz)
阅读全文
摘要：查看当前进程ID与当前进程的父进程ID$$ echo i done**注意for与(之间有空格set、env以及export的联系与区别...
阅读全文
摘要：#include using namespace std;const int N = 10;typedef int ELEMTYPE;typedef struct Node{ ELEMTYPE data; Node *next;}LNode,*LinkL...
阅读全文
摘要：#include using namespace std;const int N = 10;typedef int ELEMTYPE;typedef struct Node{ ELEMTYPE data; struct Node * next;}LNode;typede...
阅读全文
摘要：/* 功能：栈的链表实现 Author：lxm Date: 20160511*/#include #include #define ELEMTYPE int#define STACK_EMPTY -9999#define N 10typedef struc...
阅读全文
摘要：“`#include #define MAXSIZE 10001#define ELEMTYPE int#define STACK_EMPTY -9999#define N 10typedef struct stack{ ELEMTYPE data[MAXSIZE]; ...
阅读全文
摘要：# 显示文件大小`ls -lh`#显示目录大小du -sh```$ du -sh /usr/* 286M /usr/bin 124K /usr/games 20M /usr/include 1.6G /usr/lib 52M /usr/local 36M /usr/sbin 1.7G /usr/share 103M /usr/src```以...
阅读全文
摘要：#list#break #delete #run#continue#finish#quit#next#step#print#watch l b 10; b add; b 10 if x>1#wi 以简单图形方式调试来自为知笔记(Wiz)
阅读全文
摘要：#include #define MAXSIZE 101#define ELEMTYPE int#define QUEUE_EMPTY -10000typedef struct queue{ ELEMTYPE data[MAXSIZE]; int head; in...
阅读全文
