沒(méi)有前段經(jīng)驗(yàn), 沒(méi)做過(guò)小程序, 沒(méi)畫(huà)原型沒(méi)有設(shè)計(jì)沒(méi)有排期沒(méi)有… 就是好奇瞎玩能做成什么樣, 進(jìn)度隨緣 Day1 總結(jié) 1. 用原生TabBar(...
問(wèn)題描述 Given a Binary Search Tree (BST), convert it to a Greater Tree such...
問(wèn)題描述 The thief has found himself a new place for his thievery again. The...
題目描述 Invert a binary tree.**注:返回tree的鏡像樹(shù) 思路1 用recursive的方法,先判斷if (root)然...
問(wèn)題描述 You are a professional robber planning to rob houses along a street...
##問(wèn)題描述 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array)...
總算覺(jué)得Comp arch的TA沒(méi)白當(dāng)hhh 問(wèn)題描述 The Hamming distance between two integers is...
問(wèn)題描述 Alice and Bob have candy bars of different sizes: A[i] is the size ...
問(wèn)題描述 Given a binary tree, you need to compute the length of the diameter...