heartbeatSeries

heartbeatSeries

java 算法

水仙数

public class Solution {
  public static void main(String[] args) {
    for (int i = 100; i < 1000; i++) {
      int ge = i % 10;
      int shi = i / 10 % 10;
      int bai = i / 100 % 10;
      if (ge * ge * ge + shi * shi * shi + bai * bai * bai == i) {
        System.out.println(i);
      }
    }
  }
}

冒泡排序

public class Solution {
  public static void main(String[] args) {
    int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    for (int i = 0; i < arr.length; i++) {
      for (int j = 0; j < arr.length - i - 1; j++) {
        if (arr[j] > arr[j + 1]) {
          int temp = arr[j];
          arr[j] = arr[j + 1];
          arr[j + 1] = temp;
        }
      }
    }
    for (int i = 0; i < arr.length; i++) {
      System.out.println(arr[i]);
    }
  }
}