LC-stack-queue 232. 用栈实现队列最初写的 1234567891011121314151617181920212223242526272829303132333435363738val stack = Stack<Int>() // 元素栈val tempStack = Stack<Int>() // 备用fun push(x: Int) { stack.push(x 2022-07-03 DataStructure #LEETCODE
PerformanceJank https://www.bilibili.com/video/BV1T44y1u7g6 6:41 数据到屏幕,渲染机制 https://www.jianshu.com/p/8a296b75d95f https://juejin.cn/post/6844904062610046990 https://testerhome.com/topics/29134 卡顿优化https://blog.csd 2022-06-09 #Performance
PerformanceANR ANR https://play.google.com/console/u/0/developers/5313279702199603526/app/4975846927718251228/vitals/crashes?installedFrom=PLAY_STORE&days=30 https://developer.android.com/topic/performance/vital 2022-06-07 #Performance
PerformanceMemory https://developer.android.com/studio/profile/memory-profiler?hl=zh-cn 查看内存限制,下面的命令不起作用 1234adb shell cat/system/build.prop // 需要root权限,没用adb shell getprop // 可以看全部的adb shell getprop dalvik.vm.h 2022-06-07 #Performance
LC-string 344. 反转字符串双指针 123456789101112131415fun reverseString(s: CharArray): Unit { var left = 0 var right = s.size - 1 while (left < right) { swap(s, left, right) left++ 2022-06-05 DataStructure #LEETCODE
location Location Permission changesBackground locationThe background location precision is the same as the foreground location precision, which depends on the location permissions that your app declares. user 2022-05-24
LC-hash 242. 有效的字母异位词1234567891011121314151617fun isAnagram(s: String, t: String): Boolean { val record = IntArray(26) // 存整数,就用整形数 s.toCharArray().forEachIndexed { _, char -> record 2022-05-21 DataStructure #LEETCODE
fastjson https://zonghaishang.gitbooks.io/fastjson-source-code-analysis/content/ FastJson为什么快https://tobebetterjavaer.com/gongju/fastjson.html#_05%E3%80%81%E6%88%91%E4%B8%BA%E4%BB%80%E4%B9%88%E5%BF%AB 为什么要进行序 2022-05-13
JVM-VALUE-DELIVER 再做leetcode时也遇到了,java时引用传递还是值传递的问题,这方面 指针就很清楚, https://segmentfault.com/a/1190000016773324 这里讲解很清楚 1. 基本数据类型的存储: A. 基本数据类型的局部变量 B. 基本数据类型的成员变量 C. 基本数据类型的静态变量 2. 引用数据类型的存储 A.基本数据类型的局部变量 定义基本数据类型的局 2022-05-05 JAVA #JVM
LC-LinkedList https://leetcode.cn/circle/discuss/jq9Zke/ 203. 移除链表元素迭代法12345678910111213fun removeElements(head: ListNode?, target: Int): ListNode? { val dummyHead = ListNode() dummyHead.next = head v 2022-05-04 #LEETCODE