![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法练习
JavenJiang
用博客记录自己编程技术成长的每一天
展开
-
leetcode:Move Zeros
public class Solution { public static void moveZeroes(int[] nums) { int n=0; for(int i=0;i<nums.length;i++) { if(nums[i]!=0) { n++;原创 2016-04-06 08:23:03 · 298 阅读 · 0 评论 -
leetcode:Valid Anagram
public class Solution { public boolean isAnagram(String s, String t) { char[] a=s.toCharArray(); Arrays.sort(a); String n=String.valueOf(a); char[] b=t.toCharArray();原创 2016-04-06 14:25:50 · 342 阅读 · 0 评论 -
leetcode:Contains Duplicate
public class Solution { public boolean containsDuplicate(int[] nums) { if(nums.length==0) return false; HashSet h=new HashSet(); for(int i:nums) if( h.add(i)==fa原创 2016-04-08 19:56:28 · 333 阅读 · 0 评论 -
leetcode: Majority Element
public class Solution { public int majorityElement(int[] nums) { int target=0,time=0; for(int i:nums) { if(time==0) { target=i; time=1;原创 2016-04-08 20:32:18 · 266 阅读 · 0 评论