記一次演算法練習

來源:互聯網
上載者:User
這是一個建立於 的文章,其中的資訊可能已經有所發展或是發生改變。

演算法一直是自己的弱項 通過演算法來學習語言吧

Java版:

/** * 演算法練習 1 * Created by Exile on 2017/5/25. * 1 N(N為偶數)個數字,把數字平分 N/2 組,使得每組的數字和相等。 */public class ArithmeticTest1 {//    題目1偶數個數組    public static void main(String[] args) {        int[] evenNumberArry = new int[]{1, 7, 2, 7, 6, 5, 2, 8, 3, 4};        int arryNum = evenNumberArry.length / 2;//        1 計算sum;        int sum = 0;        for (int i : evenNumberArry) {            sum = sum + i;        }//      2  計算出每組的和是多少        int arryMax = sum / arryNum;        for (int i = 0; i < evenNumberArry.length; i++) {            int value = arryMax - evenNumberArry[i];            int temp;//     假定一定會有一個與之組成一組            for (int j = i + 1; j < evenNumberArry.length; j++) {                if (evenNumberArry[j] == value) {                    temp = evenNumberArry[i + 1];                    evenNumberArry[i + 1] = value;                    evenNumberArry[j] = temp;                }            }        }        for (int i : evenNumberArry) {            System.out.println(i);        }    }}import java.util.ArrayList;import java.util.Random;/** * 演算法練習 2 * Created by Exile on 2017/5/25. * NxN的棋盤,每個格子可以放一個車,有M個車,問:每個車放完後,棋盤還剩多少格子是所有車攻擊範圍外? * 車可以重疊 */public class ArithmeticTest2 {    public static void main(String[] args) {//        n和m        int m = 3;        int n = 3;        ArrayList<Model> modelList = createModelList(m, n);        ArrayList<Model> manList = new ArrayList<>();        for (Model model : modelList) {            System.out.println("當前model:" + model.toString());        }//        方法1:從頭到尾擼一遍        for (int i = 0; i < n; i++) {            for (int j = 0; j < n; j++) {                manList.add(new Model(i, j));            }        }        System.out.println("篩選前:" + manList.size());//        速度太快的話會出問題        for (int i = 0; i < modelList.size(); i++) {            for (int j = 0; j < manList.size(); j++) {                if (!modelList.get(i).getAttackOutCall(manList.get(j))) {                    manList.remove(j);                }            }        }//        }        System.out.println("篩選後:" + manList.size());        for (Model model : manList) {            System.out.println(model.toString());        }    }    /**     * 根據輸入的mn產生對應個數的m對象     *     * @param m     * @param n     * @return     */    private static ArrayList<Model> createModelList(int m, int n) {        ArrayList<Model> models = new ArrayList<>();        for (int i = 0; i < m; i++) {            models.add(new Model(n));        }        return models;    }    public static class Model {        private int x;        private int y;        public Model(int n) {            Random random = new Random();            this.x = random.nextInt(n);            this.y = random.nextInt(n);        }        public Model(int x, int y) {            this.x = x;            this.y = y;        }        public int getX() {            return x;        }        public int getY() {            return y;        }        @Override        public String toString() {            return "Model{" +                    "x=" + x +                    ", y=" + y +                    '}';        }        public boolean getAttackOutCall(Model mainModel) {            if (this.getX() == mainModel.getX() || this.getY() == mainModel.getY()) {                return false;            }            return true;        }    }}

golang版:

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.