酷狗java2018秋招笔试题目，谢谢大家捧场

第二题答案不对，应该是D，任意一颗二叉树中度为0的节点总比度为2的节点个数多1，这里叶子结点的数量为2，也即是度为零的节点数为2，那么度为2的节点数只有1个，其余的都是度为1的节点。

import java.util.Scanner; public class sdas { public static void main(String[] args) { System.out.print("请输入要买的橘子数:"); Scanner io=new Scanner(System.in); int w=io.nextInt(); if(w%2==0){ int p=w/6;//袋数为6的数量 int z=w%6;//袋数6个装完剩下的即  装8个的袋子 p=p-z;//装6个的袋子数 while(p>=4){ z=z+3; p=p-4; } System.out.println(p+z); } else{ System.out.println(-1); } } }

来不及了，马上交卷了，擦看见，真坑，说实话，我还怀疑这个答案呢，感觉有些题不对

import java.util.Scanner; public class Test12 { public static void main(String[] args) { Scanner sc =new Scanner(System.in); int n = sc.nextInt(); int res,yushu,res6=0,m; while (n>0){ if (n%8==0){ res=n/8; System.out.println(res); return; } else { yushu = n % 8; res = n / 8; if(yushu % 6 == 0){ res6 =yushu/6; }else { while (yushu % 6 != 0){ m=n-(res-1)*8; yushu = m % 6; res=res-1; if(res<1){ System.out.println(-1); return ; } res6=m/6; } } System.out.println(res+res6); return; } } } }

求酷狗内推

好未来的20个选择，和酷狗一样，今天下午的😌

或许可以把num = num >> 1注释掉 然后把EIGHT_BAG = 8改成4， 把SiX_BAG = 6改成3 还有一些判断我不知道是不是必须的，引用一句名言：I don't know why, but this works! public class BuySomeOrange {     private static final int EIGHT_BAG = 8;     private static final int SiX_BAG = 6;     //use to identify how many eight and six are we using     //1 for eight, 0 for six     private static StringBuilder strBuilder = new StringBuilder("");     public static void main(String[] args) {         System.out.println(packOrangeFOrE(14) + "\t" + strBuilder.toString());     }          public static int packOrangeFOrE(int num) {         int sixBag, eightBag;         if(num % 2 != 0 || num <= 0)             return -1; //        num = num >> 1;         //first we would like to use the bigger bag         if(num % EIGHT_BAG == 0) {             eightBag = num / EIGHT_BAG;             zeroOrOnes(eightBag, 0);             return eightBag;         }else if(num % SiX_BAG == 0) {             //we would like to use the bigger bag             int sixEvenDistribute = num % EIGHT_BAG;             if(sixEvenDistribute % SiX_BAG == 0) {                 eightBag = num / EIGHT_BAG;                 sixBag = (num % EIGHT_BAG) / SiX_BAG;                 zeroOrOnes(eightBag, sixBag);                 return eightBag + sixBag;             }             //if ends here we just use 6 bag             sixBag = num / SiX_BAG;             zeroOrOnes(0, sixBag);             return sixBag;         }else if(num % EIGHT_BAG % SiX_BAG == 0) {             eightBag = num / EIGHT_BAG;             sixBag = (num % EIGHT_BAG) / SiX_BAG;             zeroOrOnes(eightBag, sixBag);             return eightBag +sixBag;         }else {             return -1;         }              }          private static void zeroOrOnes(int eightNum, int sixNum) {         for(int i = 0; i < eightNum; i++)             strBuilder.append("1");         for(int i = 0; i < sixNum; i++)             strBuilder.append("0");     } }

#include <cstdio> #include <cstring> #include <algorithm> using namespace std; int dp[101]; void init() {     memset(dp, 0, sizeof(dp));     int i = 9;     dp[6] = 1;     dp[8] = 1;     while(i <= 100)     {         if(dp[i - 6] > 0 && dp[i - 8] > 0)         {             dp[i] = min(dp[i - 6] + 1, dp[i - 8] + 1);         }         else if(dp[i - 6] > 0 || dp[i - 8] > 0)         {             dp[i] = dp[i - 6] > 0 ? dp[i - 6] + 1 : dp[i - 8] + 1;         }         i++;     } } int main() {     init();     int n;     while(~scanf("%d", &n))     {         printf("%d\n", dp[n]);     }     return 0; }

对吗，老哥，我多选题抄的你的答案啊

暴力求解： import java.util.Scanner; public class Test2{     public static void main(String agrs[]){         Scanner sc=new Scanner(System.in);         int n=sc.nextInt();         sc.close();         int x8=n/8;         int x6=n/6;         boolean flag=false;         for(int i=x8;i>=0;i--){             for(int j=0;j<=x6;j++){                 if((i*8+j*6)==n){                     System.out.println(i+j);                     flag=true;                     break;                 }             }             if(flag){                 break;             }         }         if(!flag)             System.out.println(-1);     } }

import java.util.Scanner; /**  *          小明去附近的水果店买橙子，水果商贩只提供整袋购买，有每袋6个和每袋8个的包装（包装不可拆分）。     可是小明只想购买恰好n个橙子，并且尽量少的袋数方便携带。如果不能购买恰好n个橙子，小明将不会购买。请根据此实现一个程序，要求：     输入一个整数n，表示小明想要购买n（1≤n≤100）个橙子     输出一个整数表示最少需要购买的袋数，如果不能买恰好n个橙子则输出-1     例如，输入20，输出3。  *  */ public class Test8 {     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int n = in.nextInt();         System.out.println(fun(n));     }          public static int fun(int n){         int res8 = n / 8;         int yushu = n % 8;         if(yushu == 0){             return res8;         }else{             while(res8 >= 0){                 if(yushu % 6 == 0){                     return res8+(yushu/6);                 }                 res8--;                 yushu += 8;             }             return -1;         }     } }

//树 左节点-6 右节点-8 #include <cstdio> #include <iostream> using namespace std; int tree[1000]; void fun(int n, int v) {     tree[2 * n] = v - 6;     tree[2 * n + 1] = v - 8;     if (tree[2 * n] > 0) fun(2 * n, v - 6);     if (tree[2 * n + 1] > 0) fun(2 * n + 1, v - 8); } int depth(int n) {     int ans = 0;     while (n != 1) {         n = n / 2;         ans++;     }     return ans; } int main() {     int n;     scanf("%d", &n);     int ans = 100000;     for (int i = 0; i < 1000; i++) tree[i] = -1;     tree[1] = n;     fun(1, n);     for (int i = 0; i < 1000; i++) {         if (tree[i] == 0) {             int tmp = depth(i);             if (tmp < ans) ans = tmp;         }     }     if (ans == 100000) ans = -1;     printf("%d\n", ans);     return 0; }

public static void main(String[] args) {         Scanner scanner = new Scanner(System.in);         int n = scanner.nextInt();         int i = n % 8;         if (i == 1 || i == 3 || i == 5 || i == 7) {             System.out.print(-1);         } else {             int j = n / 8;             while ((n - j * 8) % 6 != 0) {                 j--;             }             System.out.print(j + (n - j * 8) / 6);         }     }

mmp、、、

这是官方的答案？

不是不让传播吗？人家都写的保密，这样。。。

今天晚上的考的还是同一套题啊

多选题第三题的D不见了。

求多选题第一题的解答。

对于第6题，知乎网友的回答。