ok0011的博客

public class Temp { public static String largestNumber(int[] nums) { String[] numStrArray = new String[nums.length]; for (int i = 0; i < nums.length; i++) { numStr...

public class Temp { //数字转字母序列 -> 10进制转26进制 public static String numToLetters(int num) { if (num <= 0) { return ""; } String result = ""; whi...

import java.util.ArrayList;import java.util.List;public class Temp { public static int[][] chessboard = new int[8][8]; public static List<String> solutionStrs = new ArrayList<>...

public class Solution { //只存在一个峰值 public static Integer findMaxNum(int[] nums) { if (nums == null || nums.length == 0) { return null; } int len = nums.length...

import java.util.Arrays;public class Temp { //右移数组m位 public static void shiftArray1(int[] data, int m) { int len = data.length; while (m-- > 0) { int temp = d...

public class Temp { public static int minPathNum(int[][] data, int startI, int startJ, int endI, int endJ) { int sum = Integer.MAX_VALUE; int i = startI; int j = startJ;...

public class Temp { public static void printYuesefuNum(int total, int k) { int[] data = new int[total]; for (int i = 0; i < total; i++) { data[i] = i + 1; }...

public class Temp { public static String lcs(String a, String b) { if (a == null || b == null || a.length() == 0 || b.length() == 0) { return ""; } int aLen =...

Serverimport java.io.IOException;import java.net.InetSocketAddress;import java.nio.ByteBuffer;import java.nio.channels.SelectionKey;import java.nio.channels.Selector;import java.nio.channels.Serve

import java.util.Arrays;public class Solution { public int LIS(int[] array) { int[] temp = new int[array.length]; temp[0] = array[0]; int maxLen = 1; int i = 1;

import java.util.Arrays;public class Solution { //??1 public int[] searchRange(int[] nums, int target) { if (nums == null || nums.length == 0) return new int[]{-1, -1};

import java.util.ArrayList;import java.util.List;import java.util.Scanner;class Mem { int handle; int start; int count; public Mem(int handle, int start, int count) { this.hand

import java.util.Scanner;public class Main{ public static boolean isForward(String line, String target1, String target2){ int pos = -1; pos = line.indexOf(target1); if(pos =

import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Solution { public List<List<Integer>> combinationSum(int[] candidates, int target) { List<List<Intege

import java.util.Arrays;public class Solution { public void nextPermutation(int[] nums) { if (nums == null || nums.length <= 1) return; int i = nums.length - 1;

import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Solution { //解法1 public List<List<Integer>> fourSum1(int[] nums, int target) { if (nums == null |

import java.util.Arrays;public class Solution { //顺时针旋转90度 public void rotate(int[][] matrix) { for (int i = 0, j = matrix.length - 1; i < j; i++, j--) { int[] temp = matrix

import java.util.Scanner;public class Solution { static int count = 2; public static void swap(char[] arr, int i, int j) { char tmp = arr[i]; arr[i] = arr[j]; arr[j] = tm

import java.util.Arrays;public class Solution { public int[] singleNumber(int[] nums) { int[] result = new int[2]; int res = 0; for(int d : nums){ res ^= d;

public class Demo { public static boolean isChinese(char c) { Character.UnicodeBlock ub = Character.UnicodeBlock.of(c); if (ub == Character.UnicodeBlock.CJK_UNIFIED_IDEOGRAPHS

import org.apache.commons.lang3.StringUtils;import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Deque;import java.util.HashMap;import java.util.List;import java.util.Map;public

import java.util.Scanner;public class Main { public static void main(String argv[]) { Scanner in = new Scanner(System.in); while (in.hasNext()) { int n = in.nextInt();

public class Solution { public int maxProduct(int[] nums) { if (nums == null || nums.length == 0) { return 0; } if (nums.length == 1) { return nums[0]

import java.util.Arrays;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) {

import java.util.ArrayList;import java.util.List;public class Solution { public List<List<Integer>> subsets(int[] nums) { List<List<Integer>> result = new ArrayList<>(); result.add(

import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Solution { public void add(int[] array, int[] nums, List<List<Integer>> result) { List<Integer> list =

import java.util.ArrayList;import java.util.HashSet;import java.util.List;import java.util.Set;public class Solution { public List<List<Integer>> permute(int[] nums) { List<List<Integer>

import java.math.BigInteger;public class Solution { //解法1 public String multiply(String num1, String num2) { if (num1 == null || num1.length() == 0 || (num1.length() == 1 && num1.trim()

import java.util.Arrays;public class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int p = m + n; int i = m - 1; int j = n - 1; while (--p >=

import java.util.ArrayList;import java.util.List;public class Solution { public String convert(String s, int numRows) { if(s == null || s.trim().isEmpty() || s.length() <= numRows || numRo

import java.util.Arrays;import java.util.Comparator;import java.util.HashMap;import java.util.Map;public class tt { public static void main(String[] args){ //数字排序，按频率由低到高，相同频率按数字大小排序

package algorithm;public class LongestIncreasingSubsequence { void getLIS(int[] array){ /** *max：最长递增序列元素个数 *maxIndex:最长递增序列中最后一个元素的下标 *preIndex:保存最长子序列各个元素，

import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class OneZeroBag { public static class Item{ char name; int weight; int value; publi

import java.util.ArrayList;import java.util.List;class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public class Solution { //快速排序 public ListNode sortList(List

import java.util.Arrays;import java.util.Set;import java.util.TreeSet;public class Solution { public int removeDuplicates1(int[] nums) { if(nums == null || nums.length == 0){

public class MaxGap { static class Bucket{ int min = Integer.MAX_VALUE; int max = Integer.MIN_VALUE; } public static int getMaxGap(int[] array){ int n = array.length,

package algorithm;import java.util.ArrayList;import java.util.List;public class Solution { List<Integer> getBinary(int num){ List<Integer> binary = new ArrayList<>(); while(num > 0)

#include <iostream>using namespace std;int main(){ int n; while(cin >> n) { if(n == 0 || n == 1) cout << 1 << endl; else { int a[10000] =

public class Solution { public int countDigitOne(int n) { long sum = 0; long factor = 1; while(n/factor != 0){ long lower = n%factor; long curr = (n/

class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}public class Solution { public boolean isPalindrome(ListNode head) { if(head == null