CLRS 算法导论
「已注销」
这个作者很懒,什么都没留下…
展开
-
希尔排序 代码
这个排序方法看起来简单,实现起来还是很麻烦的。写法一 public static void sort(int[] arr) { int n = arr.length; for (int gap = n / 2; gap > 0; gap /= 2) { for (int i = gap; i < n; i++) { for (int j = i; j >= gap; j -= gap)原创 2020-12-02 12:40:28 · 384 阅读 · 0 评论 -
Java判断回文字符串
public class Palindrome { public static boolean isPalindrome(String s) { int len = s.length(); for (int i = 0; i < len / 2; i++) if (s.charAt(i) != s.charAt(len - i...原创 2020-03-30 12:01:15 · 392 阅读 · 0 评论 -
LeetCode-1114. Print in Order
Description:Suppose we have a class:public class Foo { public void first() { print("first"); } public void second() { print("second"); } public void third() { print("third"); }}The same...转载 2020-03-18 21:23:29 · 279 阅读 · 0 评论 -
LeetCode-206. Reverse Linked List
Reverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLSolution:/** * Definition for singly-linked list. * public class ...转载 2020-03-18 14:24:05 · 282 阅读 · 0 评论 -
LeetCode 696. Count Binary Substrings
Description:Give a strings, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutiv...转载 2020-03-08 16:56:27 · 238 阅读 · 0 评论 -
判断平年和闰年
判断平年(common year)和闰年(leap year)的计算方法很简答:1. 如果年份是整百年份,用年份除以400,没有余数即为闰年,有余数即为平年。2. 如果年份不是整百年份,用年份除以4,没有余数即为闰年,有余数即为平年。说明:2096年和2104年都是闰年,但2100年是平年。所以“四年一润”的说法是不对的,正确说法应该是:“四年一闰,百年不闰,四百年再闰”。判断某一...原创 2019-12-29 18:59:58 · 16038 阅读 · 0 评论 -
(Java) 求一个数组中最大的三个数 和 最小的两个数
public int maximumProduct(int[] nums) { if (nums.length < 3) return 0; // 开始 int min1 = Integer.MAX_VALUE; int min2 = Integer.MAX_VALUE; int ...原创 2019-12-24 19:31:25 · 848 阅读 · 0 评论 -
Determine whether an integer is a palindrome using Java
class Solution { public boolean isPalindrome(int x) { if (x < 0 || (x % 10 == 0 && x != 0)) { return false; } int revertedNumber = 0; while...原创 2019-11-23 03:17:39 · 272 阅读 · 0 评论 -
The maximum-subarray problem
package com.zkdx.test;import java.util.HashMap;/** * @Author: Chintsai Hwo * @Date: Created on 8:37 PM 6/27/2019 */public class Test { public static void main(String[] args) { int...原创 2019-06-28 00:44:34 · 373 阅读 · 1 评论 -
Chapter 2:Getting Started
2.1 Insertion Sort2.2 Analyzing algorithmsWorst-case and average-case analysisIn our analysis of insertion sort, we looked at both the best case, in which the input array was already s...原创 2019-06-27 00:34:36 · 335 阅读 · 0 评论 -
Merge Sort in Java, C,C++ and Python
public class MergeSort { public static void main(String[] args) { int[] a = {4, 6, 8, 4, 22, 65, 3, 75, 2, 5, 7, 85, 3, 2}; mergeSort(a, 0, a.length - 1); for (int i : a)...翻译 2019-06-17 01:52:27 · 357 阅读 · 0 评论 -
Insertion Sort in Java, C,C++ and Python
/** * @Author: Chintsai Hwo * @Date: Created on 5:40 AM 6/2/2019 */import java.util.Scanner;public class InsertSort { public static void main(String[] args) { Scanner scanner = new...原创 2019-06-03 16:17:47 · 344 阅读 · 0 评论 -
Chapter 1 : The Role of Algorithms in Computing
Before there were computers, there were algorithms. But now that there are computers,there are even more algorithms, and algorithms lie at the heart of computing.1.1 AlgorithmsInformally, an algor...原创 2019-06-01 11:42:27 · 610 阅读 · 0 评论