原创 leetcode 輸出 楊輝三角形 或者 帕斯卡三角形
Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each numb
原创 leetcode Symmetric Tree 鏡面對稱二叉樹
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary
原创 leetcode 二叉樹最低深度
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the
原创 leetcode 二叉樹最深深度
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the r
原创 leetcode 二叉樹是否平衡 Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as:
原创 leetcode Count and Say
The count-and-say sequence is the sequence of integers with the first five terms as following: 1. 1 2. 11 3.
原创 leetcode Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Input: 1->1->2 O
原创 Unity3d 粒子系統屬性面板介紹
原文鏈接:https://blog.csdn.net/qq_40343451/article/details/81938322
原创 leetcode 爬樓梯 Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In ho
原创 leetcode 獲取平方根 sqrt($x)
Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer.
原创 leetcode 66. Plus One 加一 數字相加
Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored s
原创 leetcode 數組加int
989. Add to Array-Form of Integer Easy 14127FavoriteShare For a non-negative integer X, the array-form of X is an array
原创 leetcode 二進制加法
Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains on
原创 leetcode Maximum Subarray 加最大的子序串
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum an
原创 leetcode Implement strStr() 字符串是否存在
Return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. Example 1: In