高盛 java_高盛oa

最新推荐文章于 2024-05-01 13:55:57 发布

KK大魔王

最新推荐文章于 2024-05-01 13:55:57 发布

阅读量114

点赞数

文章标签：高盛 java

本文链接：https://blog.csdn.net/weixin_31968639/article/details/114840488

版权

一道题根本不会，抄答案过了。一道自己写，莫名其妙出现了不会的bug。最后交了暴力解，过了5/7。估计要跪。

总结：

缺点：做过的不熟练。没做过的题不会。一个陌生的小bug也de不出来。

措施：多总结还是有好处的。坚持刷tag题有必要，绝对能慢慢增强实力，很重要。

指定方向的dp: 改变i - 1 j - 1就行了 dp[j] = Math.min(dp[i+1][j-1], dp[i+1][j], dp[i+1][j+1]) + matrix[j];

加下一行不行，不能处理第一行的时候。该成每次加上一行,这样第一行就可以被初始化了。lc 64。

public classSolution {/** @param grid: a list of lists of integers

* @return: An integer, minimizes the sum of all numbers along its path*/

public int minPathSum(int[][] grid) {//corner case

if (grid == null || grid.length == 0) {return -1;

}if (grid[0] == null || grid[0].length == 0) {return -1;

}//intialization

int m =grid.length;int n = grid[0].length;int[][] f = new int[m][n];

f[0][0] = grid[0][0];// for (int i = 1; i < m; i++) {

f[i][0] = f[i - 1][0] + grid[i][0];

}for (int j = 1; j < n; j++) {

f[0][j] = f[0][j - 1] + grid[0][j];

}//top down

for (int i = 1; i < m; i++) {for (int j = 1; j < n; j++) {

f[i][j]= grid[i][j] + Math.min(f[i - 1][j],f[i][j - 1]);

}

}//result

return f[m - 1][n - 1];

}

[学生迟到问题]

Q2(MEDIUM): greatest lateness，不知道地里有没有这题的面经，给一个2d-vector的string，每一行格式是 [日期，姓名，开课时间，到课时间]，输出整个输入里累计“相对”迟到时间最长的同学的姓名, 如果学生早于开课时间absolute lateness算0，相对迟到时间是说同学当天绝对迟到时间和当天所有人绝对迟到时间的平均值的差，如果小于的话就算0，如果结果一样按姓名alphabetical输出

不知道存两个哈希表的好处

map.keySet().size()用于找size

每次i都要重新存声明为int

自己造轮子，写了半天，终于貌似好像过了：

//package whatever;//don't place package name!

import java.io.*;import java.util.*;import java.lang.*;classSolution {//method, need parameter, there is return

publicString latestStudent(String[][] students) {//initialization

HashMap dayToTime = new HashMap();

HashMap nameToTime = new HashMap();

HashMap dayToAverageLateTime = new HashMap();int count = 0;//put time to map

for (int i = 1; i < students.length; i++) {if (students[i][0] == students[i - 1][0]) {

count++;

}else{int averageLateTime = dayToTime.get(students[i - 1][0]) /count;

count= 0;

dayToAverageLateTime.put(students[i- 1][0], averageLateTime);break;

}int time = Integer.valueOf(students[i][3]) - Integer.valueOf(students[i][2]);if (time > 0) {

dayToTime.put(students[i][0], time);

}elsedayToTime.put(students[i][0], 0);

}int countOfAverage =dayToAverageLateTime.keySet().size();int max = 0;//put student into the map, and find the max time

for (int i = 0; i < students.length; i++) {int averageLateTime = dayToAverageLateTime.getOrDefault(students[i][0], 0);int absoluteTime = Integer.valueOf(students[i][3]) - Integer.valueOf(students[i][2]);if ((absoluteTime - averageLateTime)> 0) {

nameToTime.put(students[i][1], absoluteTime -averageLateTime);

max= Math.max(max, absoluteTime -averageLateTime);

}

}//find the max student

int countOfStudents =nameToTime.keySet().size();for(String name : nameToTime.keySet()) {if (nameToTime.get(name) ==max)

System.out.println("max = " +max);returnname;

}return null;

}

}classMyCode {public static voidmain (String[] args) {

String[][] students= {{"1", "A", "540", "570"}, {"1", "B", "540", "543"}, {"1", "C", "540", "530"}, {"2", "A", "540", "580"}, {"2", "B", "540", "580"}, {"2", "C", "540", "595"}};

Solution answer= newSolution();

System.out.println("name = " +answer.latestStudent(students));

}

View Code

右端对齐：sb.append("\n");

//package whatever;//don't place package name!

import java.io.*;classMyCode {public static voidmain (String[] args) {

String str1= "abc";

String str2= "def";

String str3= str1 + "\n" +str2;

System.out.println(str3);

}

\r是把前面的删掉

//package whatever;//don't place package name!

import java.io.*;classMyCode {public static voidmain (String[] args) {

String str1= "abc";

String str2= "def";

String str3= "gji";

String str4= "jkl";

String str= str1 + "\r" + str2 + "\r" + str3 + "\r" +str4;

System.out.println(str);

}

转大写要用.toUpperCase()

学生填志愿问题：可以用 comparable结构

class Student implements Comparable{intscore;intindex;public Student(int score, intindex) {this.score =score;this.index =index;

}

@Overridepublic intcompareTo(Student o) {if(this.score - o.score == 0) {return this.index -o.index;

}//TODO Auto-generated method stub

return this.score-o.score;

}

慈善数组每次分钱给最少的：

用pq，然后也可以用比较结构

class Orgnization implements Comparable{

String name;doubleamount;publicOrgnization(String name) {this.name =name;this.amount = 0;

}

@Overridepublic intcompareTo(Orgnization o) {if(this.amount - o.amount == 0) {return this.name.compareTo(o.name);

}return (int) (this.amount -o.amount);

}

有符号的算式版reverse words in a string：用一个变量isnumber来控制，true就append

public classReverseAlgebraExpression {public static voidmain(String[] args) {

String test1= "1*2.4+9.6-23.89";

String answer1= "23.89-9.6+2.4*1";

String test2= "1*2.4+-9.6-23.89";

String answer2= "23.89--9.6+2.4*1";

String test3= "-1*2.4+-9.6-23.89";

String answer3= "23.89--9.6+2.4*-1";

test1(test1, answer1,1);

test1(test2, answer2,2);

test1(test3, answer3,3);//String t1 = "My keyboard is broken!";//String a1 = "My keyboRD IS BROKEN!";//String t2 = "\"Baa, Baa!\" said the sheep";//String a2 = "\"B, B!\" sID THE SHEEP";//test2(t1, a1, 1);//test2(t2, a2, 2);

}public static void test1(String a, String b, inti) {

String output= null;

output=rae(a);if(b.equals(output)) {

System.out.println("Passed case "+i);

}else{

System.out.println("Incorrect "+i+": " +output);

}

}public static void test2(String a, String b, inti) {

String output= null;

output=capLock(a);if(b.equals(output)) {

System.out.println("Passed case "+i);

}else{