Day1
1.遍历出一个文件夹下的所有文件,并展示出层级关系,文件夹优先显示,最后以一定格式写入文本中
要求:尽可能简单、逻辑清晰
所选存储格式结构也能看出层级关系,并可读写后直接使用
2.输入一行字符,分别统计出其中英文字母、空格、数字和其它字符的个数。
1.遍历出一个文件夹下的所有文件,并展示出层级关系,文件夹优先显示,最后以一定格式写入文本中
要求:尽可能简单、逻辑清晰
所选存储格式结构也能看出层级关系,并可读写后直接使用
2.输入一行字符,分别统计出其中英文字母、空格、数字和其它字符的个数。
package com.bawei;
public class T2 {
public static void main(String[] args) {
String str = "a12中国3@b&4语*言 3c";
String E1 = "[\u4e00-\u9fa5]";// 中文
String E2 = "[a-zA-Z]";// 英文
String E3 = "[0-9]";// 数字
String E4 = "\\s+";//空格
int chineseCount = 0;
int englishCount = 0;
int numberCount = 0;
int spaceCount = 0;
String temp;
for (int i = 0; i < str.length(); i++)
{
temp = String.valueOf(str.charAt(i));
if (temp.matches(E1))
{
chineseCount++;
}
if (temp.matches(E2))
{
englishCount++;
}
if (temp.matches(E3))
{
numberCount++;
}
if(temp.matches(E4)){
spaceCount++;
}
}
System.out.println("汉字数:" + chineseCount);
System.out.println("英文数:" + englishCount);
System.out.println("数字数:" + numberCount);
System.out.println("特殊字符:" + (str.length() - (chineseCount + englishCount + numberCount+spaceCount)));
System.out.println("空格"+spaceCount);
}
}
3.古典问题:有一对兔子,从出生后第3个月起每个月都生一对兔子,小兔子长到第三个月后每个月又生一对兔子,假如兔子都不死,问每个月的兔子总数为多少?
public class T2 {
public static void main(String[] args) {
String str = "a12中国3@b&4语*言 3c";
String E1 = "[\u4e00-\u9fa5]";// 中文
String E2 = "[a-zA-Z]";// 英文
String E3 = "[0-9]";// 数字
String E4 = "\\s+";//空格
int chineseCount = 0;
int englishCount = 0;
int numberCount = 0;
int spaceCount = 0;
String temp;
for (int i = 0; i < str.length(); i++)
{
temp = String.valueOf(str.charAt(i));
if (temp.matches(E1))
{
chineseCount++;
}
if (temp.matches(E2))
{
englishCount++;
}
if (temp.matches(E3))
{
numberCount++;
}
if(temp.matches(E4)){
spaceCount++;
}
}
System.out.println("汉字数:" + chineseCount);
System.out.println("英文数:" + englishCount);
System.out.println("数字数:" + numberCount);
System.out.println("特殊字符:" + (str.length() - (chineseCount + englishCount + numberCount+spaceCount)));
System.out.println("空格"+spaceCount);
}
}
3.古典问题:有一对兔子,从出生后第3个月起每个月都生一对兔子,小兔子长到第三个月后每个月又生一对兔子,假如兔子都不死,问每个月的兔子总数为多少?
package com.ba;
import java.util.Scanner;
public class T3 {
public static void main(String[] args) {
int month;
System.out.println("请输入养殖兔子的月份数:");
Scanner in = new Scanner(System.in);
month = in.nextInt();
long sum[]= new long[month] ;
if(month<2){
System.out.println("第"+month+"个月的兔子总数是:"+1);
return;
}
sum[0] = 1;
sum[1] = 1;
for(int i=2;i<month;i++){
sum[i] = sum[i-1]+sum[i-2];
}
System.out.println("第"+month+"个月的兔子总数是:"+sum[month-1]);
}
}
4.有1,2,3,4四个数字,能组成多少个互不相同且无重复数字的三位数?都是多少?
import java.util.Scanner;
public class T3 {
public static void main(String[] args) {
int month;
System.out.println("请输入养殖兔子的月份数:");
Scanner in = new Scanner(System.in);
month = in.nextInt();
long sum[]= new long[month] ;
if(month<2){
System.out.println("第"+month+"个月的兔子总数是:"+1);
return;
}
sum[0] = 1;
sum[1] = 1;
for(int i=2;i<month;i++){
sum[i] = sum[i-1]+sum[i-2];
}
System.out.println("第"+month+"个月的兔子总数是:"+sum[month-1]);
}
}
4.有1,2,3,4四个数字,能组成多少个互不相同且无重复数字的三位数?都是多少?
package com;
public class T4 {
public static void main(String[] args) {
//计数器变量
int count = 0;
/*
* 利用三重循环组合数字的百、十、个位
*/
//生成百位
for(int i = 1 ; i <= 4 ; i++) {
//生成十位
for(int j = 1 ; j <= 4 ; j++) {
//生成个位
for (int k = 1 ; k <= 4 ; k++) {
//确保i、j、k三位互不相同
if (i != j && j != k && i != k) {
//计数器累加
++count;
//控制台输出当前组合出的三位数
System.out.println("第" + count + "种组合方式:" + i + "" + j + "" + k);
}
}
}
}
//控制台输出统计信息
System.out.println(" 共计" + count + "种三位数组合方式。");
}
}
5.求1+2!+3!+...+20!的和
public class T4 {
public static void main(String[] args) {
//计数器变量
int count = 0;
/*
* 利用三重循环组合数字的百、十、个位
*/
//生成百位
for(int i = 1 ; i <= 4 ; i++) {
//生成十位
for(int j = 1 ; j <= 4 ; j++) {
//生成个位
for (int k = 1 ; k <= 4 ; k++) {
//确保i、j、k三位互不相同
if (i != j && j != k && i != k) {
//计数器累加
++count;
//控制台输出当前组合出的三位数
System.out.println("第" + count + "种组合方式:" + i + "" + j + "" + k);
}
}
}
}
//控制台输出统计信息
System.out.println(" 共计" + count + "种三位数组合方式。");
}
}
5.求1+2!+3!+...+20!的和
public class T5 {
public static void main(String[] args) {
long sum=0;
for(int i=1;i<=20;i++)//用于遍历1~20
{ long temp=1;
for(int j=1;j<=i;j++)//用于求i!;
{
temp=temp*j;
}
sum+=temp;
}
System.out.println(sum);
}
}
6.5位数中找出所有,判断它是不是回文数。即12321是回文数,个位与万位相同,十位与千位相同。
package com;
public class T6 {
public static void main(String[] args) {
for(int i=10000;i<=99999;i++){
if(isPalindrome(i)){
System.out.println(i);
}
}
}
public static boolean isPalindrome(int n){
String num = Integer.toString(n);
int len = num.length();
int half = len/2;
int is = 1;
for (int i = 0; i < half; i++){
if(num.charAt(i) != num.charAt(len-1-i)){
is = 0;
break;
}
}
if(is == 1){
return true;
}else{
return false;
}
}
}
public class T6 {
public static void main(String[] args) {
for(int i=10000;i<=99999;i++){
if(isPalindrome(i)){
System.out.println(i);
}
}
}
public static boolean isPalindrome(int n){
String num = Integer.toString(n);
int len = num.length();
int half = len/2;
int is = 1;
for (int i = 0; i < half; i++){
if(num.charAt(i) != num.charAt(len-1-i)){
is = 0;
break;
}
}
if(is == 1){
return true;
}else{
return false;
}
}
}
7.打印出杨辉三角形(要求打印出10行以上)
public class T7 {
public static void main(String[] args) {
int r = 9;
int a[][] = new int[r + 1][];
for (int i = 0; i <= r; i++) {
a[i] = new int[i + 1];
}
yanghui(a, r);
}
static void yanghui(int a[][], int r) {
for (int i = 0; i <= r; i++)
for (int j = 0; j <= a[i].length - 1; j++) {
if ( i==0||j == 0 || j == a[i].length - 1)
a[i][j] = 1;
else
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j <= a[i].length - 1; j++)
System.out.print(a[i][j] + " ");
System.out.println();
}
}
}
8.计算字符串中子串出现的次数
package com;
import java.util.Scanner;
public class T8 {
private static String str = "adgwqrfasdgstfqeragwwffasdf";
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("请输入子串");
String next = scanner.next();
int indexOf = str.indexOf(next);
int index = 0;
int count = 0;
int indexx = 0;
while((index = str.indexOf(next,indexx))!=-1){
indexx = index+next.length();
count++;
}
System.out.println("一共有"+count);
}
}
import java.util.Scanner;
public class T8 {
private static String str = "adgwqrfasdgstfqeragwwffasdf";
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("请输入子串");
String next = scanner.next();
int indexOf = str.indexOf(next);
int index = 0;
int count = 0;
int indexx = 0;
while((index = str.indexOf(next,indexx))!=-1){
indexx = index+next.length();
count++;
}
System.out.println("一共有"+count);
}
}
9.有n个人围成一圈,顺序排号。从第一个人开始报数(从1到3报数),凡报到3的人退出圈子,问最后留下的是原来第几号的那位。
package com;
import java.util.Scanner;
public class T9 {
public static void main(String[] args) {
System.out.println("输入一个整数:");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
if(n<1){System.out.println("输入不正确,请重新输入:");
n = sc.nextInt();
}
int[] a = new int[n];
for(int i=0;i<n;i++){
a[i]=i+1;
System.out.print(a[i]+" ");
}
System.out.println();
int i=0;
int quitnum=0;
int k=0;
while(quitnum<n-1){
if(a[i]!=0)k++;if(k==3){
a[i]=0;quitnum++;k=0;
}
i++;if(i==n)i=0;
}
for(i=0;i<n;i++){
if(a[i]!=0)
System.out.println(a[i]);}
}
}
import java.util.Scanner;
public class T9 {
public static void main(String[] args) {
System.out.println("输入一个整数:");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
if(n<1){System.out.println("输入不正确,请重新输入:");
n = sc.nextInt();
}
int[] a = new int[n];
for(int i=0;i<n;i++){
a[i]=i+1;
System.out.print(a[i]+" ");
}
System.out.println();
int i=0;
int quitnum=0;
int k=0;
while(quitnum<n-1){
if(a[i]!=0)k++;if(k==3){
a[i]=0;quitnum++;k=0;
}
i++;if(i==n)i=0;
}
for(i=0;i<n;i++){
if(a[i]!=0)
System.out.println(a[i]);}
}
}
10.求100之内的素数 //使用除sqrt(n)的方法求出的素数不包括2和3
package com;
import java.util.HashMap;
public class T10 {
public static void main(String[] args) {
// for (int n=1;n<=100;n++){
// //给b初始值true
// boolean b = true;
// //如果循环拿到的数n不等于1,就进入下面循环
// if (n != 1 ){
// //i从大于1的第一个数也就是2开始,一次循环到比这个数n本身小的最大的数
// //何为质数,除了1和他本身不能再被其他数整除。所以...这样循环
// for (int i = 2; i < n; i++){
// if (n % i == 0){//如果取余为0,也就是除了1和其本身有其他数可以乘除他,所以置为false
// b = false;
// //跳出当前循环,判断是否打印,并且到外面循环继续
// break;
// }
//
// }
// }
// //如果b为true打印下面的质数
// if (b){
// System.out.println(n + "是质数");
//
// }
// }
//
//
//
//
for(int i=2;i<100;i++){
int j;
for(j=2;j<=Math.sqrt(i);j++){
if(i%j==0)
break;
}
if(j>Math.sqrt(i))
System.out.println(i);
}
}
}
Day2
1.用数组自己写一个实现栈(Stack)
package com;
public class T21 {
private Object[] stack;
//这个不需要;
//private int top = 0; //初始化栈顶
//这个也不需要;
//写一个栈出来,最好是可以动态的,可以自己改变大小的,即数组的长度;
//private int size = 0; // 初始化大小
//元素个数;
private int size;
//默认长度为10;
public T21(){
this(10);
}
//也可以自己设置长度,即容量;
public T21(int len){
stack = new Object[len];
}
//返回元素个数;
public int size(){
return size;
}
//返回数组长度,即容量;
public int capacity(){
return stack.length;
}
//实现动态的数组;
// public void ensureCapacity(){
// if(size() == capacity()){
// Object[] newStack = new Object[size() * 3 / 2 + 1];
// System.arraycopy(stack, 0, newStack, 0, size());
// stack = newStack;
// }
// }
//
//入栈;
public void push(Object o){
size++;
// ensureCapacity();
stack[size - 1] = o;
}
/*
public void push(Object object) {
if (isFull()) {
System.out.println("栈满! 入栈失败");
}
stack[top++] = object;
}
*/
//判空;
public boolean isEmpty(){
return size == 0;
}
//出栈;
public Object pop(){
//首先要判空;
if(isEmpty()){
throw new ArrayIndexOutOfBoundsException("不能为空");
}
Object o = stack[--size];
stack[size] = null;
return o;
}
/*
// 出栈
public Object pop() {
Object object = stack[--top];
stack[top] = null;
return object;
}
*/
/*
// 计算栈当前大小
public int size() {
return top;
}
// 判断是否是空栈
public boolean isEmpey() {
return top == 0;
}
// 判断是否栈满
public boolean isFull() {
return top >= size;
}
public Stack(int size) {
this.size = size;
}
*/
public static void main(String[] args) {
T21 stack = new T21(3);
String[] data = new String[] { "a", "b", "c" };
for (int i = 0; i < data.length; i++) {
stack.push(data[i]);
System.out.println(data[i] + "");
}
System.out.println("***********");
while (!stack.isEmpty()) {
System.out.println(stack.pop() + "");
}
//}
}
}
public class T21 {
private Object[] stack;
//这个不需要;
//private int top = 0; //初始化栈顶
//这个也不需要;
//写一个栈出来,最好是可以动态的,可以自己改变大小的,即数组的长度;
//private int size = 0; // 初始化大小
//元素个数;
private int size;
//默认长度为10;
public T21(){
this(10);
}
//也可以自己设置长度,即容量;
public T21(int len){
stack = new Object[len];
}
//返回元素个数;
public int size(){
return size;
}
//返回数组长度,即容量;
public int capacity(){
return stack.length;
}
//实现动态的数组;
// public void ensureCapacity(){
// if(size() == capacity()){
// Object[] newStack = new Object[size() * 3 / 2 + 1];
// System.arraycopy(stack, 0, newStack, 0, size());
// stack = newStack;
// }
// }
//
//入栈;
public void push(Object o){
size++;
// ensureCapacity();
stack[size - 1] = o;
}
/*
public void push(Object object) {
if (isFull()) {
System.out.println("栈满! 入栈失败");
}
stack[top++] = object;
}
*/
//判空;
public boolean isEmpty(){
return size == 0;
}
//出栈;
public Object pop(){
//首先要判空;
if(isEmpty()){
throw new ArrayIndexOutOfBoundsException("不能为空");
}
Object o = stack[--size];
stack[size] = null;
return o;
}
/*
// 出栈
public Object pop() {
Object object = stack[--top];
stack[top] = null;
return object;
}
*/
/*
// 计算栈当前大小
public int size() {
return top;
}
// 判断是否是空栈
public boolean isEmpey() {
return top == 0;
}
// 判断是否栈满
public boolean isFull() {
return top >= size;
}
public Stack(int size) {
this.size = size;
}
*/
public static void main(String[] args) {
T21 stack = new T21(3);
String[] data = new String[] { "a", "b", "c" };
for (int i = 0; i < data.length; i++) {
stack.push(data[i]);
System.out.println(data[i] + "");
}
System.out.println("***********");
while (!stack.isEmpty()) {
System.out.println(stack.pop() + "");
}
//}
}
}
2.用数组自己写一个实现 队列 (Queue)
public class T22 {
public static void main(String[] args) {
ArrayQueue queue = new ArrayQueue(10);
System.out.println(queue.isEmpty());
for (int i = 0; i < 10; i++) {
queue.insert(i);
}
System.out.println(queue.isFull());
while (!queue.isEmpty()) {
System.out.println(queue.remove());
}
}
}
class ArrayQueue {
public int[] arrInt;// 内置数组
private int front;// 头指针
private int rear;// 尾指针
public ArrayQueue(int size) {
this.arrInt = new int[size];
front = 0;
rear = -1;
}
/**
* 判断队列是否为空
*
* @return
*/
public boolean isEmpty() {
return front == arrInt.length;
}
/**
* 判断队列是否已满
*
* @return
*/
public boolean isFull() {
return arrInt.length - 1 == rear;
}
/**
* 向队列的队尾插入一个元素
*/
public void insert(int item) {
if (isFull()) {
throw new RuntimeException("队列已满");
}
arrInt[++rear] = item;
}
/**
* 获得对头元素
*
* @return
*/
public int peekFront() {
return arrInt[front];
}
/**
* 获得队尾元素
*
* @return
*/
public int peekRear() {
return arrInt[rear];
}
/**
* 从队列的对头移除一个元素
*
* @return
*/
public int remove() {
if (isEmpty()) {
throw new RuntimeException("队列为空");
}
return arrInt[front++];
}
}
public static void main(String[] args) {
ArrayQueue queue = new ArrayQueue(10);
System.out.println(queue.isEmpty());
for (int i = 0; i < 10; i++) {
queue.insert(i);
}
System.out.println(queue.isFull());
while (!queue.isEmpty()) {
System.out.println(queue.remove());
}
}
}
class ArrayQueue {
public int[] arrInt;// 内置数组
private int front;// 头指针
private int rear;// 尾指针
public ArrayQueue(int size) {
this.arrInt = new int[size];
front = 0;
rear = -1;
}
/**
* 判断队列是否为空
*
* @return
*/
public boolean isEmpty() {
return front == arrInt.length;
}
/**
* 判断队列是否已满
*
* @return
*/
public boolean isFull() {
return arrInt.length - 1 == rear;
}
/**
* 向队列的队尾插入一个元素
*/
public void insert(int item) {
if (isFull()) {
throw new RuntimeException("队列已满");
}
arrInt[++rear] = item;
}
/**
* 获得对头元素
*
* @return
*/
public int peekFront() {
return arrInt[front];
}
/**
* 获得队尾元素
*
* @return
*/
public int peekRear() {
return arrInt[rear];
}
/**
* 从队列的对头移除一个元素
*
* @return
*/
public int remove() {
if (isEmpty()) {
throw new RuntimeException("队列为空");
}
return arrInt[front++];
}
}
3.自己写一个实现链表 (Linked List)
public class ListNode {
public Node head;
public Node current;
public ListNode(int pos){
head = new Node(pos);
current = head;
}
public void add(Node node){
current.next = node;
node.pre = current;
current = node;
}
}
public class Node {
public int data;
public Node pre;
public Node next;
public Node(int data){
this.data = data;
}
public void display(Node node){
System.out.println(node.data);
while(node.next!=null){
node = node.next;
System.out.println(node.data);
}
}
}
public class T25 {
public static void main(String[] args) {
ListNode listNode = new ListNode(0);
for (int i = 1; i < 10; i++) {
Node node = new Node(i);
listNode.add(node);
}
listNode.head.display(listNode.head);
}
}
4.用多线程实现将多个文件合并成一个
5.从
网址源码中找出所有的图片资源
import java.io.BufferedInputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.net.MalformedURLException;
import java.net.URL;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class T27 {
// 次方法会将图片下载到指定地点
// public void getHtmlPicture(String httpUrl) {
// URL url;
// BufferedInputStream in;
// FileOutputStream file;
// try {
// System.out.println("取网络图片");
// String fileName = httpUrl.substring(httpUrl.lastIndexOf("/"));
// String filePath = "F:\\FocuSimple\\test\\src\\pic\\";
// url = new URL(httpUrl);
//
// in = new BufferedInputStream(url.openStream());
//
// file = new FileOutputStream(new File(filePath+fileName));
// int t;
// while ((t = in.read()) != -1) {
// file.write(t);
// }
// file.close();
// in.close();
// System.out.println("图片获取成功");
// } catch (MalformedURLException e) {
// e.printStackTrace();
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// } catch (IOException e) {
// e.printStackTrace();
// }
// }
public static void main(String[] args) throws IOException {
String url = "http://www.ifeng.com/";
T27 gcp = new T27();
gcp.get(url);
}
public String getHtmlCode(String httpUrl) throws IOException {
String content ="";
URL uu = new URL(httpUrl); // 创建URL类对象
BufferedReader ii = new BufferedReader(new InputStreamReader(uu
.openStream())); // //使用openStream得到一输入流并由此构造一个BufferedReader对象
String input;
while ((input = ii.readLine()) != null) { // 建立读取循环,并判断是否有读取值
content += input;
}
ii.close();
return content;
}
public void get(String url) throws IOException {
String searchImgReg = "(?x)(src|SRC|background|BACKGROUND)=('|\")/?(([\\w-]+/)*([\\w-]+\\.(jpg|JPG|png|PNG|gif|GIF)))('|\")";
String searchImgReg2 = "(?x)(src|SRC|background|BACKGROUND)=('|\")(http://([\\w-]+\\.)+[\\w-]+(:[0-9]+)*(/[\\w-]+)*(/[\\w-]+\\.(jpg|JPG|png|PNG|gif|GIF)))('|\")";
String content = this.getHtmlCode(url);
// System.out.println(content);
Pattern pattern = Pattern.compile(searchImgReg);
Matcher matcher = pattern.matcher(content);
while (matcher.find()) {
System.out.println(matcher.group(3));
// this.getHtmlPicture(url+matcher.group(3));
System.out.println();
}
pattern = Pattern.compile(searchImgReg2);
matcher = pattern.matcher(content);
while (matcher.find()) {
System.out.println(matcher.group(3));
// this.getHtmlPicture(matcher.group(3));
System.out.println();
}
// searchImgReg =
// "(?x)(src|SRC|background|BACKGROUND)=('|\")/?(([\\w-]+/)*([\\w-]+\\.(jpg|JPG|png|PNG|gif|GIF)))('|\")";
}
}
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.net.MalformedURLException;
import java.net.URL;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class T27 {
// 次方法会将图片下载到指定地点
// public void getHtmlPicture(String httpUrl) {
// URL url;
// BufferedInputStream in;
// FileOutputStream file;
// try {
// System.out.println("取网络图片");
// String fileName = httpUrl.substring(httpUrl.lastIndexOf("/"));
// String filePath = "F:\\FocuSimple\\test\\src\\pic\\";
// url = new URL(httpUrl);
//
// in = new BufferedInputStream(url.openStream());
//
// file = new FileOutputStream(new File(filePath+fileName));
// int t;
// while ((t = in.read()) != -1) {
// file.write(t);
// }
// file.close();
// in.close();
// System.out.println("图片获取成功");
// } catch (MalformedURLException e) {
// e.printStackTrace();
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// } catch (IOException e) {
// e.printStackTrace();
// }
// }
public static void main(String[] args) throws IOException {
String url = "http://www.ifeng.com/";
T27 gcp = new T27();
gcp.get(url);
}
public String getHtmlCode(String httpUrl) throws IOException {
String content ="";
URL uu = new URL(httpUrl); // 创建URL类对象
BufferedReader ii = new BufferedReader(new InputStreamReader(uu
.openStream())); // //使用openStream得到一输入流并由此构造一个BufferedReader对象
String input;
while ((input = ii.readLine()) != null) { // 建立读取循环,并判断是否有读取值
content += input;
}
ii.close();
return content;
}
public void get(String url) throws IOException {
String searchImgReg = "(?x)(src|SRC|background|BACKGROUND)=('|\")/?(([\\w-]+/)*([\\w-]+\\.(jpg|JPG|png|PNG|gif|GIF)))('|\")";
String searchImgReg2 = "(?x)(src|SRC|background|BACKGROUND)=('|\")(http://([\\w-]+\\.)+[\\w-]+(:[0-9]+)*(/[\\w-]+)*(/[\\w-]+\\.(jpg|JPG|png|PNG|gif|GIF)))('|\")";
String content = this.getHtmlCode(url);
// System.out.println(content);
Pattern pattern = Pattern.compile(searchImgReg);
Matcher matcher = pattern.matcher(content);
while (matcher.find()) {
System.out.println(matcher.group(3));
// this.getHtmlPicture(url+matcher.group(3));
System.out.println();
}
pattern = Pattern.compile(searchImgReg2);
matcher = pattern.matcher(content);
while (matcher.find()) {
System.out.println(matcher.group(3));
// this.getHtmlPicture(matcher.group(3));
System.out.println();
}
// searchImgReg =
// "(?x)(src|SRC|background|BACKGROUND)=('|\")/?(([\\w-]+/)*([\\w-]+\\.(jpg|JPG|png|PNG|gif|GIF)))('|\")";
}
}
6.逆时针打印矩阵
顺时针
public class T28 {
public void printMatrixInCircle(int[][] array){
if(array == null)
return;
int start = 0;
while(array[0].length > start*2 && array.length >start*2){
printOneCircle(array,start);
start++;
}
}
private void printOneCircle(int[][] array,int start){
int columns = array[0].length;
int rows = array.length;
int endX = columns - 1 - start;
int endY = rows - 1 - start;
//从左到右打印一行
for(int i = start;i <= endX ;i++){
int number = array[start][i];
System.out.print(number+",");
}
//从上到下打印一列
if(start <endY){
for(int i = start +1;i<=endY;i++){
int number = array[i][endX];
System.out.print(number+",");
}
}
//从右到左打印一行
if(start < endX && start < endY){
for(int i = endX -1;i>=start;i--){
int number = array[endY][i];
System.out.print(number+",");
}
}
//从下到上打印一列
if(start <endY && start <endY -1){
for(int i =endY -1;i>=start+1;i--){
int number = array[i][start];
System.out.print(number+",");
}
}
}
public static void main(String[]args){
int[][] arr={{1,2,3,4},{5,6,7,8},{9,10,11,12}};
T28 test = new T28();
test.printMatrixInCircle(arr);
}
}
逆时针
public class T29 {
public static void main(String[] args) {
int [][]p={{1,12,11,10,},{2,13,16,9},{3,14,15,8},{4,5,6,7}};
int col=0,row=0;//当前的列和行
int m=0,n=3,k=0,j=3;//col:m->n row:k->j
int d=-1;//表示方向
while(true)
{
d=(d+1)%4;
switch (d)
{
case 0:
for(int i=m;i<=n;i++ )
{
System.out.print(p[i][row]+" ");
}
col=n;
k+=1;//防止重复
break;
case 1:
for(int i=k;i<=j;i++)
{
System.out.print(p[col][i]+" ");
}
row=j;
n-=1;//防止重复
break;
case 2:
for(int i=n;i>=m;i--)
{
System.out.print(p[i][row]+" ");
}
col=m;
j-=1;
break;
case 3:
for(int i=j;i>=k;i--)
{
System.out.print(p[col][i]+" ");
}
row=k;
m+=1;
break;
default:
break;
}
if(m==n&&k==j)
{
break;
}
}
}
}