新鲜电面

zlzlm2005 · 发表于 10-5-2015 06:15 PM

亲！马上注册或者登录会查看更多内容！

您需要登录才可以下载或查看，没有帐号？立即注册

x

pocket gem 二轮电面：

sort color , color 给的 object 问了一些小的细节，
class PGObject{
  char c;
  public PGObject(char input){
this.c = input;
  }
  public PGObject(){

  }
}

class Solution {

  public static void main(String[] args) {
PGObject p1 = new PGObject('g');
PGObject p2 = new PGObject('r');
PGObject p3 = new PGObject('g');
PGObject p4 = new PGObject('b');
PGObject p5 = new PGObject('g');
PGObject p6 = new PGObject('b');

PGObject[] res = new PGObject[]{p1,p2,p3,p4,p5,p6};

sortColor(res);

for(int i = 0; i< res.length ; i++){
   System.out.println("");
   System.out.println(res【i】.c);
}

  }

  public static void sortColor(PGObject[] colors ){
int begin = 0;
int end = colors.length - 1;
int current = 0;
while(current <= end){
   if(colors[current].c == 'r'){
      swap(colors,begin,current);
      current++;
      begin++;
   }else if(colors[current].c == 'g'){
      current++;
   }else if(colors[current].c == 'b'){
      swap(colors, current, end);
      end--;
   }
}
  }

  private static void swap(PGObject[] a,int i, int j){
PGObject temp = new PGObject();
temp = a【i】;
a【i】 = a[j];
a[j] = temp;

  }

}

第二题是 Given a node in the BST, find the next largest node in the BST,
代码
class Node{
  Node left;
  Node right;
  Node parent;
}

class Solution{
  public static void main(String[] args){

  }
  public Node nextLargestNode(Node t){
Node temp = t;
if(t.right != null){
   return getLeftMost(t.right);
}
while(t!= null && t.parent != null){
   Node parent = t.parent;
   if(parent.left == t){
      return parent;
   }
   t=t.parent;
}

return temp;
  }
  private static Node getLeftMost(Node root){
Node p = root;
while(p.left != null){
   p = p.left;
}
return p;
  }
}

Sophia · 发表于 10-5-2015 10:08 PM

感谢您的面经分享~~~祝您面试工作学习顺利~~~大米满满送上~~~

anduiandui · 发表于 10-5-2015 11:42 PM

马上也要面 pocket gem! 感谢面经啊大赞，bless楼主！

		自动登录	找回密码
密码			立即注册

[PoketGem] 新鲜电面

亲！马上注册或者登录会查看更多内容！

评分

活跃会员

热心会员

优秀版主