摘要:
package my; import java.util.Arrays; public class MissNumberSolution { public int missingNumber(int[] nums) { Arrays.sort(nums); if (nums[nums.length- 阅读全文
摘要:
package my; public class IsUglySolution { boolean isUgly(int num){ if(num == 0){ return false; } while(num !=1){ if(num % 2 == 0){ num /= 2 ; continue 阅读全文
摘要:
class Solution { public void moveZeroes(int[] nums) { int result=0 ; for(int i =0 ;i < nums.length;i ++){ if(nums[i]!= 0){ nums[result++] = nums[i]; } 阅读全文