codetalks-new

func levelOrderTraversal(root:TreeNode) -> [[Int]]{
    var outerArr = [[Int]]()
    var levelNode = [TreeNode]()
    var nextLevelNode = [TreeNode]()
    levelNode.append(root)
    var innerArr = [Int]()
    
    while !levelNode.isEmpty{
        let currentNode = levelNode.removeAtIndex(0)
        innerArr.append(currentNode.val)

codetalks-new

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

codetalks-new

#!/bin/bash
echo mkdir 
rmdir -rf appIcons
mkdir appIcons
echo resize icon $1
img=$1
#IFS='.' read -ra fcomps <<< "$img"
#echo fcomps is ${fcomps[@]}
#compsCount=${#fcomps[@]}
#echo comps count $compsCount

codetalks-new

func maxDepth_r(root:TreeNode?) -> Int{
    if root == nil{
        return 0
    }
    
    if root?.left == nil && root?.right == nil{
        return 1
    }
    
    let rightDepth = maxDepth_r(root?.left)

codetalks-new

func postorderTraversal(root:TreeNode) -> [Int]{
    var arr = [Int]()
    var nodes = [TreeNode]()
    var middleNodes = [TreeNode]()
    var current :TreeNode? = root
    var lastMiddleNode : TreeNode?
    while current != nil{
        let cur = current!
        if cur.left == nil && cur.right == nil{
            // 没有子节点,访问此节点

codetalks-new

func preorderTraversal(root:TreeNode) -> [Int]{
    var arr = [Int]()
   
    var nodes = [TreeNode]()
    nodes.append(root)
    while !nodes.isEmpty{
        let current = removeLast(&nodes)
        arr.append(current.val)
        if let right = current.right{
            nodes.append(right)

codetalks-new

var cache = [Int:Int]()
func numTrees(n:Int) -> Int{
    if n < 2{
        return 1
    }
    if n == 2{
        return 2
    }
    

codetalks-new

// https://leetcode.com/problems/binary-tree-inorder-traversal/
class TreeNode{
    let val:Int
    var left:TreeNode?
    var right:TreeNode?
    init(val:Int){
        self.val = val
    }
}

codetalks-new

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

codetalks-new

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {