ZuoMarsNiShang的博客

//// main.c// sqlist//// Created by Mac on 16/8/1.// Copyright ? 2016年 Mac. All rights reserved.//#include <stdio.h>#include <stdlib.h>typedef struct Node{ int data; struct Node *ne

import java.util.Scanner;public class POJ2811 { public static void main(String[] args) { char[] oriLights = new char[5]; char[] lights = new char[5]; char[] result = new

import java.util.Scanner;public class BLOJ1088 { static int[][] map; static int[][] mapMemory; static int row; static int col; public static void main(String[] args) {

import java.util.LinkedList; import java.util.Queue;class Node { private int key; private int value; private Node left; private Node right;public int getKey() { return key;}pu

import java.math.BigInteger; import java.util.Scanner;/*给定n个1到9的数字，要求在数字之间摆放m个加号(加号两边必须有数字）， 使得所得到的加法表达式的值最小，并输出该值。例如，在1234中摆放1个加号， 最好的摆法就是12+34,和为36 */public class CalcMin { static Scanner sc

import java.util.Scanner;/*1 ABCD EFGH even ABCI EFJK up ABIJ EFGH even */ public class Coin { static char[][] left_set = new char[3][4]; static char[][] right_set = new char[3][4];

import java.util.LinkedList;//稀疏图的顶点类 class Vertex { LinkedList list; }class SparseGraph { int v, e = 0; private boolean directed; private Vertex[] g;public SparseGraph(int v, boo

//0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, public class FiB { public static void main(String[] args) { System.out.println(Fib(8)); System.out.println(Fib2(8)); } //迭代

public class Hanoi {public static void main(String[] args) { hanoi(10,'a','b','c');}private static void hanoi(int n,char src,char support,char dest) { if (n == 1) { System.out.println(

//堆排序 public class HeapSort {public static void main(String[] args) { int[] arr = {431,9,3,43,65,4,6}; heapSort1(arr); heapSort2(arr);//heapify heapSort3(arr);//原地堆排序}private static v

//最大堆，数组实现完全二叉堆 public class MaxHeap { int[] data;// data[0]为最大堆的数量 int capacity;//最大堆的容量public MaxHeap(int capacity) { this.capacity = capacity; data = new int[capacity + 1]; da

import java.util.Scanner;/*输入格式： 5 //表示三角形的行数 接下来输入三角形 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 在上面的数字三角形中寻找一条从顶部到底边的路径， 使得路径上所经过的数字之和最大。路径上的每一步都只能往左下或 右下走。 只需要求出这个最大和即可，不必给出具

import java.util.Scanner;//逆波兰 public class POJ2694 { static Scanner scanner = new Scanner(System.in); public static void main(String[] args) { System.out.format(“%.6f”, calc());

import java.util.Scanner;//神器的口袋~ public class OJ2755 { static int[] weigth; static int[][] results; static int[] results2; static Scanner scanner = new Scanner(System.in);public s

第一篇博客线性表基本操作，暑假把大一的代码练习一遍。多多指教，谢谢#include<stdio.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define OVERFLOW -1 #define LIST_INIT_SIZE 100typedef struct{ int

#include<stdio.h>void bubble_sort(int array[],int len){ int i,j,count1,count2 = 1; for(i=0;i<len;i++) { for(j=0;j<len-i-1;j++) { //交换 if(array[j]>arr

冒泡的变种“`includeinclude

时间复杂度： 最好情况：O（n） 最坏情况：O( n*n ) 平均情况：O（n*n）空间复杂度： O（1）稳定性： 稳定#include<stdio.h>void printArray(int a[], int size) //打印数组元素{ int i; for(i = 0; i < size; i++) printf

冒泡排序的优化 #include<stdio.h>void bubble_sort(int array[],int len){ int i,j,count1,count2 = 1; int flag1; //flag1标志位，每跑完一趟就判断一次原数组现在是否有序，如果有序就break; int flag2; //flag2记录位，记录下最后一次交换的下标j;

“` import java.util.Scanner; //神器的口袋~ public class OJ2755 { static int[] weigth; static int[][] results; static int[] results2; static Scanner scanner = new Scanner(System.in);pu

import java.util.Scanner;//华为oj放苹果 public class layApple { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String apple = scanner.next();

import java.util.Timer;public class LCS { static int[][] memoryDP = new int[100][100];public static void main(String[] args) { String str1 = "abfdasgffdvddgfdvcq"; String str2 = "vfdcsdcew

import java.util.Scanner; //最长上升序列 public class LIS {public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int length = scanner.nextInt(); int[] values = new

//最大堆，数组实现完全二叉堆 public class MaxHeap { int[] data;// data[0]为最大堆的数量 int capacity;//最大堆的容量public MaxHeap(int capacity) { this.capacity = capacity; data = new int[capacity + 1]; da

import java.util.Scanner;public class NQueen { static int[] queenPos = new int[100]; static int N; static int solve;public static void main(String[] args) { Scanner scanner = new Sca

import java.util.Arrays; import java.util.Collections; import java.util.List;public class IterationAndRecursion {public static void main(String[] args) { int[] arr = { 1, 2, 3, 4, 5 }; System