- 博客(4)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 Leetcode 238 Product of Array Except Self
题目： Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and in O(n)
2016-04-28 10:11:49
288
原创 Leetcode 136 SingleNumber
题目： 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 ext
2016-04-28 08:50:02
275
原创 Leetcode 283. Move Zeroes
题目： Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling your
2016-04-27 14:28:59
203
原创 Leetcode 258 Add Digits
public int addDigits(int num) { int result = num; Integer I_num = new Integer(num); String s = I_num.toString(); int len = s.length(); while(len>1){
2016-04-27 11:38:53
255
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人