Code Hunt 题解 09-12 （Java)

继续题解~~ 这之后的代码基本都是自己写的了（没地方参考了)。。。。。。所以代码质量可能有所下降T_T

Sector 09 1D arrays

09.01
public class Program {
    public static int Puzzle(int[] list, int i) {
        return list[i];
    }
}

09.02
public class Program {
    public static String Puzzle(String[] list) {
        return list[0]+list[list.length-1];
    }
}

09.03 <只有一星，据说用new ArrayList(list).contains() 可以一句过，但是我做的时候他的编译器找不到contains()方法>
public class Program {
    public static Boolean Puzzle(int[] list, int i) {
        for (int j=0;j<list.length;j++) if (list[j]==i) return true;
        return false;
    }
}

09.04 <注意导入Arrays类>
import java.util.Arrays;
public class Program {
    public static int[] Puzzle(int x) {
        int[] s=new int[10];
        Arrays.fill(s,x);
        return s;
    }
}

09.05
public class Program {
    public static int[] Puzzle(int n) {
        int[]s=new int[n];
        for (int i=0;i<n;i++) s[i]=i;
        return s;
    }
}

09.06
public class Program {
    public static Boolean[] Puzzle() {
         Boolean[] s={true,true,true,true,true,true,true,true,true,true} ;
         return s;
    }
}

09.07 <这里不能像上次一样用Arrays.fill()方法了，只有一星，求高手解答>
import java.util.*;
public class Program {
    public static String[] Puzzle(String s) {
        String[] s1=new String[(s.length())];
        for (int i=0;i<s.length();i++) s1[i]=s.charAt(i)+"";
        return s1;
    }
}

09.08
public class Program {
    public static int[] Puzzle(int i) {
        int[] s= new int[i+1];
        for (int j=0;j<=i;j++) s[j]=i-j;
        return s;
    }
}

09.09
public class Program {
    public static int[] Puzzle(int[] numbers) {
        for (int i=0;i<numbers.length; i++) numbers[i]=-numbers[i];
        return numbers;
    }
}

09.10
public class Program {
    public static int[] Puzzle(int[] numbers) {
        for (int i=0;i<numbers.length/2;i++)
        {
            int temp=numbers[i]; numbers[i]=numbers[numbers.length-1-i];
            numbers[numbers.length-1-i]=temp;
        }
        return numbers;
    }
}

09.11 <题上说要求用字符数组完成，但是无论是用循环交换还是像下面这样的代码都只有一星>
public class Program {
    public static String Puzzle(String s) {
        return new StringBuffer(s).reverse().toString();
    }
}

09.12
public class Program {
    public static int[] Puzzle(int[] numbers, int amount) {
        int[] s=new int[numbers.length];
        for (int i=0;i<numbers.length;i++)
        s[(i+amount)%numbers.length]=numbers[i];
        return s;
    }
}

09.13
public class Program {
    public static int[] Puzzle(int[] numbers, int i, int j) {
        int temp=numbers[i];
        numbers[i]=numbers[j];
        numbers[j]=temp;
        return numbers;
    }
}

09.14
public class Program {
    public static int[] Puzzle(int[] a, int [] b) {
        int [] ans=new int[a.length>b.length? a.length:b.length];
        for (int i=0;i<a.length;i++) ans[i]=a[i];
        for (int i=0;i<b.length;i++) ans[i]+=b[i];
        return ans;
    }
}

Sector 10 Jagged arrays

10.01
public class Program {
    public static int Puzzle(int[][] list, int i, int j) {
        return list[i][j];
    }
}

10.02 <??为什么这么短还只有两星>
public class Program {
    public static int[][] Puzzle() {
        return new int[5][5];
    }
}

10.03 <只有一星>
import java.util.Arrays;
public class Program {
    public static int[][] Puzzle(int length, int x) {
         int [][]s = new int[length][length];
         for (int i=0;i<length;i++) Arrays.fill(s[i],x);
         return s;
    }
}

10.04
import java.util.Arrays;
public class Program {
    public static int[][] Puzzle(int length, int x) {
         int [][]s = new int[length][length];
         for (int i=0;i<length;i++) Arrays.fill(s[i],x);
         return s;
    }
}

10.05
public class Program {
    public static int Puzzle(int[][] input, int i) {
        int count=0;
        for (int k=0;k<input.length;k++)
        {
            for (int j=0;j<input[0].length;j++)
            {
                if (input[k][j]==i) count++;
            }
        }
        return count;
    }
}

10.06
public class Program {
    public static int Puzzle(int[][] input) {
        int max=input[0][0];
        for (int i=0;i<input.length;i++)
            for (int j=0;j<input[0].length;j++)
            {
                if (input[i][j]>max) max=input[i][j];
            }
        return max;
    }
}

10.07
public class Program {
    public static int[] Puzzle(int[][] input) {
        int max=Integer.MIN_VALUE,number=-1;
        for(int i=0;i<input.length;i++)
        {
            int sum=0;
            for (int j=0;j<input[i].length;j++) sum+=input[i][j];
            if (sum>max)
            {
                max=sum; number=i;
            }
        }
        return input[number];
    }
}

10.08
public class Program {
    public static int Puzzle(int[][] input) {
        int max=Integer.MIN_VALUE;
        for (int j=0;j<input[0].length;j++)
        {
            int sum=0;
            for (int i=0;i<input.length;i++) sum+=input[i][j];
            if (sum>max) max=sum;
        }
        return max;

    }
}

Sector 11 Arrays 2

11.01
public class Program {
    public static int[] Puzzle(int[] a, int [] b) {
        int max=a.length>b.length? a.length:b.length;
        int[] c=new int[max];
        for (int i=0;i<a.length;i++) c[i]=a[i];
        for (int i=0;i<b.length;i++) c[i]=(int)(Math.abs(c[i]-b[i]));
        return c;
    }
}

11.02
public class Program {
    public static String[] Puzzle(String[] a, int amount) {
        String[] ans=new String[a.length*amount];
        for (int i=0;i<a.length;i++)
        for (int j=0;j<amount;j++) ans[i*amount+j]=a[i];
        return ans;

    }
}

11.03 <求主对角线与副对角线和是否相等>
public class Program {
    public static Boolean Puzzle(int[][] input) {

        int sum1=0,sum2=0;
        for (int i=0;i<input.length;i++)
        {
            sum1+=input[i][i]; sum2+=input[i][input.length-1-i];
        }
        return sum1==sum2;
    }
}

11.04
public class Program {
    public static int[] Puzzle(int[] list, int modBy) {
        for (int i=0;i<list.length;i++) list[i]%=modBy;
        return list;
    }
}

11.05
public class Program {
    public static String[] Puzzle(String[] list) {
        String[] s=new String[(list.length+1)/2];
        for (int i=0;i<list.length;i++) s[i/2]+=list[i];
        return s;
    }
}

11.06
public class Program {
    public static String[] Puzzle(int[] grades, int A, int B, int C, int D) {
        String[]ans=new String[grades.length];
        for (int i=0;i<grades.length;i++)
        {
            if (grades[i]>=A) ans[i]="A";
            else if (grades[i]>=B) ans[i]="B";
            else if (grades[i]>=C) ans[i]="C";
            else if (grades[i]>=D) ans[i]="D";
            else ans[i]="E";
        }
        return ans;
    }
}

11.07
public class Program {
    public static String[][] Puzzle(String[][] input) {
        for (int i=0;i<input.length-1;i++)
            for (int j=i+1;j<input.length;j++)
        {
            String temp=input[i][j]; input[i][j]=input[j][i];
            input[j][i]=temp;
        }
        return input;
    }
}

Sector 12 Search sort

12.01
public class Program {
    public static int Puzzle(int[] numbers, int x) {
        int count=0;
        for (int i=0;i<numbers.length;i++) if (numbers[i]==x) count++;
        return count;
    }
}

12.02
public class Program {
    public static int Puzzle(String[] words, String s) {
        int count=0;
        for (int i=0;i<words.length;i++) if (s.equals(words[i])) count++;
        return count;
    }
}

12.03
public class Program {
    public static int Puzzle(int[] numbers, int x) {
        for (int i=0;i<numbers.length;i++)
            if (x==numbers[i]) return i;
        return -1;
    }
}

12.04
public class Program {
    public static int Puzzle(int[] numbers, int x) {
        for (int i=numbers.length-1;i>=0;i--)
            if (x==numbers[i]) return i;
        return -1;
    }
}

12.05
public class Program {
    public static int[] Puzzle(int[] numbers, int x) {
        int count=0;
        int []s=new int[numbers.length];
        for (int i=0;i<numbers.length;i++) 
            if (x==numbers[i]) s[count++]=i;
        int []ans=new int [count];
        for (int i=0;i<count;i++) ans[i]=s[i];
        return ans;
    }
}

12.06
public class Program {
    public static int[] Puzzle(int[] numbers, int x, int y) {
        for (int i=0;i<numbers.length;i++) if (x==numbers[i]) numbers[i]=y;
        return numbers;
    }
}

12.07 <只有两星>
public class Program {
    public static int[][] Puzzle(int[] numbers, int x) {
        int count=0;
        int [][]s =new int[numbers.length*numbers.length][2];
        for (int i=0;i<numbers.length-1;i++)
        for (int j=i+1;j<numbers.length;j++)
        if (numbers[i]+numbers[j]==x)
        {
            s[count][0]=i; s[count++][1]=j;
        }
        int [][]ans=new int[count][2];
        for (int i=0;i<count;i++)
        {
            ans[i][0]=s[i][0]; ans[i][1]=s[i][1];
        }
        return ans;
    }
}

12.08
public class Program {
    public static int Puzzle(int[] numbers) {
        int sum=0;
        for (int i=0;i<numbers.length;i++) sum+=numbers[i];
        int now=0;
        for (int i=0;i<numbers.length;i++)
        {
            now+=numbers[i];
            if (now*2==sum) return i;
        }
        return -1;
    }
}

12.09
public class Program {
    public static Boolean Puzzle(int[] numbers) {
        for (int i=0;i<numbers.length-1;i++)
            if (numbers[i]>numbers[i+1]) return false;
        return true;
    }
}

12.10
public class Program {
    public static Boolean Puzzle(String[] words) {
        for (int i=0;i<words.length-1;i++)
            if (words[i].compareTo(words[i+1])>0) return false;
        return true;
    }
}

12.11 <一步解决>
import java.util.Arrays;
public class Program {
    public static int[] Puzzle(int[] a) {
        Arrays.sort(a);
        return a;
    }
}

12.12 <字符串是不能直接用sort()的，想重载运算但是java.util.collections 不能用,求大神。。。只有一星>
public class Program {
    public static String[] Puzzle(String[] a) {
        for (int i=0;i<a.length;i++)
        {
            int flag=0;
            for (int j=a.length-1;j>i;j--)
            if (a[j].compareTo(a[j-1])<0)
            {
                String tem=a[j]; a[j]=a[j-1]; a[j-1]=tem; flag=1;
            }
            if (flag==0) break;
        }
        return a;
    }
}

大家加油！