- 博客(3)
- 收藏
- 关注
RSS订阅原创 LeetCode<Day2>PerfectNumber
自己的方法，超时了。public boolean perfect(int num){ List list = new ArrayList(); int sum = 0; for(int i = 1;i 2;i++) { if(num%i==0) list.add(i); } for(int s : list) {
2017-12-10 16:05:34
141
原创 LeetCode<Day2> Distribute Candies
package Day2;/** * Created by syw on 2017/12/10. *//**Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one
2017-12-10 15:17:43
128
1
原创 LeetCode<Day1> toHex
Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, two’s complement method is used.Note:All letters in hexadecimal (a-f) must be in lowercase.The hexade
2017-12-08 10:06:59
170
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人