zoukankan      html  css  js  c++  java
  • Python prettytable的使用方法

    Python prettytable的使用方法

    prettytable可以整齐地输出一个表格信息:

    +-----------+------+------------+-----------------+
    | City name | Area | Population | Annual Rainfall |
    +-----------+------+------------+-----------------+
    | Adelaide  | 1295 |  1158259   |      600.5      |
    | Brisbane  | 5905 |  1857594   |      1146.4     |
    | Darwin    | 112  |   120900   |      1714.7     |
    | Hobart    | 1357 |   205556   |      619.5      |
    | Sydney    | 2058 |  4336374   |      1214.8     |
    | Melbourne | 1566 |  3806092   |      646.9      |
    | Perth     | 5386 |  1554769   |      869.4      |
    +-----------+------+------------+-----------------+
    

    代码:

    	from prettytable import PrettyTable
    	x = PrettyTable(["City name", "Area", "Population", "Annual Rainfall"])
    	x.align["City name"] = "l" # Left align city names  
    	x.padding_width = 1 # One space between column edges and contents (default)  
    	x.add_row(["Adelaide",1295, 1158259, 600.5])  
    	x.add_row(["Brisbane",5905, 1857594, 1146.4])  
    	x.add_row(["Darwin", 112, 120900, 1714.7])  
    	x.add_row(["Hobart", 1357, 205556, 619.5])  
    	x.add_row(["Sydney", 2058, 4336374, 1214.8])  
    	x.add_row(["Melbourne", 1566, 3806092, 646.9])  
    	x.add_row(["Perth", 5386, 1554769, 869.4])  
    	print x
    
  • 相关阅读:
    背包九讲
    最小生成树 prime + 队列优化
    最小生成树 prime poj1287
    树状数组--转载
    O(n)求1-n的逆元
    数据结构--线段树
    博弈
    RMQ 数据结构
    BZOJ3687 计算子集和的异或和
    Intel Code Challenge Final Round (Div. 1 + Div. 2, Combined)D Dense Subsequence
  • 原文地址:https://www.cnblogs.com/Xjng/p/4902484.html
Copyright © 2011-2022 走看看