需求分析：能实现人机交替落子，当行，列或对角有连续三个相同一方棋时，则判定一方胜利，若无此情形为和局。
leetcode-hard-array-238. Product of Array Except Self-NO
leetcode-hard-array-54. Spiral Matrix-NO
leetcode-easy-trees-98. Validate Binary Search Tree-NO
leetcode-easy-trees-108. Convert Sorted Array to Binary Search Tree
leetcode-easy-trees-102. Binary Tree Level Order Traversal-YES
leetcode-easy-trees-101. Symmetric Tree-YES
leetcode-easy-trees-Maximum Depth of Binary Tree
leetcode-easy-others-20 Valid Parentheses
深度学习变革视觉计算总结（CCF-GAIR）