# [置顶] POJ刷题指南

POJ刷题指南 好久没写代码，编码能力退步了，后期争取每日一题，能刷多少是多少。 OJ上的一些水题(可用来练手和增加自信) (poj3299(√),poj2159(√),poj2739(√),poj1083(√),poj2262(√),poj1503(√),poj3006(√),poj...

# LWC 74: 793. Preimage Size of Factorial Zeroes Function

LWC 74: 793. Preimage Size of Factorial Zeroes Function 传送门：793. Preimage Size of Factorial Zeroes Function Problem: Let f(x) be the number of ...

# LWC 74: 795. Number of Subarrays with Bounded Maximum

LWC 74: 795. Number of Subarrays with Bounded Maximum 传送门：795. Number of Subarrays with Bounded Maximum Problem: We are given an array A of pos...

# LWC 74: 792. Number of Matching Subsequences

LWC 74: 792. Number of Matching Subsequences 传送门：792. Number of Matching Subsequences Problem: Given string S and a dictionary of words words, ...

# LWC 74: 794. Valid Tic-Tac-Toe State

LWC 74: 794. Valid Tic-Tac-Toe State 传送门：794. Valid Tic-Tac-Toe State Problem: A Tic-Tac-Toe board is given as a string array board. Return Tru...

# LWC 73: 790. Domino and Tromino Tiling

LWC 73: 790. Domino and Tromino Tiling 传送门：790. Domino and Tromino Tiling Problem: We have two types of tiles: a 2x1 domino shape, and an “L” t...

# LWC 73: 791. Custom Sort String

LWC 73: 791. Custom Sort String 传送门：791. Custom Sort String Problem: S and T are strings composed of lowercase letters. In S, no letter occurs ...

# LWC 73: 789. Escape The Ghosts

LWC 73: 789. Escape The Ghosts 传送门：789. Escape The Ghosts Problem: You are playing a simplified Pacman game. You start at the point (0, 0), and...

# LWC 73: 788. Rotated Digits

LWC 73: 788. Rotated Digits 传送门：788. Rotated Digits Problem: X is a good number if after rotating each digit individually by 180 degrees, we ge...

# LWC 72: 786. K-th Smallest Prime Fraction

LWC 72: 786. K-th Smallest Prime Fraction 传送门：786. K-th Smallest Prime Fraction Problem: A sorted list A contains 1, plus some number of primes...

# LWC 72: 787. Cheapest Flights Within K Stops

LWC 72: 787. Cheapest Flights Within K Stops 传送门：787. Cheapest Flights Within K Stops Problem: There are n cities connected by m flights. Each ...

# LWC 72: 785. Is Graph Bipartite?

LWC 72: 785. Is Graph Bipartite? 传送门：785. Is Graph Bipartite? Problem: Given a graph, return true if and only if it is bipartite. Recall t...

# LWC 72: 784. Letter Case Permutation

LWC 72: 784. Letter Case Permutation 传送门：784. Letter Case Permutation Problem: Given a string S, we can transform every letter individually to ...

# LWC 71: 782. Transform to Chessboard

LWC 71: 782. Transform to Chessboard 传送门：782. Transform to Chessboard Problem: An N x N board contains only 0s and 1s. In each move, you can sw...

# LWC 71: 780. Reaching Points

LWC 71: 780. Reaching Points 传送门：780. Reaching Points Problem: A move consists of taking a point (x, y) and transforming it to either (x, x+y) ...

# LWC 71: 781. Rabbits in Forest

LWC 71: 781. Rabbits in Forest 传送门：781. Rabbits in Forest Problem: In a forest, each rabbit has some color. Some subset of rabbits (possibly al...

# LWC 71: 783. Minimum Distance Between BST Nodes

LWC 71: 783. Minimum Distance Between BST Nodes 传送门：783. Minimum Distance Between BST Nodes Problem: Given a Binary Search Tree (BST) with the ...

# TensorFlow 入门（二）：Softmax 识别手写数字

TensorFlow 入门（二）：Softmax 识别手写数字 @author: demonSong @email: daimeSong@gmail.com refer to: http://www.tensorfly.cn/tfdoc/tutorials/mnist_beginners.h...

# TensorFlow 入门（一）：基本使用

TensorFlow 入门（一）：基本使用 @author: demonSong @email: daimeSong@gmail.com 基本使用 refer to： http://wiki.jikexueyuan.com/project/tensorflow-zh/get_star...

个人资料
等级：
访问量： 23万+
积分： 5893
排名： 5300
博客专栏
 机器学习入门 文章：25篇 阅读：69072 算法集中营 文章：312篇 阅读：147842
最新评论