|
⇤ ← Revision 1 as of 2004-08-10 22:04:12
Size: 699
Comment:
|
Size: 707
Comment: 版式
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 14: | Line 14: |
| Line 15: | Line 16: |
| Line 19: | Line 21: |
| Line 20: | Line 23: |
具有索引的中文文章模板 TableOfContents
1.9 Finding the Intersection of Two Dictionaries
发现两个字典的交集
Credit: Andy McKay, Chris Perkins, Sami Hangaslammi
1.9.1 Problem
问题
Given two dictionaries, you need to find the set of keys that are in both dictionaries.
给出两个字典，你需要找到在两个字典里都有的键的集合。
1.9.2 Solution
%POST http://wiki.woodpecker.org.cn/moin.cgi/PyCkBk_2d1_2d9 HTTP/1.0
Accept: image/gif, image/x-xbitmap, image/jpeg, image/pjpeg, application/x-shockwave-flash, */*
Referer: http://wiki.woodpecker.org.cn/moin.cgi/PyCkBk_2d1_2d9?action=edit