leetcode
ArchurSpace
这个作者很懒,什么都没留下…
展开
-
136. 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 me原创 2016-08-31 22:21:42 · 320 阅读 · 0 评论 -
137. 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 ex原创 2016-08-31 21:55:13 · 311 阅读 · 0 评论 -
最大公约数
package methods;/** * Created by archur on 2016/10/14. */ public class DivisorGetter { /** * 穷举法 */ public static int getDivisor1(int num1, int num2) { int bigNum = num1 >= n原创 2016-10-17 15:57:52 · 271 阅读 · 0 评论 -
机试题记录-整数分解和阿拉伯数字转中文读法
整数分解 public static void main(String[] args) { resolve(4,1); } public static List<Integer> res = new ArrayList<>(); public static void resolve(int n, int start){ ...原创 2019-07-13 11:42:21 · 326 阅读 · 0 评论