a = [1, 2, 3]b = a是將b指向 和a共用的 [1,2,3]如果b用copy a list value成一個獨立的list，請用b = list(a) 或是用copy.deepcopy():
copy.deepcopy():import copy
new_list = copy.deepcopy(old_list) 詳參： 2011/05/06 15:38莊瑞萌
2011/04/14 10:06編譯莊蕙嘉／綜合報導
2011/03/06 02:15林佳誼
2011/02/27 13:03NewTalk 新頭殼
2011/02/17 13:39
2011/02/01 10:48
2011/01/06 09:45記者詹建富／台北報導
2011/01/04 14:13
2010/12/24 12:05
&#xxx;, where xxx is the decimal code of the character. Char Decimal Hex Entity Char Decimal Hex Entity
Reference Reference
NUL 0 0 SOH 1 1
STX 2 2 ETX 3 3
EOT 4 4 ENQ 5 5
ACK 6 6 BEL 7 7
BS 8 8 HT 9 9
NL 10 a VT 11 b
NP 12 c CR 13 d
SO 14 e SI 15 f
DLE 16 10 DC1 17 11
DC2 18 12 DC3 19 13
DC4 20 14 NAK 21 15
SYN 22 16 ETB 23 17
CAN 24 18 EM 25 19
SUB 26 1a ESC 27 1b
FS 28 1c GS 29 1d
RS 30 1e US 31 1f
SP 32 20 ! 33 21
" 34 22 " # 35 23
$ 36 24 % 37 25
& 38 26 & ' 39 27
( 40 28 ) 41 29
* 42 2a + 43 2b
, 44 2c - 45 2d
. 46 2e / 47 2f
0 48 30 1 49 31
2 50 32 3 51 33
4 52 34 5 53 35
6 54 36 7 55 37
8 56 38 9 57 39
: 58 3a ; 59 3b
< 60 3c < = 61 3d
> 62 3e > ? 63 3f
@ 64 40 A 65 41
B 66 42 C 67 43
D 68 44 E 69 45
F 70 46 G 71 47
H 72 48 I 73 49
J 74 4a K 75 4b
L 76 4c M 77 4d
N 78 4e O 79 4f
P 80 50 Q 81 51
R 82 52 S 83 53
T 84 54 U 85 55
V 86 56 W 87 57
X 88 58 Y 89 59
Z 90 5a [ 91 5b
\ 92 5c ] 93 5d
^ 94 5e _ 95 5f
` 96 60 a 97 61
b 98 62 c 99 63
d 100 64 e 101 65
f 102 66 g 103 67
h 104 68 i 105 69
j 106 6a k 107 6b
l 108 6c m 109 6d
n 110 6e o 111 6f
p 112 70 q 113 71
r 114 72 s 115 73
t 116 74 u 117 75
v 118 76 w 119 77
x 120 78 y 121 79
z 122 7a { 123 7b
| 124 7c } 125 7d
~ 126 7e DEL 127 7f
-- 128 80 -- 129 81
-- 130 82 -- 131 83
-- 132 84 -- 133 85
-- 134 86 -- 135 87
-- 136 88 -- 137 89
-- 138 8a -- 139 8b
-- 140 8c -- 141 8d
-- 142 8e -- 143 8f
-- 144 90 -- 145 91
-- 146 92 -- 147 93
-- 148 94 -- 149 95
-- 150 96 -- 151 97
-- 152 98 -- 153 99
-- 154 9a -- 155 9b
-- 156 9c -- 157 9d
-- 158 9e -- 159 9f
� 160 a0 � 161 a1 ¡
� 162 a2 ¢ � 163 a3 £
� 164 a4 ¤ � 165 a5 ¥
� 166 a6 ¦ � 167 a7 §
� 168 a8 ¨ � 169 a9 ©
� 170 aa ª � 171 ab «
� 172 ac ¬ � 173 ad
� 174 ae ® � 175 af ¯
� 176 b0 ° � 177 b1 ±
� 178 b2 ² � 179 b3 ³
� 180 b4 ´ � 181 b5 µ
� 182 b6 ¶ � 183 b7 ·
� 184 b8 ¸ � 185 b9 ¹
� 186 ba º � 187 bb »
� 188 bc ¼ � 189 bd ½
� 190 be ¾ � 191 bf ¿
� 192 c0 À � 193 c1 Á
� 194 c2 Â � 195 c3 Ã
� 196 c4 Ä � 197 c5 Å
� 198 c6 Æ � 199 c7 Ç
� 200 c8 È � 201 c9 É
� 202 ca Ê � 203 cb Ë
� 204 cc Ì � 205 cd Í
� 206 ce Î � 207 cf Ï
� 208 d0 Ð � 209 d1 Ñ
� 210 d2 Ò � 211 d3 Ó
� 212 d4 Ô � 213 d5 Õ
� 214 d6 Ö � 215 d7 ×
� 216 d8 Ø � 217 d9 Ù
� 218 da Ú � 219 db Û
� 220 dc Ü � 221 dd Ý
� 222 de Þ � 223 df ß
� 224 e0 à � 225 e1 á
� 226 e2 â � 227 e3 ã
� 228 e4 ä � 229 e5 å
� 230 e6 æ � 231 e7 ç
� 232 e8 è � 233 e9 é
� 234 ea ê � 235 eb ë
� 236 ec ì � 237 ed í
� 238 ee î � 239 ef ï
� 240 f0 ð � 241 f1 ñ
� 242 f2 ò � 243 f3 ó
� 244 f4 ô � 245 f5 õ
� 246 f6 ö � 247 f7 ÷
� 248 f8 ø � 249 f9 ù
� 250 fa ú � 251 fb û
� 252 fc ü � 253 fd ý
� 254 fe þ � 255 ff ÿ
2010/12/09 22:02生活中心／綜合報導
void testQuickSort() { static int a[8]={4,7,8,5,2,6,3,1}; quickSort(a,0,7); for(int i=0;i<8;i++) printf("%d",a[i]); } static void quickSort (int a[], int lo, int hi) { // lo is the lower index, hi is the upper index // of the region of array a that is to be sorted int i=lo, j=hi, h; int x=a[(lo+hi)/2]; // partition do { while (a[i]<x) i++; while (a[j]>x) j--; if (i<=j) { h=a[i]; a[i]=a[j]; a[j]=h; i++; j--; } } while (i<=j); // recursion if (lo<j) quickSort(a, lo, j); if (i<hi) quickSort(a, i, hi); }
#includeNotice how "setw(n)" controls the field width, so each number is printed inside a field that stays the same width regardless of the width of the number itself.#include iomanip using namespace std; int main() { const int max = 12; const int width = 6; for(int row = 1;row <= max;row++) { for(int col = 1;col <= max;col++) { cout << setw(width) << row * col; } cout << endl; } return 0; }
2010/12/03 08:35