mcf171的专栏

Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, whe

IdQuestionDifficultyFrequencyData StructuresAlgorithms1Two Sum25array + setsort + two pointers2Add Two Numbers34linked listtwo point

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=163code#include#includechar puzzle[5][5];bool move(char chs[5][5], int x,int y, in

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=168code#include#includechar puzzle[20][20];int flags[20][20];bool isEligible(int i, in

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=4&problem=208&mosmsg=Submission+received+with+ID+15887888code#includeint main(){

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=12&problem=1023&mosmsg=Submission+received+with+ID+15888154  code #includechar

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=276code#include#define maxn 1010int main(){int n ,a[maxn],b[maxn];int gameC

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4459code#include#includeconst int maxn = 105;int less(char* s, int ans, int k)

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3666code{优快云:CODE:#include#includeint main(){int total[10];int n;s

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4114code#includechar DNAs[55][1005];char result[1005];int main(){ int caseN; sc

链接 https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&category=24&problem=2267&mosmsg=Submission+received+with+ID+15876651 code #include#includeusing n

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4458code#includeint main(){int n;scanf("%d",&n);while(n--)

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4463code#include#include#includeusing namespace std;int getMinLen(char* n1 ,char

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=396code#include#includeint main(){int n;scanf("%d",&n);while(n--){

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4462code#include#include#includeusing namespace std;struct Node{ int w,h; bool oper

链接地址：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=342code#include#include#includeconst char* rev = "A   3  HIL JM O   2TUVWXY51SE z  8 ";

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4461code#include#include#includeconst int maxLen = 100;int getIndex(char *

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1281code#include#includechar s[100005],t[100005];int main(){ while(scanf("%s %s",

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4460code#include#includeconst int maxLen = 100;int main(){char s[maxLen];

链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=430code#include#includeint letters[30];char words[100005],guess[100005];int main

前言：刷了几天简单的题找感觉，现在决定按照序号来做题。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 solu

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link

重新刷题，由于计划是先刷一遍，从自己最熟悉的java开始刷题，刷完之后考虑尝试用其他语言刷题。——————————————————————————————————————————————————————————Write a function that takes a string as input and returns the string reversed.Examp

You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the

Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.public class Solution { public int getSum(int a, in

Given
 an 
arbitrary
 ransom
 note
 string 
and 
another 
string 
containing 
letters from
 all 
the 
magazines,
 write 
a 
function 
that 
will 
return 
true 
if 
the 
ransom 
 note 
can 
be 
constru

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has on

Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node./** * Definition for a binary tre

Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].Note:Each element in the result must be unique.T

Given a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ... Z -> 26 AA -> 27 AB -> 28 public cla

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element

Given two arrays, write a function to compute their intersection.Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note:Each element in the result should appear as ma

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Given a m x n matrix, if an el

前言：最近开学事情特别多，隔了一个月没刷题，真是蛋疼。----------------------Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc",

前言：正好碰见Leetcode有一次在线笔试，测试一下，还是挺开心的，全做出来了Rank：98/869。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Given two non-negative numbers num1 and num2 represented

前言：正好碰见Leetcode有一次在线笔试，测试一下，还是挺开心的，全做出来了Rank：98/869。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Given a non-empty array containing only positive integers, fi

前言：正好碰见Leetcode有一次在线笔试，测试一下，还是挺开心的，全做出来了Rank：98/869。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Given a rows x cols screen and a sentence represented by a li

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Write an efficient algorithm t

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Given an array with n objects

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发优快云，mcf171专栏。博客链接：mcf171的博客——————————————————————————————Given two integers n and k, re