主頁 > .NET開發 > 撰寫程式的最聰明方法,該程式讀取20到89之間的數字N并列印其表示為字串的值

撰寫程式的最聰明方法,該程式讀取20到89之間的數字N并列印其表示為字串的值

2021-10-21 03:53:41 .NET開發

我使用C編程語言通過以下方式完成了與標題相關的任務:

#include <stdio.h>

int main(){
  int N;
  scanf("%d", &N);
  int ar[] = {2,3,4,5,6,7,8};
  if (N/10 == ar[0]) printf("twenty");
  if (N/10 == ar[1]) printf("thirty");
  if (N/10 == ar[2]) printf("forty");
  if (N/10 == ar[3]) printf("fifty");
  if (N/10 == ar[4]) printf("sixty");
  if (N/10 == ar[5]) printf("seventy");
  if (N/10 == ar[6]) printf("eighty");
  int ar1[] = {0,1,2,3,4,5,6,7,8,9};
  if (N%10 == ar1[0]) printf("\n");
  if (N%10 == ar1[1]) printf("one\n");
  if (N%10 == ar1[2]) printf("two\n");
  if (N%10 == ar1[3]) printf("three\n");
  if (N%10 == ar1[4]) printf("four\n");
  if (N%10 == ar1[5]) printf("five\n");
  if (N%10 == ar1[6]) printf("six\n");
  if (N%10 == ar1[7]) printf("seven\n");
  if (N%10 == ar1[8]) printf("eight\n");
  if (N%10 == ar1[9]) printf("nine\n");
    
  
  
}

有什么更聰明的方法可以做到這一點,因為我的代碼非常冗長且冗長?提前致謝。

uj5u.com熱心網友回復:

您可以將字串移動到陣列:

char *ar[] = { NULL, NULL, "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty"};
if (20 <= N && N <= 89)
  printf("%s", ar[N / 10]);

使用類似的方案ar1從 C99 開始,您可以使用指定的初始值設定項來提高可讀性:

char *ar[] = {
  [2] = "twenty",
  [3] = "thirty",
  [4] = "forty",
  [5] = "fifty",
  [6] = "sixty",
  [7] = "seventy",
  [8] = "eighty",
};

uj5u.com熱心網友回復:

這對于您想要的東西來說可能有點矯枉過正,但是......

這是一個可以列印 0 到 999 之間值的英文單詞表示的函式:

/**
 * Print a string representation of a century (3 digits).  Assumes that n
 * is between 0 and 999 and that there is sufficient space in `dst` for
 * the resulting string.
 */
void printCentury( int n, char *dst )
{
  static const char *units[] = { "", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" };
  static const char *teens[] = { "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen" };
  static const char *decades[] = { "", "", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety" };

  if ( n / 100 )
  {
    strcat( dst, units[n/100] );
    strcat( dst, " hundred" );

    n -= n/100 * 100;
    if ( n )
      strcat( dst, " and " );
  }
  
  if ( n / 10 > 1 )
  {
    strcat( dst, decades[n/10] ); 
    n -= n / 10 * 10;
    if ( n )
    {
      strcat( dst, "-" );
      strcat( dst, units[n] );
    }
  }
  else if ( n / 10 == 1 )
  {
    strcat( dst, teens[n-10] );
  }  
  else if ( n )
  {
    strcat( dst, units[n] );
  }
}

我們使用陣列來存盤我們的單詞,由 0 到 9 之間的值索引。要獲得“數百”數,我們將輸入除以 100。整數除法產生整數結果,因此123 / 100 == 1- 我們使用1索引到units陣列中,給出我們是字串"one",我們將其附加到dst. 我們立即追加" hundred",然后減去100n給我們剩下的23值。由于該值不是 0,因此我們還附加" and "到字串。

為了得到“十”數,我們10再次除以-,整數除法給出整數結果,所以23 / 10 == 2我們使用2索引到decades陣列中,給我們字串"twenty",我們將其附加到字串。然后我們20從該值中減去,得到剩余的3

如果我們列印出一個decade字串 ( "twenty", "thirty", etc. ),我們會檢查“一個”數字是否為零 - 如果不是,我們會附加一個“-”,后跟單位字串。

有用于處理之間值的特殊情況1119,因為11121315,以及18不按規定unit "teen"的圖案。

一些例子:

$ ./numbers 0
0 - zero

$ ./numbers 1
1 - one

$ ./numbers 10
10 - ten

$ ./numbers 100
100 - one hundred

$ ./numbers 101
101 - one hundred and one

$ ./numbers 111
111 - one hundred and eleven

$ ./numbers 121
121 - one hundred and twenty-one

We can use this function to print numbers greater than 999 - we just break our input into groups of three digits, so 12345678 is processed as 12 ("twelve"), 345 ("three hundred and forty-five"), 678 ("six hundred and seventy-eight"), we just need to add the appropriate magnitudes: "twelve million, three hundred and forty-five thousand, six hundred and seventy-eight". Here's that function:

/**
 * Print a string representation of a number.  Assumes a signed 32-bit
 * int input and that there is sufficient space in dst for the
 * result.
 */
void printNumber( int n, char *dst )
{
  static int magval[] = { 0, 1000, 1000000, 1000000000 };
  static const char *magnitudes[] = { "", "thousand", "million", "billion" };
  int m = 0;

  if ( n == 0 )
  {
    strcat( dst, "zero" );
    return;
  }

  if ( n < 0 )
  {
    strcat( dst, "minus " );
    n = -n;
  }

  while ( m < 4 && n >= magval[m] )
    m  ;

  while ( --m )
  {
    if ( n / magval[m] )
    {
      /**
       * print a comma after the last magnitude.
       */
      if ( strlen( dst ) ) 
        strcat( dst, ", " );

      printCentury( n / magval[m], dst );
      strcat( dst, " " );
      strcat( dst, magnitudes[m] );
    }
    n -= n / magval[m] * magval[m];
  } 
  if ( n )
  {
    /**
     * Special case handling - we want 1001 to print as
     * "one thousand and one", not "one thousand, one."
     */
    if ( strlen( dst ) > 0 && n < 100 )
      strcat( dst, " and " );
    else if ( strlen( dst ) > 0 )
      strcat( dst, ", " );
    printCentury( n, dst );
  }
}

We start by figuring out the magnitude - we do that by checking to see if n is greater than the n'th magnitude (0, 1000, 1000000, 1000000000). That gives us our starting index into the "magnitudes" array so we can pick the right magnitude string - "thousand", "million", or "billion".

Then it's a similar process to the printCentury function - we use integer division to give us the (up to) three leading digits of the number, print that "century", then subtract that magnitude to give us the next three digits. Again, there's a special case for zero, and there's logic to handle negative values (by printing "minus" and negating the input value).

This function is a bit more fiddly, since there are some special cases like "one billion and one" or "five thousand and fifty". We have to look ahead at the value and at what we've already written to make some decisions.

More examples:

$ ./numbers 1234
1234 - one thousand, two hundred and thirty-four

$ ./numbers 12345
12345 - twelve thousand, three hundred and forty-five

$ ./numbers 123456
123456 - one hundred and twenty-three thousand, four hundred and fifty-six

$ ./numbers 1234566
1234566 - one million, two hundred and thirty-four thousand, five hundred and sixty-six

$ ./numbers 12345668
12345668 - twelve million, three hundred and forty-five thousand, six hundred and sixty-eight

$ ./numbers 123456689
123456689 - one hundred and twenty-three million, four hundred and fifty-six thousand, six hundred and eighty-nine

$ ./numbers 1234566891
1234566891 - one billion, two hundred and thirty-four million, five hundred and sixty-six thousand, eight hundred and ninety-one

$ ./numbers -1234566891
-1234566891 - minus one billion, two hundred and thirty-four million, five hundred and sixty-six thousand, eight hundred and ninety-one

Complete program:

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

/**
 * Print a string representation of a century (3 digits).  Assumes that n
 * is between 0 and 999 and that there is sufficient space in `dst` for
 * the resulting string.
 */
void printCentury( int n, char *dst )
{
  static const char *units[] = { "", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine" };
  static const char *teens[] = { "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen" };
  static const char *decades[] = { "", "", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety" };

  if ( n / 100 )
  {
    strcat( dst, units[n/100] );
    strcat( dst, " hundred" );

    n -= n/100 * 100;
    if ( n )
      strcat( dst, " and " );
  }
  
  if ( n / 10 > 1 )
  {
    strcat( dst, decades[n/10] ); 
    n -= n / 10 * 10;
    if ( n )
    {
      strcat( dst, "-" );
      strcat( dst, units[n] );
    }
  }
  else if ( n / 10 == 1 )
  {
    strcat( dst, teens[n-10] );
  }  
  else if ( n )
  {
    strcat( dst, units[n] );
  }
}

/**
 * Print a string representation of a number.  Assumes a signed 32-bit
 * int input and that there is sufficient space in dst for the
 * result.
 */
void printNumber( int n, char *dst )
{
  static int magval[] = { 0, 1000, 1000000, 1000000000 };
  static const char *magnitudes[] = { "", "thousand", "million", "billion" };
  int m = 0;

  if ( n == 0 )
  {
    strcat( dst, "zero" );
    return;
  }

  if ( n < 0 )
  {
    strcat( dst, "minus " );
    n = -n;
  }

  while ( m < 4 && n >= magval[m] )
    m  ;

  while ( --m )
  {
    if ( n / magval[m] )
    {
      /**
       * print a comma after the last magnitude.
       */
      if ( strlen( dst ) ) 
        strcat( dst, ", " );

      printCentury( n / magval[m], dst );
      strcat( dst, " " );
      strcat( dst, magnitudes[m] );
    }
    n -= n / magval[m] * magval[m];
  } 
  if ( n )
  {
    /**
     * Special case handling - we want 1001 to print as
     * "one thousand and one", not "one thousand, one."
     */
    if ( strlen( dst ) > 0 && n < 100 )
      strcat( dst, " and " );
    else if ( strlen( dst ) > 0 )
      strcat( dst, ", " );
    printCentury( n, dst );
  }
}
   
/**
 * Main. Takes an integer value from the command line
 * and prints the string representation.
 */  
int main( int argc, char **argv )
{
  if ( argc < 2 )
  {
    fprintf( stderr, "USAGE: %s <number>\n", argv[0] );
    return 0;
  }

  int val = strtol( argv[1], NULL, 10 );
  
  char text[1000] = {0};

  printNumber( val, text );
  printf( "%d - %s\n", val, text );
  return 0;
}

轉載請註明出處,本文鏈接:https://www.uj5u.com/net/327469.html

標籤:C 特点

上一篇:C:在回圈前打開檔案并在回圈后關閉或在回圈內打開/關閉?

下一篇:澄清C和C 中結構的ODR規則差異

標籤雲
其他(157675) Python(38076) JavaScript(25376) Java(17977) C(15215) 區塊鏈(8255) C#(7972) AI(7469) 爪哇(7425) MySQL(7132) html(6777) 基礎類(6313) sql(6102) 熊猫(6058) PHP(5869) 数组(5741) R(5409) Linux(5327) 反应(5209) 腳本語言(PerlPython)(5129) 非技術區(4971) Android(4554) 数据框(4311) css(4259) 节点.js(4032) C語言(3288) json(3245) 列表(3129) 扑(3119) C++語言(3117) 安卓(2998) 打字稿(2995) VBA(2789) Java相關(2746) 疑難問題(2699) 细绳(2522) 單片機工控(2479) iOS(2429) ASP.NET(2402) MongoDB(2323) 麻木的(2285) 正则表达式(2254) 字典(2211) 循环(2198) 迅速(2185) 擅长(2169) 镖(2155) 功能(1967) .NET技术(1958) Web開發(1951) python-3.x(1918) HtmlCss(1915) 弹簧靴(1913) C++(1909) xml(1889) PostgreSQL(1872) .NETCore(1853) 谷歌表格(1846) Unity3D(1843) for循环(1842)

熱門瀏覽
  • WebAPI簡介

    Web體系結構: 有三個核心:資源(resource),URL(統一資源識別符號)和表示 他們的關系是這樣的:一個資源由一個URL進行標識,HTTP客戶端使用URL定位資源,表示是從資源回傳資料,媒體型別是資源回傳的資料格式。 接下來我們說下HTTP. HTTP協議的系統是一種無狀態的方式,使用請求/ ......

    uj5u.com 2020-09-09 22:07:47 more
  • asp.net core 3.1 入口:Program.cs中的Main函式

    本文分析Program.cs 中Main()函式中代碼的運行順序分析asp.net core程式的啟動,重點不是剖析原始碼,而是理清程式開始時執行的順序。到呼叫了哪些實體,哪些法方。asp.net core 3.1 的程式入口在專案Program.cs檔案里,如下。ususing System; us ......

    uj5u.com 2020-09-09 22:07:49 more
  • asp.net網站作為websocket服務端的應用該如何寫

    最近被websocket的一個問題困擾了很久,有一個需求是在web網站中搭建websocket服務。客戶端通過網頁與服務器建立連接,然后服務器根據ip給客戶端網頁發送資訊。 其實,這個需求并不難,只是剛開始對websocket的內容不太了解。上網搜索了一下,有通過asp.net core 實作的、有 ......

    uj5u.com 2020-09-09 22:08:02 more
  • ASP.NET 開源匯入匯出庫Magicodes.IE Docker中使用

    Magicodes.IE在Docker中使用 更新歷史 2019.02.13 【Nuget】版本更新到2.0.2 【匯入】修復單列匯入的Bug,單元測驗“OneColumnImporter_Test”。問題見(https://github.com/dotnetcore/Magicodes.IE/is ......

    uj5u.com 2020-09-09 22:08:05 more
  • 在webform中使用ajax

    如果你用過Asp.net webform, 說明你也算是.NET 開發的老兵了。WEBform應該是2011 2013左右,當時還用visual studio 2005、 visual studio 2008。后來基本都用的是MVC。 如果是新開發的專案,估計沒人會用webform技術。但是有些舊版 ......

    uj5u.com 2020-09-09 22:08:50 more
  • iis添加asp.net網站,訪問提示:由于擴展配置問題而無法提供您請求的

    今天在iis服務器配置asp.net網站,遇到一個問題,記錄一下: 問題:由于擴展配置問題而無法提供您請求的頁面。如果該頁面是腳本,請添加處理程式。如果應下載檔案,請添加 MIME 映射。 WindowServer2012服務器,添加角色安裝完.netframework和iis之后,運行aspx頁面 ......

    uj5u.com 2020-09-09 22:10:00 more
  • WebAPI-處理架構

    帶著問題去思考,大家好! 問題1:HTTP請求和回傳相應的HTTP回應資訊之間發生了什么? 1:首先是最底層,托管層,位于WebAPI和底層HTTP堆疊之間 2:其次是 訊息處理程式管道層,這里比如日志和快取。OWIN的參考是將訊息處理程式管道的一些功能下移到堆疊下端的OWIN中間件了。 3:控制器處理 ......

    uj5u.com 2020-09-09 22:11:13 more
  • 微信門戶開發框架-使用指導說明書

    微信門戶應用管理系統,采用基于 MVC + Bootstrap + Ajax + Enterprise Library的技術路線,界面層采用Boostrap + Metronic組合的前端框架,資料訪問層支持Oracle、SQLServer、MySQL、PostgreSQL等資料庫。框架以MVC5,... ......

    uj5u.com 2020-09-09 22:15:18 more
  • WebAPI-HTTP編程模型

    帶著問題去思考,大家好!它是什么?它包含什么?它能干什么? 訊息 HTTP編程模型的核心就是訊息抽象,表示為:HttPRequestMessage,HttpResponseMessage.用于客戶端和服務端之間交換請求和回應訊息。 HttpMethod類包含了一組靜態屬性: private stat ......

    uj5u.com 2020-09-09 22:15:23 more
  • 部署WebApi隨筆

    一、跨域 NuGet參考Microsoft.AspNet.WebApi.Cors WebApiConfig.cs中配置: // Web API 配置和服務 config.EnableCors(new EnableCorsAttribute("*", "*", "*")); 二、清除默認回傳XML格式 ......

    uj5u.com 2020-09-09 22:15:48 more
最新发布
  • C#多執行緒學習(二) 如何操縱一個執行緒

    <a href="https://www.cnblogs.com/x-zhi/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/2943582/20220801082530.png" alt="" /></...

    uj5u.com 2023-04-19 09:17:20 more
  • C#多執行緒學習(二) 如何操縱一個執行緒

    C#多執行緒學習(二) 如何操縱一個執行緒 執行緒學習第一篇:C#多執行緒學習(一) 多執行緒的相關概念 下面我們就動手來創建一個執行緒,使用Thread類創建執行緒時,只需提供執行緒入口即可。(執行緒入口使程式知道該讓這個執行緒干什么事) 在C#中,執行緒入口是通過ThreadStart代理(delegate)來提供的 ......

    uj5u.com 2023-04-19 09:16:49 more
  • 記一次 .NET某醫療器械清洗系統 卡死分析

    <a href="https://www.cnblogs.com/huangxincheng/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/214741/20200614104537.png" alt="" /&g...

    uj5u.com 2023-04-18 08:39:04 more
  • 記一次 .NET某醫療器械清洗系統 卡死分析

    一:背景 1. 講故事 前段時間協助訓練營里的一位朋友分析了一個程式卡死的問題,回過頭來看這個案例比較經典,這篇稍微整理一下供后來者少踩坑吧。 二:WinDbg 分析 1. 為什么會卡死 因為是表單程式,理所當然就是看主執行緒此時正在做什么? 可以用 ~0s ; k 看一下便知。 0:000> k # ......

    uj5u.com 2023-04-18 08:33:10 more
  • SignalR, No Connection with that ID,IIS

    <a href="https://www.cnblogs.com/smartstar/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/u36196.jpg" alt="" /></a>...

    uj5u.com 2023-03-30 17:21:52 more
  • 一次對pool的誤用導致的.net頻繁gc的診斷分析

    <a href="https://www.cnblogs.com/dotnet-diagnostic/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/3115652/20230225090434.png" alt=""...

    uj5u.com 2023-03-28 10:15:33 more
  • 一次對pool的誤用導致的.net頻繁gc的診斷分析

    <a href="https://www.cnblogs.com/dotnet-diagnostic/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/3115652/20230225090434.png" alt=""...

    uj5u.com 2023-03-28 10:13:31 more
  • C#遍歷指定檔案夾中所有檔案的3種方法

    <a href="https://www.cnblogs.com/xbhp/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/957602/20230310105611.png" alt="" /></a&...

    uj5u.com 2023-03-27 14:46:55 more
  • C#/VB.NET:如何將PDF轉為PDF/A

    <a href="https://www.cnblogs.com/Carina-baby/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/2859233/20220427162558.png" alt="" />...

    uj5u.com 2023-03-27 14:46:35 more
  • 武裝你的WEBAPI-OData聚合查詢

    <a href="https://www.cnblogs.com/podolski/" target="_blank"><img width="48" height="48" class="pfs" src="https://pic.cnblogs.com/face/616093/20140323000327.png" alt="" /><...

    uj5u.com 2023-03-27 14:46:16 more