原创 LeetCode-Easy刷題(32) Linked List Cycle

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 給定一個鏈表

原创 Gitlab 開發流程涉及命令梳理

簡介: gitlab是一種流行的代碼管理工具,主要的開發方式爲分支開發合併.下面介紹下我走通流程涉及的命令點.1. 配置SSH 需要在自己目錄下生成公鑰和私鑰.網上很多https://blog.csdn.net/xyzchenx

原创 LeetCode-Easy刷題(27) Pascal's Triangle

Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1],

原创 LeetCode-Easy刷題(20) Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binar

原创 LeetCode-Easy刷題(31) Single Number

Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm sho

原创 LeetCode-Easy刷題(19) Same Tree

Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the sam

原创 LeetCode-Easy刷題(18) Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: You may assume tha

原创 LeetCode-Easy刷題(25) Minimum Depth of Binary Tree

Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the

原创 LeetCode-Easy刷題(21) Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the

原创 LeetCode-Easy刷題(23) Convert Sorted Array to Binary Search Tree

Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 將有序數組轉化爲二分查找樹 publ

原创 LeetCode-Easy刷題(22)Binary Tree Level Order Traversal II

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level b