Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
 
 

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

README.md

Outline

Some Scripts

comments.sh

comments.sh - it's used to generate author and problem description comments

Notes:

  • The comments.sh needs xidel to grab & parse the html contents with filtering out the HTML tags. The script would check the xidel whether installed or not in your Linux box, if not, it will download the Universal Linux Version .
  • The comments.sh currently can automatically detect the problem's type, if the problem is algorithm type, it's going to create .cpp file, if the problem is shell type, the .sh file will be created.
  1. Create a file named largestNumber.cpp, and add Copyright & Problem description
./comments.sh https://oj.leetcode.com/problems/largest-number/
  1. Add Copyright & Problem description into existed file
./comments.sh https://oj.leetcode.com/problems/largest-number/ largestNumber.cpp

The comments would be generated by above examples as below:

// Source : https://oj.leetcode.com/problems/largest-number/
// Author : Hao Chen
// Date   : 2015-01-25

/**********************************************************************************
 *
 * Given a list of non negative integers, arrange them such that they form the largest number.
 *
 * For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.
 *
 * Note: The result may be very large, so you need to return a string instead of an integer.
 *
 * Credits:Special thanks to @ts for adding this problem and creating all test cases.
 *
 **********************************************************************************/


Morty Proxy This is a proxified and sanitized view of the page, visit original site.