Leetcode Scala 实现
---

1. 早期学习时写的
2. 后期工作时写的(不同时期写法不同)
3. 按数据结构划分

## 树

* [树的遍历](./src/main/scala/io/github/dreamylost/BTT.scala)
* [镜像二叉树非递归](./src/main/scala/io/github/dreamylost/Leetcode_Interview_27.scala)
* [翻转树](./src/main/scala/io/github/dreamylost/Leetcode_226_Tree.scala)
* [判断子树](./src/main/scala/io/github/dreamylost/Leetcode_572_Tree.scala)
* [合并二叉树](./src/main/scala/io/github/dreamylost/Leetcode_617_Tree.scala)
* [树的对称](./src/main/scala/io/github/dreamylost/Leetcode_101_Tree.scala)
* [树的高度](./src/main/scala/io/github/dreamylost/Leetcode_104_Tree.scala)
* [判断平衡树](./src/main/scala/io/github/dreamylost/Leetcode_110_Tree.scala)  
* [二叉树的层平均值](./src/main/scala/io/github/dreamylost/Leetcode_637_Tree.scala)  
* [找出二叉树中第二小的节点](./src/main/scala/io/github/dreamylost/Leetcode_671_Tree.scala)
* [N叉树的后序遍历](./src/main/scala/io/github/dreamylost/LeetCode_590.scala)
* [N叉树的前序遍历](./src/main/scala/io/github/dreamylost/Leetcode_589.scala)
* [N叉树的最大深度](./src/main/scala/io/github/dreamylost/Leetcode_559.scala)
* [二叉搜索树的最近公共祖先](./src/main/scala/io/github/dreamylost/Leetcode_235.scala)
* [统计左叶子节点的和](./src/main/scala/io/github/dreamylost/Leetcode_404_Tree.scala)
* [最小路径](./src/main/scala/io/github/dreamylost/Leetcode_111_Tree.scala)
* [判断路径和是否等于一个数](./src/main/scala/io/github/dreamylost/Leetcode_112_Tree.scala)
* [间隔遍历](./src/main/scala/io/github/dreamylost/Leetcode_337_Tree.scala)
* [两节点的最长路径](./src/main/scala/io/github/dreamylost/Leetcode_543_Tree.scala)
* [路径总和 III](./src/main/scala/io/github/dreamylost/Leetcode_437_Tree.scala)
* [二叉搜索树中的众数](./src/main/scala/io/github/dreamylost/Leetcode_501.scala)
* [二叉搜索树的最小绝对差](./src/main/scala/io/github/dreamylost/Leetcode_530.scala)
* [二叉树的堂兄弟节点](./src/main/scala/io/github/dreamylost/Leetcode_993.scala)
* [把二叉搜索树转换为累加树](./src/main/scala/io/github/dreamylost/Leetcode_538.scala)
* [二叉树的坡度](./src/main/scala/io/github/dreamylost/Leetcode_563.scala)
* [根据二叉树创建字符串](./src/main/scala/io/github/dreamylost/Leetcode_606.scala)
* [两数之和 IV - 输入 BST](./src/main/scala/io/github/dreamylost/Leetcode_653.scala)

## 链表

* [归并两个有序的链表](./src/main/scala/io/github/dreamylost/Leetcode_21_ListNode.scala)
* [从有序链表中删除重复节点](./src/main/scala/io/github/dreamylost/Leetcode_83_ListNode.scala)
* [相交链表](./src/main/scala/io/github/dreamylost/Leetcode_160_ListNode.scala)
* [链表反转](./src/main/scala/io/github/dreamylost/Leetcode_206_ListNode.scala)

## 其他

* [爬楼梯](./src/main/scala/io/github/dreamylost/Leetcode_70.scala)
* [最大面值（LintCode 669）](./src/main/scala/io/github/dreamylost/CoinChange.scala)
* [比特位计数](./src/main/scala/io/github/dreamylost/CountBits.scala)
* [打家劫舍](./src/main/scala/io/github/dreamylost/Leetcdoe_198.scala)
* [反转数字](./src/main/scala/io/github/dreamylost/Leetcode_7.scala)
* [求S中符合J的元素的个数](./src/main/scala/io/github/dreamylost/Leetcode_771.scala)
* [IP 地址无效化](./src/main/scala/io/github/dreamylost/Leetcode_1108.scala)  
* [访问所有点的最小时间](./src/main/scala/io/github/dreamylost/Leetcode_1266.scala)  
* [整数的各位积和之差](./src/main/scala/io/github/dreamylost/Leetcode_1281.scala)
* [统计位数为偶数的数字](./src/main/scala/io/github/dreamylost/Leetcode_1295.scala)  
* [将每个元素替换为右侧最大元素](./src/main/scala/io/github/dreamylost/Leetcode_1299.scala)  
* [统计有序矩阵中的负数](./src/main/scala/io/github/dreamylost/Leetcode_1351.scala)  
* [两数之和](./src/main/scala/io/github/dreamylost/Leetcode_1_Array.scala)  
* [两数相加](./src/main/scala/io/github/dreamylost/Leetcode_2_ListNode.scala)  
* [删除排序数组中的重复项II](./src/main/scala/io/github/dreamylost/Leetcode_80_Array.scala)
* [搜索二维矩阵II](./src/main/scala/io/github/dreamylost/Leetcode_240_Array.scala)
* [找出数组中重复的数](./src/main/scala/io/github/dreamylost/Leetcode_287_Array.scala)
* [有序矩阵的 Kth Element](./src/main/scala/io/github/dreamylost/Leetcode_378_Array.scala)
* [有序矩阵的 Kth Element by Queue](./src/main/scala/io/github/dreamylost/Leetcode_378_Array_Queue.scala)
* [嵌套数组](./src/main/scala/io/github/dreamylost/Leetcode_565_Array.scala)
* [数组相邻差值的个数](./src/main/scala/io/github/dreamylost/Leetcode_667_Array.scala)
* [数组的度](./src/main/scala/io/github/dreamylost/Leetcode_697_Array.scala)
* [对角元素相等的矩阵](./src/main/scala/io/github/dreamylost/Leetcode_766_Array.scala)
* [最多能完成排序的块](./src/main/scala/io/github/dreamylost/Leetcode_769_Array.scala)  
* [猜数字](./src/main/scala/io/github/dreamylost/Leetcode_LCP_1_1.scala)
* [股票的最大利润](./src/main/scala/io/github/dreamylost/Leetcode_121.scala)
* [子数组之和的最大值](./src/main/scala/io/github/dreamylost/Leetcode_53.scala)
* [使用最小花费爬楼梯](./src/main/scala/io/github/dreamylost/Leetcode_746.scala)  
* [最短路径](./src/main/scala/io/github/dreamylost/Leetcode_64.scala)
* [区域和检索](./src/main/scala/io/github/dreamylost/NumArray.scala)
* [机器人能否返回原点](./src/main/scala/io/github/dreamylost/Leetcode_657.scala)