Array解题方法小结

2017-08-24 • LeetCode swipe log • 3661 次阅读 • No one has discussed it yet • 164Like

LeetCode上的相关题目(easy)

26, 27, 35, 48, 88

118, 119, 121, 122, 136, 162, 167, 169

217, 219, 243, 268, 283

303, 349, 350

414, 448, 453, 485, 496

532, 561, 566, 575, 581, 594

605, 624, 628

Medium题目

49, 287

常用方法

new ArrayList(Arrays.asList(array))
Integer.MAX_VALUE
Integer.MIN_VALUE
Math.abs()
.clone()

技巧

如果需要记录数量的时候，无法使用hashset，可以用hashmap -> k=n, v=count
使用hashmap计数的时候时候，切忌加上<Integer,Integer>
碰到遍历找位置的，可以使用插入法，改变array的数值

需要Review的题目

This site Original article All followed" Attribution—NonCommercial—ShareAlike 4.0 (CC BY-NC-SA 4.0) ”。 Please keep the following marks for sharing and interpretation:

Original author: Jake Tao Source: 「Array解题方法小结」

array 刷题小结

Praise 164

0 0 164

About the Author

Jake Tao

642 Article

332 Comment

Jake is from Hangzhou. He has studied and worked in the United States for decades, and has worked in many technology companies, financial institutions and entrepreneurial teams. He has founded projects such as Pingjing Network, HelloGWU, North American Student Network, Neighborhood, and Foreign Land. With international team management experience and senior technical research and development background, he is keen on creating and practicing from zero to one. If you resonate, welcome to communicate!