Commit139b225

committed

2017 8.30

1 parentc271662 commit139b225Copy full SHA for 139b225

File tree

+16

-1

lines changed

+16

-1

lines changed

Lines changed: 16 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1445,14 +1445,18 @@ def coinChange(values,valuesCounts,money,coinsUsed):`
`1445`	`1445`	```
`1446`	`1446`
`1447`	`1447`	`思路:http://blog.csdn.net/wdxin1322/article/details/9501163`
	`1448`	`+`
`1448`	`1449`	`方法:http://www.cnblogs.com/ChenxofHit/archive/2011/03/18/1988431.html`
`1449`	`1450`
`1450`	`1451`	`##13 广度遍历和深度遍历二叉树`
`1451`	`1452`
`1452`	`1453`	`给定一个数组，构建二叉树，并且按层次打印这个二叉树`
`1453`	`1454`
`1454`		-```python
	`1455`	`+`
`1455`	`1456`	`##14 二叉树节点`
	`1457`	`+`
	`1458`	+```python
	`1459`	`+`
`1456`	`1460`	`classNode(object):`
`1457`	`1461`	`def__init__(self,data,left=None,right=None):`
`1458`	`1462`	`self.data= data`
`@@ -1461,7 +1465,12 @@ class Node(object):`
`1461`	`1465`
`1462`	`1466`	`tree= Node(1, Node(3, Node(7, Node(0)), Node(6)), Node(2, Node(5), Node(4)))`
`1463`	`1467`
	`1468`	+```
	`1469`	`+`
`1464`	`1470`	`##15 层次遍历`
	`1471`	`+`
	`1472`	+```python
	`1473`	`+`
`1465`	`1474`	`deflookup(root):`
`1466`	`1475`	`stack= [root]`
`1467`	`1476`	`while stack:`
`@@ -1471,7 +1480,13 @@ def lookup(root):`
`1471`	`1480`	`stack.append(current.left)`
`1472`	`1481`	`if current.right:`
`1473`	`1482`	`stack.append(current.right)`
	`1483`	`+`
	`1484`	+```
	`1485`	`+`
`1474`	`1486`	`##16 深度遍历`
	`1487`	`+`
	`1488`	+```python
	`1489`	`+`
`1475`	`1490`	`defdeep(root):`
`1476`	`1491`	`ifnot root:`
`1477`	`1492`	`return`

Comments

(0)