没有前段经验, 没做过小程序, 没画原型没有设计没有排期没有… 就是好奇瞎玩能做成什么样, 进度随缘 Day1 总结 1. 用原生TabBar(底部导航)在app.json设...
![240](https://cdn2.jianshu.io/assets/default_avatar/7-0993d41a595d6ab6ef17b19496eb2f21.jpg?imageMogr2/auto-orient/strip|imageView2/1/w/240/h/240)
没有前段经验, 没做过小程序, 没画原型没有设计没有排期没有… 就是好奇瞎玩能做成什么样, 进度随缘 Day1 总结 1. 用原生TabBar(底部导航)在app.json设...
问题描述 Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key...
问题描述 The thief has found himself a new place for his thievery again. There is only one ...
题目描述 Invert a binary tree.**注:返回tree的镜像树 思路1 用recursive的方法,先判断if (root)然后交换其左右两个node的位置...
问题描述 You are a professional robber planning to rob houses along a street. Each house ha...
##问题描述 Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements...
总算觉得Comp arch的TA没白当hhh 问题描述 The Hamming distance between two integers is the number of ...
问题描述 Alice and Bob have candy bars of different sizes: A[i] is the size of the i-th bar...
问题描述 Given a binary tree, you need to compute the length of the diameter of the tree. T...
问题描述 Given two non-empty binary trees s and t, check whether tree t has exactly the sam...
问题描述 Given two binary trees and imagine that when you put one of them to cover the othe...
问题描述 Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (repre...
问题描述 Given a non-empty array of integers, return the k most frequent elements. Example ...
问题描述 Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULLOutput: 5->4->3->...
问题描述 Given a non-empty array containing only positive integers, find if the array can b...
问题描述 Suppose you have a random list of people standing in a queue. Each person is descr...
问题描述 Given a string s consists of upper/lower-case alphabets and empty space characters...
问题描述 Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ ...
问题描述 Given an input string (s) and a pattern (p), implement regular expression matching...
问题描述 Given an array nums of n integers where n > 1, return an array output such that o...