算法
我岂是非人哉
持之以恒收敛至顿悟
展开
-
[leetcode][algorithm][python]Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.Example 1:Input: "abcabcbb"Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2:...原创 2019-02-14 23:55:20 · 110 阅读 · 0 评论 -
[leetcode][algorithm][python]Merge Sorted Array
class Solution: def merge(self, nums1: 'List[int]', m: 'int', nums2: 'List[int]', n: 'int') -> 'None': """ Do not return anything, modify nums1 in-place instead. """ ...原创 2019-02-17 16:54:33 · 192 阅读 · 0 评论 -
[leetcode][algorithm][python]Two Sum
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same ...原创 2019-02-13 16:25:41 · 161 阅读 · 0 评论 -
【算法复习】01背包问题
第一个自己写的代码不是ctrl+c, ctrl+v了#include "pch.h"#include <iostream>int w[5] = { 800, 400, 300, 400, 200 };int v[5] = { 2, 5, 5, 3, 2 };int choose[5] = { 0,0,0,0,0 };int limit = 1000;int ha...原创 2019-02-19 11:21:01 · 269 阅读 · 0 评论 -
[leetcode][algorithm][python]Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i...原创 2019-02-14 10:26:09 · 158 阅读 · 0 评论 -
【算法复习】【贪心】活动安排问题
#include "pch.h"#include <iostream>using namespace std;int arrange(int s[], int f[], int n, int ss[], int sf[]) { ss[0] = s[0], sf[0] = f[0]; int i; int j = 0; int cnt = 0; for (i = ...原创 2019-02-25 16:09:02 · 142 阅读 · 0 评论 -
【算法复习】【贪心】完美的代价
问题描述 回文串,是一种特殊的字符串,它从左往右读和从右往左读是一样的。小龙龙认为回文串才是完美的。现在给你一个串,它不一定是回文的,请你计算最少的交换次数使得该串变成一个完美的回文串。 交换的定义是:交换两个相邻的字符 例如mamad 第一次交换 ad : mamda 第二次交换 md : madma 第三次交换 ma : madam (回文!完美!)输入格式 ...原创 2019-02-25 22:23:22 · 143 阅读 · 0 评论 -
《算法竞赛入门经典》习题3-1,UVa1585
#include <stdio.h>#include <string.h>#define maxn 1000int main(){ int T; char buf[maxn]; int bufint[maxn]; scanf("%d",&T); while(T--) { int sum=0;...原创 2019-04-12 21:25:37 · 122 阅读 · 0 评论 -
如何用printf输出%d
#include <stdio.h>int main(){ printf("%%d\n"); getchar(); return 0;}%要用%%的形式写在格式化字符串里面。其他方法:#include <stdio.h>int main(){ printf("%c",'%'); printf("d\n")...原创 2019-04-12 20:29:56 · 22948 阅读 · 1 评论 -
char * const*(*next)()
你能轻易说出char * const *(*next)()声明的next是什么类型的吗?需要从右向左读:是一个指向next()函数的指针,这个next()函数返回一个指针,这个指针一个只读的指针,只读的指针指向一个字符变量。想象一下把const去掉,变成char **char <------ pointer <------ pointerchar ...原创 2019-04-19 22:20:49 · 735 阅读 · 0 评论 -
[leetcode][algorithm][python]Coin Change
方法一:暴力法(回溯)public class Solution { public int coinChange(int[] coins, int amount) { return coinChange(0, coins, amount); } private int coinChange(int idxCoin, int[] coins,...原创 2019-02-17 16:40:43 · 128 阅读 · 0 评论 -
[leetcode][algorithm][python]N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each ...原创 2019-02-17 12:50:20 · 109 阅读 · 0 评论 -
[leetcode][algorithm][python]Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assume nums1 and n...原创 2019-02-15 18:04:15 · 98 阅读 · 1 评论 -
[leetcode][algorithm][python]Longest Palindromic Substring【未完!】
最长回文子串方法一:将字符串逆序,找原字符串和逆序字符串的最长公共子串漏洞:可能源字符串中存在对称的子串解决:检查索引值方法二:暴力方法三:动态规划先从一两个字母的回文开始,向两边增加对称字母方法四:从串中心延伸 java代码:public String longestPalindrome(String s) { if (s == null || s.le...原创 2019-02-15 23:01:18 · 95 阅读 · 0 评论 -
[leetcode][algorithm][python]ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S ...原创 2019-02-15 23:58:50 · 166 阅读 · 0 评论 -
[leetcode][algorithm][python]Reverse Integer
Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21Note:Assume we are dea...原创 2019-02-16 14:15:16 · 92 阅读 · 0 评论 -
[leetcode][algorithm][python]String to Integer (atoi)
Implement atoi whichconverts a string to an integer.The function first discards as many whitespace characters as necessary until the first non-whitespace character is found. Then, starting from thi...原创 2019-02-16 16:29:42 · 240 阅读 · 0 评论 -
[leetcode][algorithm][python]Palindrome Number
Determine whether an integer is a palindrome. An integerisapalindrome when itreads the same backward as forward.Example 1:Input: 121Output: trueExample 2:Input: -121Output: falseExp...原创 2019-02-16 16:49:40 · 103 阅读 · 0 评论 -
[leetcode][algorithm][python]Binary Search
class Solution: def search(self, nums: 'List[int]', target: 'int') -> 'int': return self.binarysearch(nums,target,0,len(nums)-1) def binarysearch(self,nums,target,lower,upper): ...原创 2019-02-17 11:11:22 · 111 阅读 · 0 评论 -
[leetcode][algorithm][python]Fibonacci Number
TheFibonacci numbers, commonly denotedF(n)form a sequence, called theFibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,F(0) = 0, F...原创 2019-02-17 11:22:23 · 146 阅读 · 0 评论 -
[leetcode][algorithm][python]Length of Longest Fibonacci Subsequence
A sequence X_1, X_2, ..., X_nis fibonacci-like if:n >= 3 X_i + X_{i+1} = X_{i+2}for alli + 2 <= nGiven a strictly increasingarrayA of positive integers forming a sequence, find the leng...原创 2019-02-17 12:06:07 · 121 阅读 · 0 评论 -
数据结构课的一道链表题目
己看书很简单,结果自做却总是碰到问题,比如这个我就没解决。留在这,看看以后能不能解决。原来是析构函数将被合并的那个链表delete了两次。...原创 2017-03-25 20:48:21 · 374 阅读 · 0 评论