随笔分类 - Algorithm
摘要：Java private static void insertionSort(int[] array) { for (int i = 1; i < array.length; ++i) { int index = i - 1, mark = array[i]; while (mark < array
阅读全文
摘要：Java public class Ersatz { public static void main(String[] args) { int[] ints = new int[8]; for (int v = 0; v < ints.length; ++v) { ints[v] = (int) (
阅读全文
摘要：Java while public class A { public static int binarySearch(int[] array, int aim) { int low = 0, high = array.length - 1, mid; while (low <= high) { mi
阅读全文
摘要：def reverse(b: int): while b // 10: print(b % 10) b //= 10 print(b) reverse(1234) reverse(8) reverse(0) def reverse(b: int) -> int: if b < 10: return
阅读全文
摘要：remand = 'abaxyzzyxf' def long_palindrome(s: str) -> str: longest = '' for i in range(len(s)): for j in range(i, len(s)): substr = s[i:j + 1] if is_pa
阅读全文
摘要：remand = [7, 10, 12, 7, 9, 13] def max_sum_no_adjacent(array): if not len(array): raise ValueError(f'array is empty') if len(array) < 3: return max(ar
阅读全文
摘要：nested loop remand = [3, 5, -4, 8, 11, 1, -1, 6] goal = 10 def palindrome(array: list[int], goal: int) -> tuple: length = len(array) for i in range(le
阅读全文
