zoukankan      html  css  js  c++  java
  • 【自动化__持续集成】___java___excel__jxl写

    一、代码如下

    package com.wujianbo.five;
    
    import java.io.File;
    import java.io.IOException;
    
    import org.apache.poi.ddf.EscherColorRef.SysIndexSource;
    
    import jxl.Workbook;
    import jxl.write.Label;
    import jxl.write.WritableSheet;
    import jxl.write.WritableWorkbook;
    import jxl.write.WriteException;
    import jxl.write.biff.RowsExceededException;
    
    public class Demo06 {
    	public static void main(String[] args) {
    		Demo06 demo06= new Demo06();
    		demo06.writeExlByJxl();
    	}
    	
    	private void writeExlByJxl() {
    		// TODO Auto-generated method stub
    		WritableWorkbook book= null;
    		String[] info= {"序号", "学号", "姓名", "性别", "年龄", "学历", "学校"};
    		String fileName= System.getProperty("user.dir") + "\data\newStudents.xls";
    		try {
    			book= Workbook.createWorkbook(new File(fileName));
    			WritableSheet sheet= book.createSheet("NewStudents.xls", 0);
    			
    			for(int i=0; i<7; i++) {//添加表头
    				Label lable= new Label(i, 0, info[i]);
    				sheet.addCell(lable);
    			}
    			
    			sheet.addCell(new Label(0, 1, "1"));
    			sheet.addCell(new Label(1, 1, "WNC115"));
    			sheet.addCell(new Label(2, 1, "吴建波"));
    			sheet.addCell(new Label(3, 1, "男"));
    			sheet.addCell(new Label(4, 1, "28"));
    			sheet.addCell(new Label(5, 1, "本科"));
    			sheet.addCell(new Label(6, 1, "四川理工学院"));
    			
    			book.write();
    			book.close();
    		} catch (RowsExceededException e) {
    			// TODO Auto-generated catch block
    			e.printStackTrace();
    		} catch (WriteException e) {
    			// TODO Auto-generated catch block
    			e.printStackTrace();
    		} catch (IOException e) {
    			// TODO Auto-generated catch block
    			e.printStackTrace();
    		}
    		
    
    	}
    }
    
  • 相关阅读:
    LeetCode 654. 最大二叉树
    LeetCode 617. 合并二叉树
    LeetCode 234. 回文链表
    LeetCode 328. 奇偶链表
    LeetCode 24. 两两交换链表中的节点
    LeetCode 21. 合并两个有序链表
    LeetCode 876. 链表的中间结点
    顺序表的定义及其相关基本操作
    LeetCode 206. 反转链表
    LeetCode 111. 二叉树的最小深度
  • 原文地址:https://www.cnblogs.com/wujianbo123/p/7492188.html
Copyright © 2011-2022 走看看