01 2019 档案
摘要:第一,一定要多读代码。 尤其是语言的标准库代码,知名的开源项目代码,或者其它超高使用频率的代码,提高自己的代码品味。 第二,一定要多写代码。 尤其是写可读性高、可维护性好的代码,尽量寻找有经验的工程师帮助自己 Review 代码,提高自己的代码能力和质量。 第三,一定要多看、多想,看经典的系统设计,
阅读全文
摘要:前言 本文用于记录整个demo学习、开发的过程 一、Key Point 1.使用主流框架:mvp+kotlin+rxjava2+room+retrofit2 2.简结的ui/ux 3.第三方api的使用 https://www.sojson.com/blog/305.html 4.定期自动更新天气数
阅读全文
摘要:1.通过线上项目学习框架设计 2.通过leetcode学习算法和掌握语言 3.mvp, rxjava2, android architecture components, flutter,
阅读全文
摘要:/** * 105. Construct Binary Tree from Preorder and Inorder Traversal * * https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/description/ * * Given preorder and ino...
阅读全文
摘要:/** * 349. Intersection of Two Arrays * https://leetcode.com/problems/intersection-of-two-arrays/description/ Example 1:Input: nums1 = [1,2,2,1], nums2 = [2,2]Output: [2]Example 2:Input: nums1 = [4,9...
阅读全文
摘要:如: let a = 1,b=2; a的二进制: 0001 b的二进制: 0010 利用异或运算的规律:两个操作数的位中,相同返回0,不同相返回1 a = a^b;//now a = 0011 b = b^a;//a: 0011, b:0010, now b:0001 a = a^b;//b:000
阅读全文
摘要:/** * 76. Minimum Window Substring * https://leetcode.com/problems/minimum-window-substring/description/ * * Given a string S and a string T, find the
阅读全文
摘要:/** 965. Univalued Binary Tree * https://leetcode.com/problems/univalued-binary-tree/description/ 965. Univalued Binary Tree * https://leetcode.com/pr
阅读全文
摘要:/** * Lock by Leetcode * 369. Plus One Linked List * https://www.lintcode.com/problem/plus-one-linked-list/description * * Given a non-negative intege
阅读全文
摘要:/** 143. Reorder List https://leetcode.com/problems/reorder-list/description/ * @param {ListNode} head * @return {void} Do not return anything, modify
阅读全文
摘要:/** * Binary Tree Inorder Traversal * @param {TreeNode} root * @return {number[]} * Inorder: left->root->right */ /** * Binary Tree Inorder Traversal
阅读全文
摘要:/** * 144. Binary Tree Preorder Traversal * https://leetcode.com/problems/binary-tree-preorder-traversal/description/ * @param {TreeNode} root * @retu
阅读全文
摘要:/** * 145. Binary Tree Postorder Traversal * https://leetcode.com/problems/binary-tree-postorder-traversal/description/ * @param {TreeNode} root * @re
阅读全文