• 无聊的编程题


    这种情况要排除1的情况

    package auth.test;
    
    import java.util.ArrayList;
    import java.util.Collections;
    import java.util.HashMap;
    import java.util.HashSet;
    import java.util.Iterator;
    import java.util.List;
    import java.util.Map;
    import java.util.Set;
    
    
    public class TEST1 {
    	public static void main(String[] args) {
    		int arr[]={1,5,2,3,7,9,2,6};
    		List<Integer> list=new ArrayList<Integer>();
    		for(int i=0;i<arr.length;i++){
    			list.add(arr[i]);
    		}
    		//排序
    		Collections.sort(list);
    		//去重
    		Set<Integer> set=new HashSet<Integer>();
    		List<Integer> newList = new ArrayList<Integer>();    
    		for (Iterator<Integer> iter = list.iterator(); iter.hasNext();)    
    		{    
    			Object element = iter.next();    
    			if (set.add((Integer) element)) {
    				newList.add((Integer) element);    
    			}
    		}    
    		list.clear();    
    		list.addAll(newList);  
    		for(int i=0;i<list.size();i++){
    			System.out.println(list.get(i));
    		}
    		//List放HashMap里面
    		Map<String,String> map=new HashMap<String,String>();
    		for(int i=0;i<list.size();i++){
    			map.put(String.valueOf(list.get(i)),String.valueOf(list.get(i)));
    		}
    		
    		int intail=list.get(0);
    		//存放计数
    		List<Integer> l=new ArrayList<Integer>();
    		for(int m=1;m<100;m++){
    			int num=0;
    			int n=0;
    			for(int i=0;i<100;i++){
    				num=intail+m+num;
    				System.out.println("num:"+num);
    				if(map.containsKey(String.valueOf(num))){
    					n++;
    				}
    			}
    			l.add(n);
    		}
    		Collections.sort(l);
    		for(int i=0;i<l.size();i++){
    			System.out.println(l.get(i));
    		}
    		System.out.println("结果值"+l.get(l.size()-1));
    	}
    }




    package auth.test;
    
    import java.util.ArrayList;
    import java.util.Collections;
    import java.util.HashSet;
    import java.util.Iterator;
    import java.util.List;
    import java.util.Set;
    
    public class TEST2 {
    	public static void main(String[] args) {
    		int n=13;
    		int m=getNum(n);
    		System.out.println("结果值:"+m);
    	}
    		
    		public static int getNum(int n){
    		List<Integer> list=new ArrayList<Integer>();
    		for(int m=0;m<20;m++){
    			for(int i=2;i<m;i++){
    				int num=i*i;
    				if(m%num==0){
    					if(list.contains(m)){
    						for(int t=0;t<list.size();t++){
    							if(list.get(t)==m){
    								list.remove(t);
    							}
    						}
    					}
    					break;
    				}
    			list.add(m);
    		}
    	}
    		list.add(2);
    		list.add(1);
    		//去重
    		Set<Integer> set=new HashSet<Integer>();
    		List<Integer> newList = new ArrayList<Integer>();    
    		for (Iterator<Integer> iter = list.iterator(); iter.hasNext();)    
    		{    
    			Object element = iter.next();    
    			if (set.add((Integer) element)) {
    				newList.add((Integer) element);    
    			}
    		}    
    		list.clear();    
    		list.addAll(newList); 
    		//排序
    		Collections.sort(list);
    		for(int i=0;i<list.size();i++){
    			System.out.println(list.get(i));
    		}
    		if(list.size()>n){
    			return list.get(n);
    		}else{
    			return list.get(list.size()-1);
    		}
    		
    	}
    }





  • 相关阅读:
    C# lock
    read appSettings in configuration file by XElement with xmlns
    get all sites under IIS
    Cross-site scripting(XSS)
    Do not throw System.Exception, System.SystemException, System.NullReferenceException, or System.IndexOutOfRangeException intentionally from your own source code
    C++ 算法
    C++ 数据结构概念
    C++ STL 常用算术和生成算法
    C++ STL 常用拷贝和替换算法
    C++ STL 常用排序算法
  • 原文地址:https://www.cnblogs.com/JAYIT/p/6947073.html
Copyright © 2020-2023  润新知