编程基础-复杂度
小郭不背锅
这个作者很懒,什么都没留下…
展开
-
reverse-integer
题目描述 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here are some good questions to ask before codi...原创 2018-05-03 14:23:06 · 225 阅读 · 0 评论 -
single-number
Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra...原创 2018-05-04 09:57:59 · 293 阅读 · 0 评论 -
single-number-ii
Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using...原创 2018-05-04 10:34:41 · 344 阅读 · 0 评论