一.编程题
两种排序方法_牛客题霸_牛客网 (nowcoder.com)
写两个判断长度 和 字典 的方法就ok
public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
String[]strings=new String[n];
for (int i = 0; i < n; i++) {
strings[i]=scanner.next();
}
if (isDictionary(strings)&&isLength(strings)){
System.out.println("both");
}else if(isLength(strings)){
}else if (isDictionary(strings)){
}else{
System.out.println("none");
}
}
public static boolean isLength(String[]strings){
for (int i = 0; i < strings.length-1; i++) {
if (strings[i].length()>strings[i+1].length()){
return false;
}
}
return true;
}
public static boolean isDictionary(String[]strings){
for (int i = 0; i < strings.length-1; i++) {
if (strings[i].compareTo(strings[i+1])>0){
return false;
}
}
return true;
}
}
求最小公倍数_牛客题霸_牛客网 (nowcoder.com)
easy,自行查看代码即可
public static int gdc(int m,int n){
int r;
if(m==n){
return m;
}
if(m<n){
int temp=m;
m=n;
n=temp;
}
while((r=m%n)>0){
m=n;
n=r;
}
return n;
}