架构设计之路
BeArchitect
成为一名牛B的全栈架构师
展开
-
ARTS第三周
Algorithm 用栈来实现队列 // 原题地址 https://leetcode.com/problems/implement-queue-using-stacks/description/ // 原题描述 /** Implement the following operations of a queue using stacks. push(x) -- Push element x to ...原创 2019-07-07 20:29:16 · 327 阅读 · 0 评论 -
ARTS第四周
Algorithm // 原题地址https://leetcode-cn.com/problems/add-two-numbers/description/?utm_source=LCUS&utm_medium=ip_redirect&utm_campaign=transfer2china /** You are given two non-empty linked lists ...原创 2019-07-14 21:45:29 · 128 阅读 · 0 评论 -
ARTS第二周
Algorithm 单链表的反转 // Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL /** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; ...原创 2019-06-30 16:26:43 · 214 阅读 · 0 评论 -
ARTS第七周
Algorithm // https://leetcode-cn.com/problems/maximum-depth-of-binary-tree/description/?utm_source=LCUS&utm_medium=ip_redirect&utm_campaign=transfer2china /** 给定一个二叉树,找出其最大深度。 二叉树的深度为根节点到最远叶子...原创 2019-08-25 18:16:44 · 266 阅读 · 0 评论 -
ARTS第八周
Algorithm // https://leetcode.com/problems/path-sum-iii/description/ function helper(root, acc, target, hashmap) { if (root === null) return 0; let count = 0; acc += root.val; if (acc === targ...原创 2019-09-16 18:50:56 · 209 阅读 · 0 评论 -
ARTS第九周
Algorithm // https://leetcode.com/problems/contains-duplicate-ii/description/ /** * Example 1: * * * Input: nums = [1,2,3,1], k = 3 * Output: true * * * * Example 2: * * * Input: nums = [1,...原创 2019-09-17 10:49:39 · 273 阅读 · 0 评论