一只狐狸scse

摘要： static const auto _____ = []() { ios::sync_with_stdio(false); cin.tie(nullptr); return nullptr; }(); class Solution { public: bool isPalindrome(int x) { if(x<0) r... 阅读全文

摘要： static auto io_sync_off = [](){ std::ios::sync_with_stdio(false); std::cin.tie(nullptr); return nullptr; }(); class Solution { public: int reverse(int x) { long result = 0; ... 阅读全文

摘要： string convert(string s, int numRows) { if(numRows == 1){ return s; } int count = 0; int num = 0; string temp = ""; while(num != s.size()){ for (int i = 0; i =... 阅读全文

摘要： Longest Palindromic Substring Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Exam 阅读全文

摘要： 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 ov 阅读全文

摘要： Torch7-GitHub https://github.com/torch/torch7 Torch入门 https://blog.csdn.net/sunflower_Yolanda/article/details/51726638 Torch_nn-GitHub https://github. 阅读全文

摘要： Given a string, find the length of the longest substring without repeating characters. Example 1: Solution: PS. 今天的问题只要在于对于map的操作不熟悉，应用的几个操作分别是： count 阅读全文

摘要： 神经网络相关名词解释 这篇文章的目的是把之前概念理解的名词用公式记忆一下。 1. 正则化 1.0 过拟合 这是正则化主要解决的问题。 过拟合现象主要体现在accuracy rate和cost两方面： 1.模型在测试集上的准确率趋于饱和而训练集上的cost仍处于下降趋势 2.训练集数据的cost趋于下 阅读全文

摘要： 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 contai 阅读全文

摘要： 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 ex 阅读全文